Difference between revisions of "1993 AIME Problems/Problem 6"
(wikify) |
(Added a new solution) |
||
Line 20: | Line 20: | ||
<math>n \equiv 0 \pmod{11}</math> | <math>n \equiv 0 \pmod{11}</math> | ||
− | Since 9 and 11 are relatively prime, n is a multiple of 99. It can then easily be determined that the smallest multiple of 99 with a units digit 5 (this can be | + | Since 9 and 11 are relatively prime, n is a multiple of 99. It can then easily be determined that the smallest multiple of 99 with a units digit 5 (this can be interpreted from the 2nd congruence) is <math>\boxed{495}</math> |
+ | |||
+ | === Solution 3 === | ||
+ | |||
+ | Let <math>n</math> be the desired integer. From the given information, we have | ||
+ | <cmath> 9x = a \\ 11y = a \\ 10z + 5 = a, </cmath> here, <math>x,</math> and <math>y</math> are the middle terms of the sequence of 9 and 11 numbers, respectively. Similarly, we have <math>z</math> as the 4th term of the sequence. Since, <math>s</math> is a multiple of <math>9</math> and <math>11,</math> it is also a multiple of <math>\lcm[9,11]=99.</math> Hence, <math>a=99m,</math> for some <math>m.</math> So, we have <math>10z + 5 = 99m.</math> It follows that <math>99(5) = 495</math> is the smallest integer that can be represented in such a way. | ||
== See also == | == See also == | ||
{{AIME box|year=1993|num-b=5|num-a=7}} | {{AIME box|year=1993|num-b=5|num-a=7}} |
Revision as of 21:00, 29 January 2010
Problem
What is the smallest positive integer than can be expressed as the sum of nine consecutive integers, the sum of ten consecutive integers, and the sum of eleven consecutive integers?
Solution
Solution 1
Denote the first of each of the series of consecutive integers as . Therefore, . Simplifying, . The relationship between suggests that is divisible by . Also, , so is divisible by . We find that the least possible value of , so the answer is .
Solution 2
Let the desired integer be . From the information given, it can be determined that, for positive integers :
This can be rewritten as the following congruences:
Since 9 and 11 are relatively prime, n is a multiple of 99. It can then easily be determined that the smallest multiple of 99 with a units digit 5 (this can be interpreted from the 2nd congruence) is
Solution 3
Let be the desired integer. From the given information, we have here, and are the middle terms of the sequence of 9 and 11 numbers, respectively. Similarly, we have as the 4th term of the sequence. Since, is a multiple of and it is also a multiple of $\lcm[9,11]=99.$ (Error compiling LaTeX. ! Undefined control sequence.) Hence, for some So, we have It follows that is the smallest integer that can be represented in such a way.
See also
1993 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 5 |
Followed by Problem 7 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |