Difference between revisions of "2024 AMC 8 Problems/Problem 15"
m (Protected "2024 AMC 8 Problems/Problem 15": Excessive spamming ([Edit=Allow only administrators] (expires 17:00, 25 January 2024 (UTC)) [Move=Allow only administrators] (expires 17:00, 25 January 2024 (UTC)))) |
(→Problem) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| + | Let the letters <math>F</math>,<math>L</math>,<math>Y</math>,<math>B</math>,<math>U</math>,<math>G</math> represent distinct digits. Suppose <math>\underline{F}~\underline{L}~\underline{Y}~\underline{F}~\underline{L}~\underline{Y}</math> is the greatest number that satisfies the equation | ||
| + | |||
| + | <cmath>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}.</cmath> | ||
| + | |||
| + | What is the value of <math>\underline{F}~\underline{L}~\underline{Y}+\underline{B}~\underline{U}~\underline{G}</math>? | ||
| + | |||
| + | <math>\textbf{(A)}\ 1089 \qquad \textbf{(B)}\ 1098 \qquad \textbf{(C)}\ 1107 \qquad \textbf{(D)}\ 1116 \qquad \textbf{(E)}\ 1125</math> | ||
==Solution== | ==Solution== | ||
Revision as of 13:58, 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 
?
