Difference between revisions of "1992 AIME Problems/Problem 5"
I_like_pie (talk | contribs) |
m |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | Let <math>S^{}_{}</math> be the set of all rational numbers <math>r^{}_{}</math>, <math>0^{}_{}<r<1</math>, that have a repeating decimal expansion in the form <math>0.abcabcabc\ldots=0.\overline{abc}</math>, where the digits <math>a^{}_{}</math>, <math>b^{}_{}</math>, and <math>c^{}_{}</math> are not necessarily distinct. To write the elements of <math>S^{}_{}</math> as fractions in lowest terms, how many different numerators are required? | ||
== Solution == | == Solution == | ||
Revision as of 21:29, 10 March 2007
Problem
Let 
be the set of all rational numbers 
, 
, that have a repeating decimal expansion in the form 
, where the digits 
, 
, and 
are not necessarily distinct. To write the elements of 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.
