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 "2017 AIME I Problems/Problem 14"

(added problem and solution)
 
m (→‎Solution)
Line 31: Line 31:
 
<cmath>12 = \log_2\left(\frac{64}{3}\log_2(x)\right)</cmath>
 
<cmath>12 = \log_2\left(\frac{64}{3}\log_2(x)\right)</cmath>
  
−
<cmath>2^12 = \frac{64}{3}\log_2(x)</cmath>
+
<cmath>2^{12} = \frac{64}{3}\log_2(x)</cmath>
  
 
<cmath>192 = \log_2(x)</cmath>
 
<cmath>192 = \log_2(x)</cmath>
Line 49: Line 49:
 
<cmath>x\equiv 21\bmod 125, x\equiv 0\bmod 8.</cmath>
 
<cmath>x\equiv 21\bmod 125, x\equiv 0\bmod 8.</cmath>
  
−
Using CRT, we get that <math>x\equiv \boxed{896}\bmod 1000</math>, finishing the solution.  
+
Using CRT, we get that <math>x\equiv \boxed{896}\bmod 1000</math>, finishing the solution.
  
 
== See also ==
 
== See also ==
 
{{AIME box|year=2017|n=I|num-b=13|num-a=15}}
 
{{AIME box|year=2017|n=I|num-b=13|num-a=15}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 16:32, 8 March 2017

Problem

Let $a > 1$ and $x > 1$ satisfy $\log_a(\log_a(\log_a 2) + \log_a 24 - 128) = 128$ and $\log_a(\log_a x) = 256$. Find the remainder when $x$ is divided by $1000$.

Solution

The first condition implies

\[a^{128} = \log_a\log_a 2 + \log_a 24 - 128\]

\[128+a^{128} = \log_a\log_a 2^{24}\]

\[a^{a^{128}a^{a^{128}}} = 2^{24}\]

\[\left(a^{a^{128}}\right)^{\left(a^{a^{128}}\right)} = 2^{24} = 8^8\]

So $a^{a^{128}} = 8$.

Putting each side to the power of $128$:

\[\left(a^{128}\right)^{\left(a^{128}\right)} = 8^{128} = 64^{64},\]

so $a^{128} = 64 \implies a = 2^{\frac{3}{64}}$. Specifically,

\[\log_a(y) = \frac{\log_2(y)}{\log_2(a)} = \frac{64}{3}\log_2(y)\]

so we have that

\[256 = \log_a(\log_a(y)) = \frac{64}{3}\log_2\left(\frac{64}{3}\log_2(x)\right)\]

\[12 = \log_2\left(\frac{64}{3}\log_2(x)\right)\]

\[2^{12} = \frac{64}{3}\log_2(x)\]

\[192 = \log_2(x)\]

\[x = 2^{192}\]

We only wish to find $x\bmod 1000$. To do this, we note that $x\equiv 0\bmod 8$ and now, by the Chinese Remainder Theorem, wish only to find $x\bmod 125$. By Euler's Theorem:

\[2^{\phi(125)} = 2^{100} \equiv 1\bmod 125\]

so

\[2^{192} \equiv \frac{1}{2^8} \equiv \frac{1}{256} \equiv \frac{1}{6} \bmod 125\]

so we only need to find the inverse of $6 \bmod 125$. It is easy to realize that $6\cdot 21 = 126 \equiv 1\bmod 125$, so

\[x\equiv 21\bmod 125, x\equiv 0\bmod 8.\]

Using CRT, we get that $x\equiv \boxed{896}\bmod 1000$, finishing the solution.

See also

2017 AIME I (Problems • Answer Key • Resources)
Preceded by
Problem 13 		Followed by
Problem 15
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2017_AIME_I_Problems/Problem_14&oldid=84476"