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

m
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>.
+
The number
 +
<center><math>\frac 2{\log_4{2000^6}} + \frac 3{\log_5{2000^6}}</math></center>
 +
can be written as <math>\frac mn</math> where <math>m</math> and <math>n</math> are relatively prime positive integers.  Find <math>m + n</math>.
  
 
== Solution ==
 
== Solution ==

Revision as of 19:21, 11 November 2007

Problem

The number

$\frac 2{\log_4{2000^6}} + \frac 3{\log_5{2000^6}}$

can be written as $\frac mn$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

2000 AIME II (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