Difference between revisions of "2022 AIME I Problems/Problem 13"
Oxymoronic15 (talk | contribs) m |
Oxymoronic15 (talk | contribs) (→Problem) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| − | + | Let <math>S</math> be the set of all rational numbers that can be expressed as a repeating decimal in the form <math>0.\overline{abcd},</math> where at least one of the digits <math>a,</math> <math>b,</math> <math>c,</math> or <math>d</math> is nonzero. Let <math>N</math> be the number of distinct numerators obtained when numbers in <math>S</math> are written as fractions in lowest terms. For example, both <math>4</math> and <math>410</math> are counted among the distinct numerators for numbers in <math>S</math> because <math>0.\overline{3636} = \frac{4}{11}</math> and <math>0.\overline{1230} = \frac{410}{3333}.</math> Find the remainder when <math>N</math> is divided by <math>1000.</math> | |
| − | |||
==See Also== | ==See Also== | ||
{{AIME box|year=2022|n=I|num-b=10|num-a=13}} | {{AIME box|year=2022|n=I|num-b=10|num-a=13}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 00:57, 18 February 2022
Problem
Let 
be the set of all rational numbers that can be expressed as a repeating decimal in the form 
where at least one of the digits 
or 
is nonzero. Let 
be the number of distinct numerators obtained when numbers in are written as fractions in lowest terms. For example, both 
and 
are counted among the distinct numerators for numbers in because 
and 
Find the remainder when is divided by 
See Also
| 2022 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 10 |
Followed by Problem 13 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
