Difference between revisions of "2024 AMC 8 Problems/Problem 15"
(→Solution) |
(→Video Solution by Math-X (First fully understand the problem!!!)) |
||
| Line 20: | Line 20: | ||
https://www.youtube.com/watch?v=JK4HWnqw-t0 | https://www.youtube.com/watch?v=JK4HWnqw-t0 | ||
| − | + | -Akhil Ravuri, John Adams Middle School | |
Revision as of 13:48, 25 January 2024
Problem
Let the letters 
,
,
,
,
,
represent distinct digits. Suppose 
is the greatest number that satisfies the equation
![\[8\cdot\underline{F}~\underline{L}~\underline{Y}~\underline{F}~\underline{L}~\underline{Y}=\underline{B}~\underline{U}~\underline{G}~\underline{B}~\underline{U}~\underline{G}.\]](http://latex.artofproblemsolving.com/0/4/7/047513b257239e4538e713105a012a223b79ded7.png)
What is the value of 
?
Solution
The highest that FLYFLY can be would have to be 124124, and cannot exceed that because it would exceed the 6-digit limit set on BUGBUG.
So, if we start at 124124*8, we get 992992, which would be wrong because the numbers cannot be repeated.
If we move on to 123123 and multiply by 8, we get 984984, all the digits are different, so FLY+BUG would be 123+984, which is 1107. So, therefore, the answer is C, 1107.
-Akhil Ravuri, John Adams Middle School
Video Solution by Math-X (First fully understand the problem!!!)
https://www.youtube.com/watch?v=JK4HWnqw-t0
-Akhil Ravuri, John Adams Middle School
