Difference between revisions of "1992 AIME Problems/Problem 5"

m
m (See also: box)
Line 6: Line 6:
  
 
== See also ==
 
== See also ==
* [[1992 AIME Problems/Problem 4 | Previous Problem]]
+
{{AIME box|year=1992|num-b=4|num-a=6}}
 
 
* [[1992 AIME Problems/Problem 6 | Next Problem]]
 
 
 
* [[1992 AIME Problems]]
 

Revision as of 14:57, 11 March 2007

Problem

Let $S^{}_{}$ be the set of all rational numbers $r^{}_{}$, $0^{}_{}<r<1$, that have a repeating decimal expansion in the form $0.abcabcabc\ldots=0.\overline{abc}$, where the digits $a^{}_{}$, $b^{}_{}$, and $c^{}_{}$ are not necessarily distinct. To write the elements of $S^{}_{}$ as fractions in lowest terms, how many different numerators are required?

Solution

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

See also

1992 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 4
Followed by
Problem 6
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions