Difference between revisions of "1993 AIME Problems/Problem 6"
(→Problem) |
Alexwin0806 (talk | contribs) m (→Solution) |
||
Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
=== Solution 1 === | === Solution 1 === | ||
− | Denote the first of each of the series of consecutive integers as <math>a,\ b,\ c</math>. Therefore, <math>n = a + (a + 1) \ldots (a + 8) = 9a + 36 = 10b + 45 = 11c + 55</math>. Simplifying, <math>9a = 10b + 9 = 11c + 19</math>. The relationship between <math>a,\ b</math> suggests that <math>b</math> is divisible by <math>9</math>. Also, <math>10b -10 = 10(b-1) = 11c</math>, so <math>b-1</math> is divisible by <math>11</math>. We find that the least possible value of <math>b = 45</math>, so the answer is <math>10(45) + 45 = 495< | + | Denote the first of each of the series of consecutive integers as <math>a,\ b,\ c</math>. Therefore, <math>n = a + (a + 1) \ldots (a + 8) = 9a + 36 = 10b + 45 = 11c + 55</math>. Simplifying, <math>9a = 10b + 9 = 11c + 19</math>. The relationship between <math>a,\ b</math> suggests that <math>b</math> is divisible by <math>9</math>. Also, <math>10b -10 = 10(b-1) = 11c</math>, so <math>b-1</math> is divisible by <math>11</math>. We find that the least possible value of <math>b = 45</math>, so the answer is <math>10(45) + 45 = </math>\boxed{495}<math>. |
=== Solution 2 === | === Solution 2 === | ||
− | Let the desired integer be <math>n< | + | Let the desired integer be </math>n<math>. From the information given, it can be determined that, for positive integers </math>a, \ b, \ c<math>: |
− | <math>n = 9a + 36 = 10b + 45 = 11c + 55< | + | </math>n = 9a + 36 = 10b + 45 = 11c + 55<math> |
This can be rewritten as the following congruences: | This can be rewritten as the following congruences: | ||
− | <math>n \equiv 0 \pmod{9}< | + | </math>n \equiv 0 \pmod{9}<math> |
− | <math>n \equiv 5 \pmod{10}< | + | </math>n \equiv 5 \pmod{10}<math> |
− | <math>n \equiv 0 \pmod{11}< | + | </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 interpreted from the 2nd congruence) is <math>\boxed{495}< | + | 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 === | === Solution 3 === | ||
− | Let <math>n< | + | Let </math>n<math> be the desired integer. From the given information, we have |
− | <cmath> \begin{align*}9x &= a \\ 11y &= a \\ 10z + 5 &= a, \end{align*}</cmath> here, <math>x,< | + | <cmath> \begin{align*}9x &= a \\ 11y &= a \\ 10z + 5 &= a, \end{align*}</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>a<math> is a multiple of </math>9<math> and </math>11,<math> it is also a multiple of </math>\text{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) = \boxed{495}<math> is the smallest integer that can be represented in such a way. |
=== Solution 4 === | === Solution 4 === | ||
− | By the method in Solution 1, we find that the number <math>n< | + | By the method in Solution 1, we find that the number </math>n<math> can be written as </math>9a+36=10b+45=11c+55<math> for some integers </math>a,b,c<math>. From this, we can see that </math>n<math> must be divisible by 9, 5, and 11. This means </math>n<math> must be divisible by 495. The only multiples of 495 that are small enough to be AIME answers are 495 and 990. From the second of the three expressions above, we can see that </math>n<math> cannot be divisible by 10, so </math>n<math> must equal </math>\boxed{495}$. Solution by Zeroman. |
== See also == | == See also == | ||
{{AIME box|year=1993|num-b=5|num-a=7}} | {{AIME box|year=1993|num-b=5|num-a=7}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 13:42, 17 February 2020
Contents
Problem
What is the smallest positive integer that 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 \boxed{495}$.
=== Solution 2 ===
Let the desired integer be$ (Error compiling LaTeX. )na, \ b, \ cn = 9a + 36 = 10b + 45 = 11c + 55n \equiv 0 \pmod{9}$$ (Error compiling LaTeX. )n \equiv 5 \pmod{10}$$ (Error compiling LaTeX. )n \equiv 0 \pmod{11}\boxed{495}$=== Solution 3 ===
Let$ (Error compiling LaTeX. )n$be the desired integer. From the given information, we have <cmath> \begin{align*}9x &= a \\ 11y &= a \\ 10z + 5 &= a, \end{align*}</cmath> here,$ (Error compiling LaTeX. )x,yza911,\text{lcm}[9,11]=99.a=99m,m.10z + 5 = 99m.99(5) = \boxed{495}$is the smallest integer that can be represented in such a way.
=== Solution 4 === By the method in Solution 1, we find that the number$ (Error compiling LaTeX. )n9a+36=10b+45=11c+55a,b,cnnnn\boxed{495}$. Solution by Zeroman.
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.