MathDB
Decimal Expansion

Source:

February 10, 2006
floor functionfunction

Problem Statement

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