Difference between revisions of "1989 AIME Problems/Problem 3"
Jackshi2006 (talk | contribs) (→Solution 4) |
m |
||
(One intermediate revision by one other user not shown) | |||
Line 4: | Line 4: | ||
== Solution == | == Solution == | ||
− | Repeating decimals represent [[rational number]]s. To figure out which rational number, we sum an [[infinite]] [[geometric series]], <math>0.d25d25d25\ldots = \sum_{ | + | Repeating decimals represent [[rational number]]s. To figure out which rational number, we sum an [[infinite]] [[geometric series]], <math>0.d25d25d25\ldots = \sum_{n = 1}^\infty \frac{d25}{1000^n} = \frac{100d + 25}{999}</math>. Thus <math>\frac{n}{810} = \frac{100d + 25}{999}</math> so <math>n = 30\frac{100d + 25}{37} =750\frac{4d + 1}{37}</math>. Since 750 and 37 are [[relatively prime]], <math>4d + 1</math> must be [[divisible]] by 37, and the only digit for which this is possible is <math>d = 9</math>. Thus <math>4d + 1 = 37</math> and <math>n = \boxed{750}</math>. |
Line 26: | Line 26: | ||
==Solution 4== | ==Solution 4== | ||
− | Write out | + | Write out these equations: |
Latest revision as of 19:34, 25 April 2021
Problem
Suppose is a positive integer and is a single digit in base 10. Find if
Solution
Repeating decimals represent rational numbers. To figure out which rational number, we sum an infinite geometric series, . Thus so . Since 750 and 37 are relatively prime, must be divisible by 37, and the only digit for which this is possible is . Thus and .
(Note: Any repeating sequence of digits that looks like can be written as , where represents an digit number.)
Solution 2
To get rid of repeating decimals, we multiply the equation by 1000. We get We subtract the original equation from the second to get We simplify to Since is an integer, because is relatively prime to , and d25 is divisible by but not . The only odd number that yields a single digit and 25 at the end of the three digit number is , so the answer is .
Solution 3
Similar to Solution 2, we start off by writing that .Then we subtract this from the original equation to get:
Since n is an integer, we have that .
Since is prime, we can apply Euclid's Lemma (which states that if is a prime and if and are integers and if , then or ) to realize that , since . Then we can expand as . Since , by Euclid, we can arrive at . From this we know that . (This is true because )
~qwertysri987
Solution 4
Write out these equations:
Thus divides 25 and 30. The only solution for this under 1000 is .
-jackshi2006
See also
1989 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
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.