What's a quick method of solving this type of question?
$begingroup$
Two points A and B are 200M apart. Two lions are at the opposite ends when they start running towards the other point with speeds 18km/hr (lion at point A) and 36km/hr (Lion at point B) respectively. At the same time a deer starts running from point A towards point B with a speed 216/5 km/hr. The deer turns back whenever he encounters a lion in its path. Find the total distance covered by the deer until he's eaten.
I solved this by the trivial method. First calculate when and where the deer will meet the B lion. Then calculate the distance the A lion would've already covered in the same time. Then change the deer's direction and calculate when and where he'll meet the A lion. And so on
I was wondering if there's any other more systematic method (using modular arithmetic or anything else) of solving this. My method could be tedious for this question if the distances were larger or if the lions were slower. I think it'd be really cool if someone could model this with matrices.
modular-arithmetic word-problem
asked Dec 19 '18 at 5:59
Ryder RudeRyder Rude
400111
$endgroup$
add a comment |
$begingroup$
Two points A and B are 200M apart. Two lions are at the opposite ends when they start running towards the other point with speeds 18km/hr (lion at point A) and 36km/hr (Lion at point B) respectively. At the same time a deer starts running from point A towards point B with a speed 216/5 km/hr. The deer turns back whenever he encounters a lion in its path. Find the total distance covered by the deer until he's eaten.
I solved this by the trivial method. First calculate when and where the deer will meet the B lion. Then calculate the distance the A lion would've already covered in the same time. Then change the deer's direction and calculate when and where he'll meet the A lion. And so on
I was wondering if there's any other more systematic method (using modular arithmetic or anything else) of solving this. My method could be tedious for this question if the distances were larger or if the lions were slower. I think it'd be really cool if someone could model this with matrices.
modular-arithmetic word-problem
asked Dec 19 '18 at 5:59
Ryder RudeRyder Rude
400111
$endgroup$
$begingroup$
"I solved this by the trivial method. First calculate when and where the deer will meet the B lion....And so on" How the heck did you do the "and so on"? There are an infinite number of equations to do. "My method could be tedious for this question if the distances were larger or if the lions were slower." No it wouldn't. You would still have to do the same amount of infinite number of calculations.
$endgroup$
– fleablood
Dec 19 '18 at 6:44
$begingroup$
@fleabloof I just approximated it.
$endgroup$
– Ryder Rude
Dec 19 '18 at 7:26
add a comment |
$begingroup$
Two points A and B are 200M apart. Two lions are at the opposite ends when they start running towards the other point with speeds 18km/hr (lion at point A) and 36km/hr (Lion at point B) respectively. At the same time a deer starts running from point A towards point B with a speed 216/5 km/hr. The deer turns back whenever he encounters a lion in its path. Find the total distance covered by the deer until he's eaten.
I solved this by the trivial method. First calculate when and where the deer will meet the B lion. Then calculate the distance the A lion would've already covered in the same time. Then change the deer's direction and calculate when and where he'll meet the A lion. And so on
I was wondering if there's any other more systematic method (using modular arithmetic or anything else) of solving this. My method could be tedious for this question if the distances were larger or if the lions were slower. I think it'd be really cool if someone could model this with matrices.
modular-arithmetic word-problem
asked Dec 19 '18 at 5:59
Ryder RudeRyder Rude
400111
$endgroup$
Two points A and B are 200M apart. Two lions are at the opposite ends when they start running towards the other point with speeds 18km/hr (lion at point A) and 36km/hr (Lion at point B) respectively. At the same time a deer starts running from point A towards point B with a speed 216/5 km/hr. The deer turns back whenever he encounters a lion in its path. Find the total distance covered by the deer until he's eaten.
I solved this by the trivial method. First calculate when and where the deer will meet the B lion. Then calculate the distance the A lion would've already covered in the same time. Then change the deer's direction and calculate when and where he'll meet the A lion. And so on
I was wondering if there's any other more systematic method (using modular arithmetic or anything else) of solving this. My method could be tedious for this question if the distances were larger or if the lions were slower. I think it'd be really cool if someone could model this with matrices.
modular-arithmetic word-problem
modular-arithmetic word-problem
asked Dec 19 '18 at 5:59
Ryder RudeRyder Rude
400111
asked Dec 19 '18 at 5:59
Ryder RudeRyder Rude
400111
edited Dec 19 '18 at 6:15
Ryder Rude
asked Dec 19 '18 at 5:59
Ryder RudeRyder Rude
400111
asked Dec 19 '18 at 5:59
Ryder RudeRyder Rude
400111
asked Dec 19 '18 at 5:59
Ryder RudeRyder Rude
400111
400111
$begingroup$
"I solved this by the trivial method. First calculate when and where the deer will meet the B lion....And so on" How the heck did you do the "and so on"? There are an infinite number of equations to do. "My method could be tedious for this question if the distances were larger or if the lions were slower." No it wouldn't. You would still have to do the same amount of infinite number of calculations.
$endgroup$
– fleablood
Dec 19 '18 at 6:44
$begingroup$
@fleabloof I just approximated it.
$endgroup$
– Ryder Rude
Dec 19 '18 at 7:26
add a comment |
$begingroup$
"I solved this by the trivial method. First calculate when and where the deer will meet the B lion....And so on" How the heck did you do the "and so on"? There are an infinite number of equations to do. "My method could be tedious for this question if the distances were larger or if the lions were slower." No it wouldn't. You would still have to do the same amount of infinite number of calculations.
$endgroup$
– fleablood
Dec 19 '18 at 6:44
$begingroup$
@fleabloof I just approximated it.
$endgroup$
– Ryder Rude
Dec 19 '18 at 7:26
$begingroup$
"I solved this by the trivial method. First calculate when and where the deer will meet the B lion....And so on" How the heck did you do the "and so on"? There are an infinite number of equations to do. "My method could be tedious for this question if the distances were larger or if the lions were slower." No it wouldn't. You would still have to do the same amount of infinite number of calculations.
$endgroup$
– fleablood
Dec 19 '18 at 6:44
$begingroup$
"I solved this by the trivial method. First calculate when and where the deer will meet the B lion....And so on" How the heck did you do the "and so on"? There are an infinite number of equations to do. "My method could be tedious for this question if the distances were larger or if the lions were slower." No it wouldn't. You would still have to do the same amount of infinite number of calculations.
$endgroup$
– fleablood
Dec 19 '18 at 6:44
$begingroup$
@fleabloof I just approximated it.
$endgroup$
– Ryder Rude
Dec 19 '18 at 7:26
$begingroup$
@fleabloof I just approximated it.
$endgroup$
– Ryder Rude
Dec 19 '18 at 7:26
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is a famous puzzle.
Ignore the deer. Figure out how long it will take for the lions to meet each other.
If the time is $t$ one lion will have run $18t$ and the other $36t$ and the add up to the $200$ km.
So $18t + 36t = 200$.
Then the deer will have run $frac {216}5 t$ km in that time.
That's all.
answered Dec 19 '18 at 6:41
fleabloodfleablood
69.4k22685
$endgroup$
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3046052%2fwhats-a-quick-method-of-solving-this-type-of-question%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This is a famous puzzle.
Ignore the deer. Figure out how long it will take for the lions to meet each other.
If the time is $t$ one lion will have run $18t$ and the other $36t$ and the add up to the $200$ km.
So $18t + 36t = 200$.
Then the deer will have run $frac {216}5 t$ km in that time.
That's all.
answered Dec 19 '18 at 6:41
fleabloodfleablood
69.4k22685
$endgroup$
add a comment |
$begingroup$
This is a famous puzzle.
Ignore the deer. Figure out how long it will take for the lions to meet each other.
If the time is $t$ one lion will have run $18t$ and the other $36t$ and the add up to the $200$ km.
So $18t + 36t = 200$.
Then the deer will have run $frac {216}5 t$ km in that time.
That's all.
answered Dec 19 '18 at 6:41
fleabloodfleablood
69.4k22685
$endgroup$
add a comment |
$begingroup$
This is a famous puzzle.
Ignore the deer. Figure out how long it will take for the lions to meet each other.
If the time is $t$ one lion will have run $18t$ and the other $36t$ and the add up to the $200$ km.
So $18t + 36t = 200$.
Then the deer will have run $frac {216}5 t$ km in that time.
That's all.
answered Dec 19 '18 at 6:41
fleabloodfleablood
69.4k22685
$endgroup$
This is a famous puzzle.
Ignore the deer. Figure out how long it will take for the lions to meet each other.
If the time is $t$ one lion will have run $18t$ and the other $36t$ and the add up to the $200$ km.
So $18t + 36t = 200$.
Then the deer will have run $frac {216}5 t$ km in that time.
That's all.
answered Dec 19 '18 at 6:41
fleabloodfleablood
69.4k22685
answered Dec 19 '18 at 6:41
fleabloodfleablood
69.4k22685
answered Dec 19 '18 at 6:41
fleabloodfleablood
69.4k22685
answered Dec 19 '18 at 6:41
fleabloodfleablood
69.4k22685
69.4k22685
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3046052%2fwhats-a-quick-method-of-solving-this-type-of-question%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$begingroup$
"I solved this by the trivial method. First calculate when and where the deer will meet the B lion....And so on" How the heck did you do the "and so on"? There are an infinite number of equations to do. "My method could be tedious for this question if the distances were larger or if the lions were slower." No it wouldn't. You would still have to do the same amount of infinite number of calculations.
$endgroup$
– fleablood
Dec 19 '18 at 6:44
$begingroup$
@fleabloof I just approximated it.
$endgroup$
– Ryder Rude
Dec 19 '18 at 7:26