During AMC testing, the AoPS Wiki is in read-only mode. No edits can be made.

Difference between revisions of "Mock AIME I 2015 Problems/Problem 9"

(original solution was incorrect, updated with correct answers)
m
 
Line 15: Line 15:
 
If <math>k=1</math>, then <math>c=1, 4, 16, 64, 256</math> and <math>b=1, 2, 4, 8, 16, 32, 64, 128, 256</math> for <math>5\cdot 9=45</math> solutions.
 
If <math>k=1</math>, then <math>c=1, 4, 16, 64, 256</math> and <math>b=1, 2, 4, 8, 16, 32, 64, 128, 256</math> for <math>5\cdot 9=45</math> solutions.
  
If <math>k=9</math>, then <math>c=1, 4, 16, 64, 256</math> and <math>b=1, 2, 4, 8, 16, 32</math> for <math>5\dot 6=30</math> solutions.
+
If <math>k=9</math>, then <math>c=1, 4, 16, 64, 256</math> and <math>b=1, 2, 4, 8, 16, 32</math> for <math>5\cdot 6=30</math> solutions.
  
If <math>k=25</math>, then <math>c=1, 4, 16, 64, 256</math> and <math>b=1, 2, 4, 8, 16</math> for <math>5\dot 5=25</math> solutions.
+
If <math>k=25</math>, then <math>c=1, 4, 16, 64, 256</math> and <math>b=1, 2, 4, 8, 16</math> for <math>5\cdot 5=25</math> solutions.
  
If <math>k=121</math>, then <math>c=1, 4, 16, 64, 256</math> and <math>b=1, 2, 4</math> for <math>5\dot 3=15</math> solutions.
+
If <math>k=121</math>, then <math>c=1, 4, 16, 64, 256</math> and <math>b=1, 2, 4</math> for <math>5\cdot 3=15</math> solutions.
  
 
This is a total of <math>\fbox{115}</math> solutions.
 
This is a total of <math>\fbox{115}</math> solutions.

Latest revision as of 20:27, 1 March 2020

Since $a$ is a multiple of $b$, let $a=kb$.

We can rewrite the first and second conditions as:

(a) $(bk)bc$ is a perfect square, or $ck$ is a perfect square.

(b) $b(k+7)c$ is a power of $2$, so it follows that $b$, $c$, and $k+7$ are all powers of $2$.

Now we use casework on $k$. Since $k+7$ is a power of $2$, $k$ is $1, 9, 25, 57, 121,$ or $249$ or $k>500$.

If $k>500$, then no value of $b$ makes $1\leq a, b\leq 500$.

If $k=57$ or $k=249$, then no value of $c$ that is a power of $2$ makes $ck$ a perfect square.

If $k=1$, then $c=1, 4, 16, 64, 256$ and $b=1, 2, 4, 8, 16, 32, 64, 128, 256$ for $5\cdot 9=45$ solutions.

If $k=9$, then $c=1, 4, 16, 64, 256$ and $b=1, 2, 4, 8, 16, 32$ for $5\cdot 6=30$ solutions.

If $k=25$, then $c=1, 4, 16, 64, 256$ and $b=1, 2, 4, 8, 16$ for $5\cdot 5=25$ solutions.

If $k=121$, then $c=1, 4, 16, 64, 256$ and $b=1, 2, 4$ for $5\cdot 3=15$ solutions.

This is a total of $\fbox{115}$ solutions.

Invalid username
Login to AoPS