Difference between revisions of "2024 AMC 8 Problems/Problem 14"
Niuniumaths (talk | contribs) (→Video Solution by NiuniuMaths (Easy to understand!)) |
(→Video Solution 3 by NiuniuMaths (Easy to understand!)) |
||
Line 17: | Line 17: | ||
~NiuniuMaths | ~NiuniuMaths | ||
+ | |||
+ | == Video Solution by CosineMethod [🔥Fast and Easy🔥]== | ||
+ | |||
+ | https://www.youtube.com/watch?v=bAxLRYT6SCw | ||
==See Also== | ==See Also== | ||
{{AMC8 box|year=2024|num-b=13|num-a=15}} | {{AMC8 box|year=2024|num-b=13|num-a=15}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 17:27, 27 January 2024
Contents
[hide]Problem
The one-way routes connecting towns and are shown in the figure below(not drawn to scale).The distances in kilometers along each route are marked. Traveling along these routes, what is the shortest distance form A to Z in kilometers?
Solution 1
We can simply see that path will give us the smallest value. Adding, . This is nice as it’s also the smallest value, solidifying our answer.
~MaxyMoosy
Video Solution 1 (easy to digest) by Power Solve
Video Solution 2 by SpreadTheMathLove
https://www.youtube.com/watch?v=RRTxlduaDs8
Video Solution 3 by NiuniuMaths (Easy to understand!)
https://www.youtube.com/watch?v=V-xN8Njd_Lc
~NiuniuMaths
Video Solution by CosineMethod [🔥Fast and Easy🔥]
https://www.youtube.com/watch?v=bAxLRYT6SCw
See Also
2024 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.