Difference between revisions of "2000 AIME I Problems/Problem 1"
m |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | Find the least positive integer <math>n</math> such that no matter how <math>10^{n}</math> is expressed as the product of any two positive integers, at least one of these two integers contains the digit <math>0</math>. | ||
== Solution == | == Solution == | ||
| + | {{solution}} | ||
== See also == | == See also == | ||
| − | + | {{AIME box|year=2000|n=I|before=First Question|num-a=2}} | |
Revision as of 18:19, 11 November 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
This problem needs a solution. If you have a solution for it, please help us out by adding it.
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 | ||
