Difference between revisions of "2023 AMC 8 Problems/Problem 18"
m (→Video Solution by OmegaLearn (Using Restrictive Counting)) |
Irorlpiggy (talk | contribs) |
||
| Line 18: | Line 18: | ||
==Video Solution by OmegaLearn (Restrictive Counting)== | ==Video Solution by OmegaLearn (Restrictive Counting)== | ||
https://youtu.be/gIjhiw1CUgY | https://youtu.be/gIjhiw1CUgY | ||
| + | |||
| + | ==Video Solution by Magic Square== | ||
| + | https://youtu.be/-N46BeEKaCQ?t=3673 | ||
==See Also== | ==See Also== | ||
{{AMC8 box|year=2023|num-b=17|num-a=19}} | {{AMC8 box|year=2023|num-b=17|num-a=19}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 11:35, 25 January 2023
Contents
Problem
Greta Grasshopper sits on a long line of lily pads in a pond. From any lily pad, Greta can jump 5 pads to the right or 3 pads to the left. What is the fewest number of jumps Greta must make to reach the lilly pad located 2023 pads to the right of her starting position?
Solution
We have 
directions going 
right or 
left. We can assign a variable to each of these directions. We can call going right 1 direction X and we can call going 1 left Y. We can build a equation of 
. Where we have to limit the number of moves we do. We can do this by making more of our moves the move turn then the move turn. The first obvious step is to go some amount of moves in the → direction then subtract off in the ← direction to land on 
. The least amount of ’s added to to make a multiple of is 
as 
. So now we have solved the problem as we just go 
hops right, and just do 4 more hops left. Yielding 
as our answer.
~apex304, SohumUttamchandani, wuwang2002, TaeKim, Cxrupptedpat, lpieleanu
Animated Video Solution
~Star League (https://starleague.us)
Video Solution by OmegaLearn (Restrictive Counting)
Video Solution by Magic Square
https://youtu.be/-N46BeEKaCQ?t=3673
See Also
| 2023 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 17 |
Followed by Problem 19 | |
| 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. 
