Sum of distance traveled between two runners in summation form












0












$begingroup$


Problem:



Assume two runners $A$ and $B$ are $2h_0$ meters apart. They start running towards each other at a speed of $a$ meters per second. Assume there is a third runner that runs in between the two runners at a speed of $b$ meters per second, with $b > a$. Whenever the third runner meets $A$ or $B$, he turns around and head towards to other person, never changing his speed. What is the total distance traveled by the third runner?





My solution:



Since the third runner is always in between $A$ and $B$, his running session ends when it $A$ meets $B$, which is in the middle, i.e. at position $h_0$.



Since the third runner's position never changes, it is logically the same to ask question of where does the third runner needs to start for all three of the runners to meet in the middle?



If we treat the middle as position $0$, with $A$ starting at $-h_0$ and $B$ starting at $h_0$, then it quickly becomes apparent that the third runner needs to start at a position $frac{bh_0}{a}$ from the middle. Indeed that's the answer.





Question:



How do I represent this in summation form without changing the question of the problem? What about if $A$ and $B$ are running at varying non-linear speed? In other words, how do I represent a piece-wise linear function that's going back and forth and converging between two intersecting monotonic functions?










share|cite|improve this question











$endgroup$












  • $begingroup$
    It doesn't matter where the third runner starts, they will always meet in the middle given A and B are equal distances from the middle and run at the same speed. The 3rd runner never moves from being in between A and B. All three runners run for the same amount of time. Is a the closing speed or the speed of each runner A and B? Assuming a is the closing speed, the time it takes for A and B to meet is $t = frac{2h_0}{a}$ secs. The distance the third runner travels is therefore $s = bcdot frac{2h_0}{a}$ m. If a is the individual speeds of A and B, then it's $s = bcdot frac{2h_0}{2a}$ m
    $endgroup$
    – Phil H
    Dec 22 '18 at 1:09












  • $begingroup$
    This is similar to the bee-flying-between-two-trains problem.
    $endgroup$
    – hypergeometric
    Jan 21 at 13:44
















0












$begingroup$


Problem:



Assume two runners $A$ and $B$ are $2h_0$ meters apart. They start running towards each other at a speed of $a$ meters per second. Assume there is a third runner that runs in between the two runners at a speed of $b$ meters per second, with $b > a$. Whenever the third runner meets $A$ or $B$, he turns around and head towards to other person, never changing his speed. What is the total distance traveled by the third runner?





My solution:



Since the third runner is always in between $A$ and $B$, his running session ends when it $A$ meets $B$, which is in the middle, i.e. at position $h_0$.



Since the third runner's position never changes, it is logically the same to ask question of where does the third runner needs to start for all three of the runners to meet in the middle?



If we treat the middle as position $0$, with $A$ starting at $-h_0$ and $B$ starting at $h_0$, then it quickly becomes apparent that the third runner needs to start at a position $frac{bh_0}{a}$ from the middle. Indeed that's the answer.





Question:



How do I represent this in summation form without changing the question of the problem? What about if $A$ and $B$ are running at varying non-linear speed? In other words, how do I represent a piece-wise linear function that's going back and forth and converging between two intersecting monotonic functions?










share|cite|improve this question











$endgroup$












  • $begingroup$
    It doesn't matter where the third runner starts, they will always meet in the middle given A and B are equal distances from the middle and run at the same speed. The 3rd runner never moves from being in between A and B. All three runners run for the same amount of time. Is a the closing speed or the speed of each runner A and B? Assuming a is the closing speed, the time it takes for A and B to meet is $t = frac{2h_0}{a}$ secs. The distance the third runner travels is therefore $s = bcdot frac{2h_0}{a}$ m. If a is the individual speeds of A and B, then it's $s = bcdot frac{2h_0}{2a}$ m
    $endgroup$
    – Phil H
    Dec 22 '18 at 1:09












  • $begingroup$
    This is similar to the bee-flying-between-two-trains problem.
    $endgroup$
    – hypergeometric
    Jan 21 at 13:44














0












0








0





$begingroup$


Problem:



Assume two runners $A$ and $B$ are $2h_0$ meters apart. They start running towards each other at a speed of $a$ meters per second. Assume there is a third runner that runs in between the two runners at a speed of $b$ meters per second, with $b > a$. Whenever the third runner meets $A$ or $B$, he turns around and head towards to other person, never changing his speed. What is the total distance traveled by the third runner?





My solution:



Since the third runner is always in between $A$ and $B$, his running session ends when it $A$ meets $B$, which is in the middle, i.e. at position $h_0$.



Since the third runner's position never changes, it is logically the same to ask question of where does the third runner needs to start for all three of the runners to meet in the middle?



If we treat the middle as position $0$, with $A$ starting at $-h_0$ and $B$ starting at $h_0$, then it quickly becomes apparent that the third runner needs to start at a position $frac{bh_0}{a}$ from the middle. Indeed that's the answer.





Question:



How do I represent this in summation form without changing the question of the problem? What about if $A$ and $B$ are running at varying non-linear speed? In other words, how do I represent a piece-wise linear function that's going back and forth and converging between two intersecting monotonic functions?










share|cite|improve this question











$endgroup$




Problem:



Assume two runners $A$ and $B$ are $2h_0$ meters apart. They start running towards each other at a speed of $a$ meters per second. Assume there is a third runner that runs in between the two runners at a speed of $b$ meters per second, with $b > a$. Whenever the third runner meets $A$ or $B$, he turns around and head towards to other person, never changing his speed. What is the total distance traveled by the third runner?





My solution:



Since the third runner is always in between $A$ and $B$, his running session ends when it $A$ meets $B$, which is in the middle, i.e. at position $h_0$.



Since the third runner's position never changes, it is logically the same to ask question of where does the third runner needs to start for all three of the runners to meet in the middle?



If we treat the middle as position $0$, with $A$ starting at $-h_0$ and $B$ starting at $h_0$, then it quickly becomes apparent that the third runner needs to start at a position $frac{bh_0}{a}$ from the middle. Indeed that's the answer.





Question:



How do I represent this in summation form without changing the question of the problem? What about if $A$ and $B$ are running at varying non-linear speed? In other words, how do I represent a piece-wise linear function that's going back and forth and converging between two intersecting monotonic functions?







summation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 22 '18 at 0:08







B.Li

















asked Dec 22 '18 at 0:03









B.LiB.Li

413210




413210












  • $begingroup$
    It doesn't matter where the third runner starts, they will always meet in the middle given A and B are equal distances from the middle and run at the same speed. The 3rd runner never moves from being in between A and B. All three runners run for the same amount of time. Is a the closing speed or the speed of each runner A and B? Assuming a is the closing speed, the time it takes for A and B to meet is $t = frac{2h_0}{a}$ secs. The distance the third runner travels is therefore $s = bcdot frac{2h_0}{a}$ m. If a is the individual speeds of A and B, then it's $s = bcdot frac{2h_0}{2a}$ m
    $endgroup$
    – Phil H
    Dec 22 '18 at 1:09












  • $begingroup$
    This is similar to the bee-flying-between-two-trains problem.
    $endgroup$
    – hypergeometric
    Jan 21 at 13:44


















  • $begingroup$
    It doesn't matter where the third runner starts, they will always meet in the middle given A and B are equal distances from the middle and run at the same speed. The 3rd runner never moves from being in between A and B. All three runners run for the same amount of time. Is a the closing speed or the speed of each runner A and B? Assuming a is the closing speed, the time it takes for A and B to meet is $t = frac{2h_0}{a}$ secs. The distance the third runner travels is therefore $s = bcdot frac{2h_0}{a}$ m. If a is the individual speeds of A and B, then it's $s = bcdot frac{2h_0}{2a}$ m
    $endgroup$
    – Phil H
    Dec 22 '18 at 1:09












  • $begingroup$
    This is similar to the bee-flying-between-two-trains problem.
    $endgroup$
    – hypergeometric
    Jan 21 at 13:44
















$begingroup$
It doesn't matter where the third runner starts, they will always meet in the middle given A and B are equal distances from the middle and run at the same speed. The 3rd runner never moves from being in between A and B. All three runners run for the same amount of time. Is a the closing speed or the speed of each runner A and B? Assuming a is the closing speed, the time it takes for A and B to meet is $t = frac{2h_0}{a}$ secs. The distance the third runner travels is therefore $s = bcdot frac{2h_0}{a}$ m. If a is the individual speeds of A and B, then it's $s = bcdot frac{2h_0}{2a}$ m
$endgroup$
– Phil H
Dec 22 '18 at 1:09






$begingroup$
It doesn't matter where the third runner starts, they will always meet in the middle given A and B are equal distances from the middle and run at the same speed. The 3rd runner never moves from being in between A and B. All three runners run for the same amount of time. Is a the closing speed or the speed of each runner A and B? Assuming a is the closing speed, the time it takes for A and B to meet is $t = frac{2h_0}{a}$ secs. The distance the third runner travels is therefore $s = bcdot frac{2h_0}{a}$ m. If a is the individual speeds of A and B, then it's $s = bcdot frac{2h_0}{2a}$ m
$endgroup$
– Phil H
Dec 22 '18 at 1:09














$begingroup$
This is similar to the bee-flying-between-two-trains problem.
$endgroup$
– hypergeometric
Jan 21 at 13:44




$begingroup$
This is similar to the bee-flying-between-two-trains problem.
$endgroup$
– hypergeometric
Jan 21 at 13:44










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3049019%2fsum-of-distance-traveled-between-two-runners-in-summation-form%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3049019%2fsum-of-distance-traveled-between-two-runners-in-summation-form%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Wiesbaden

Marschland

Dieringhausen