Difference between revisions of "2000 AIME I Problems/Problem 1"

m
(Solution)
 
(13 intermediate revisions by 9 users not shown)
Line 3: Line 3:
  
 
== Solution ==
 
== Solution ==
{{solution}}
+
If a factor of <math>10^{n}</math> has a <math>2</math> and a <math>5</math> in its [[prime factorization]], then that factor will end in a <math>0</math>. Therefore, we have left to consider the case when the two factors have the <math>2</math>s and the <math>5</math>s separated, so we need to find the first power of 2 or 5 that contains a 0.
 +
 
 +
For <math>n = 1:</math> <cmath>2^1 = 2 , 5^1 = 5</cmath>
 +
<math>n = 2:</math> <cmath>2^2 = 4 , 5 ^ 2 =25</cmath>
 +
<math>n = 3:</math> <cmath>2^3 = 8 , 5 ^3 = 125</cmath>
 +
 
 +
and so on, until,
 +
 
 +
<math>n = 8:</math> <math>2^8 = 256</math> | <math>5^8 = 390625</math>
 +
 
 +
We see that <math>5^8</math> contains the first zero, so <math>n = \boxed{8}</math>.
  
 
== See also ==
 
== See also ==
 
{{AIME box|year=2000|n=I|before=First Question|num-a=2}}
 
{{AIME box|year=2000|n=I|before=First Question|num-a=2}}
 +
 +
[[Category:Introductory Number Theory Problems]]
 +
{{MAA Notice}}

Latest revision as of 16:44, 16 December 2020

Problem

Find the least positive integer $n$ such that no matter how $10^{n}$ is expressed as the product of any two positive integers, at least one of these two integers contains the digit $0$.

Solution

If a factor of $10^{n}$ has a $2$ and a $5$ in its prime factorization, then that factor will end in a $0$. Therefore, we have left to consider the case when the two factors have the $2$s and the $5$s separated, so we need to find the first power of 2 or 5 that contains a 0.

For $n = 1:$ \[2^1 = 2 , 5^1 = 5\] $n = 2:$ \[2^2 = 4 , 5 ^ 2 =25\] $n = 3:$ \[2^3 = 8 , 5 ^3 = 125\]

and so on, until,

$n = 8:$ $2^8 = 256$ | $5^8 = 390625$

We see that $5^8$ contains the first zero, so $n = \boxed{8}$.

See also

2000 AIME I (ProblemsAnswer KeyResources)
Preceded by
First Question
Followed by
Problem 2
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