Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2024 AMC 8 Problems/Problem 15"

(→‎Video Solution 4 by SpreadTheMathLove)
m (→‎Solution 1)
Line 15: Line 15:
 
If we move on to <math>123123</math> and multiply by <math>8</math>, we get <math>984984</math>, all the digits are different, so <math>FLY+BUG</math> would be <math>123+984</math>, which is <math>1107</math>. So, the answer is <math>\boxed{\textbf{(C)}1107}</math>.  
 
If we move on to <math>123123</math> and multiply by <math>8</math>, we get <math>984984</math>, all the digits are different, so <math>FLY+BUG</math> would be <math>123+984</math>, which is <math>1107</math>. So, the answer is <math>\boxed{\textbf{(C)}1107}</math>.  
  
−
-Akhil Ravuri, John Adams Middle School
+
- Akhil Ravuri of John Adams Middle School
  
 
~ cxsmi (minor formatting edits)
 
~ cxsmi (minor formatting edits)

Revision as of 16:22, 26 January 2024

Problem

Let the letters $F$,$L$,$Y$,$B$,$U$,$G$ represent distinct digits. Suppose $\underline{F}~\underline{L}~\underline{Y}~\underline{F}~\underline{L}~\underline{Y}$ 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}.\]

What is the value of $\underline{F}~\underline{L}~\underline{Y}+\underline{B}~\underline{U}~\underline{G}$?

$\textbf{(A)}\ 1089 \qquad \textbf{(B)}\ 1098 \qquad \textbf{(C)}\ 1107 \qquad \textbf{(D)}\ 1116 \qquad \textbf{(E)}\ 1125$

Solution 1

The highest that $FLYFLY$ can be would have to be $124124$, and it cannot exceed that because it would exceed the $6$-digit limit set on $BUGBUG$.

So, if we start at $124124\cdot8$, 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, the answer is $\boxed{\textbf{(C)}1107}$.

- Akhil Ravuri of John Adams Middle School

~ cxsmi (minor formatting edits)

Solution 2

Notice that $\underline{F}~\underline{L}~\underline{Y}~\underline{F}~\underline{L}~\underline{Y} = 1000(\underline{F}~\underline{L}~\underline{Y}) + \underline{F}~\underline{L}~\underline{Y}$.

Likewise, $\underline{B}~\underline{U}~\underline{G}~\underline{B}~\underline{U}~\underline{G} = 1000(\underline{B}~\underline{U}~\underline{G}) + \underline{B}~\underline{U}~\underline{G}$.

Therefore, we have the following equation:

$8 \times 1001(\underline{F}~\underline{L}~\underline{Y}) = 1001(\underline{B}~\underline{U}~\underline{G})$.

Simplifying the equation gives

$8(\underline{F}~\underline{L}~\underline{Y}) = (\underline{B}~\underline{U}~\underline{G})$.

We can now use our equation to test each answer choice.

We have that $123123 \times 8 = 984984$, so we can find the sum:

$\underline{F}~\underline{L}~\underline{Y}+\underline{B}~\underline{U}~\underline{G} = 123 + 984 = 1107$.

So, the correct answer is $\textbf{(C)}\ 1107$.

- C. Ren, Thomas Grover Middle School

Video Solution 1 by Math-X (First fully understand the problem!!!)

https://www.youtube.com/watch?v=JK4HWnqw-t0

~Math-X

Video Solution 2 (easy to digest) by Power Solve

https://youtu.be/TKBVYMv__Bg

Video Solution 3 (2 minute solve, fast) by MegaMath

https://www.youtube.com/watch?v=QvJ1b0TzCTc

Video Solution 4 by SpreadTheMathLove

https://www.youtube.com/watch?v=RRTxlduaDs8

Video Solution by CosineMethod [🔥Fast and Easy🔥]

https://www.youtube.com/watch?v=77UBBu1bKxk

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2024_AMC_8_Problems/Problem_15&oldid=213201"