Difference between revisions of "2004 AIME I Problems/Problem 12"
I_like_pie (talk | contribs) |
|||
| Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
| + | {{solution}} | ||
== See also == | == See also == | ||
| + | * [[2004 AIME I Problems/Problem 11| Previous problem]] | ||
| + | |||
| + | * [[2004 AIME I Problems/Problem 13| Next problem]] | ||
| + | |||
* [[2004 AIME I Problems]] | * [[2004 AIME I Problems]] | ||
Revision as of 01:45, 6 November 2006
Problem
Let 
be the set of ordered pairs 
such that 
and ![$\left[\log_2{\left(\frac 1x\right)}\right]$](http://latex.artofproblemsolving.com/1/0/b/10b4ebe0c91d961ffd0a61a8a4bee5f7090f1916.png)
and ![$\left[\log_5{\left(\frac 1y\right)}\right]$](http://latex.artofproblemsolving.com/c/3/3/c33380736cf1c503a9bc24013f134f19b4cae85e.png)
are both even. Given that the area of the graph of is 
where 
and 
are relatively prime positive integers, find 
The notation ![$[z]$](http://latex.artofproblemsolving.com/d/4/d/d4d87c4df7a861f6bc1a1be5600dcf4111c49841.png)
denotes the greatest integer that is less than or equal to 
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
