Difference between revisions of "2000 AIME I Problems/Problem 1"
(fmtting) |
|||
Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
− | If | + | 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, in other words whether <math>2^n</math> or <math>5^n</math> produces a 0 first. |
− | + | {| cellspacing="8" cellpadding="8" | |
+ | |- | ||
+ | | || 1 || 2 || 3 || 4 || 5 || 6 || 7 || 8 || 9 || 10 | ||
+ | |- | ||
+ | | Powers of <math>2</math>: || <math>2</math> || <math>4</math> || <math>8</math> || <math>16</math> || <math>32</math> || <math>64</math> || <math>128</math> || <math>256</math> || <math>512</math> || <math>1\boxed{0}24</math> | ||
+ | |- | ||
+ | | Powers of <math>5</math>: || <math>5</math> || <math>25</math> || <math>125</math> || <math>625</math> || <math>3125</math> || <math>15625</math> || <math>78125</math> || <math>39\boxed{0}265</math> | ||
+ | |} | ||
− | + | We see that <math>5^8</math> generates the first zero, so the answer is <math>\boxed{008}</math>. | |
− | |||
− | <math>\boxed{008}</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]] |
Revision as of 15:23, 31 December 2007
Problem
Find the least positive integer such that no matter how is expressed as the product of any two positive integers, at least one of these two integers contains the digit .
Solution
If a factor of has a and a in its prime factorization, then that factor will end in a . Therefore, we have left to consider the case when the two factors have the s and the s separated, in other words whether or produces a 0 first.
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | |
Powers of : | ||||||||||
Powers of : |
We see that generates the first zero, so the answer is .
See also
2000 AIME I (Problems • Answer Key • Resources) | ||
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 |