Difference between revisions of "2000 AIME I Problems/Problem 1"
m (fixed typo in 5^8) |
(→Solution) |
||
Line 5: | Line 5: | ||
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. | 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. | ||
− | + | <math>2^1 = 2</math> | <math>5^1 = 5</math> | |
− | + | <math>2^2 = 4</math> | <math>5 ^ 2 =25</math> | |
− | + | <math>2^3 = 8</math> | <math>5 ^3 = 125</math> | |
− | + | . | |
− | + | . | |
− | + | . | |
− | + | <math>2^8 = 256</math> | <math>5^8 = 390625</math> | |
− | |||
We see that <math>5^8</math> generates the first zero, so the answer is <math>\boxed{008}</math>. | We see that <math>5^8</math> generates the first zero, so the answer is <math>\boxed{008}</math>. |
Revision as of 23:19, 7 August 2010
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.
| | |
. . .
|
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 |