Difference between revisions of "2013 AIME I Problems/Problem 15"
(→Note:) |
Boxtheanswer (talk | contribs) (fixed problem) |
||
(One intermediate revision by the same user not shown) | |||
Line 29: | Line 29: | ||
The difference between <math>(4)</math> and <math>(5)</math> is <math>x+1</math>, which should be divisible by 3. So <math>x \equiv 2 \mod 3</math>. Also note that since <math>3|(5)</math>, <math>3|B</math>. Now we can try different values of <math>x</math> and <math>B</math>: | The difference between <math>(4)</math> and <math>(5)</math> is <math>x+1</math>, which should be divisible by 3. So <math>x \equiv 2 \mod 3</math>. Also note that since <math>3|(5)</math>, <math>3|B</math>. Now we can try different values of <math>x</math> and <math>B</math>: | ||
− | When <math>x=2</math>, <math>B=3, 6, ..., 96 \Rightarrow | + | When <math>x=2</math>, <math>B=3, 6, ..., 96 \Rightarrow 32</math> triples. |
− | When <math>x=5</math>, <math>B=6, 9, ..., 93\Rightarrow | + | When <math>x=5</math>, <math>B=6, 9, ..., 93\Rightarrow 30</math> triples.. |
... and so on until | ... and so on until | ||
− | When <math>x= | + | When <math>x=47</math>, <math>B=48, 51\Rightarrow 2</math> triple. |
− | So the answer is <math> | + | So the answer is <math>32 + 30 + \cdots + 2 = \boxed{272}</math> |
~SoilMilk | ~SoilMilk | ||
− | |||
− | |||
− | |||
− | |||
− | |||
== See also == | == See also == | ||
{{AIME box|year=2013|n=I|num-b=14|after=Last Problem}} | {{AIME box|year=2013|n=I|num-b=14|after=Last Problem}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 17:57, 20 January 2025
Contents
Problem
Let be the number of ordered triples of integers satisfying the conditions (a) , (b) there exist integers , , and , and prime where , (c) divides , , and , and (d) each ordered triple and each ordered triple form arithmetic sequences. Find .
Solution
From condition (d), we have and . Condition states that , , and . We subtract the first two to get , and we do the same for the last two to get . We subtract these two to get . So or . The second case is clearly impossible, because that would make , violating condition . So we have , meaning . Condition implies that or . Now we return to condition , which now implies that . Now, we set for increasing positive integer values of . yields no solutions. gives , giving us solution. If , we get solutions, and . Proceeding in the manner, we see that if , we get 16 solutions. However, still gives solutions because . Likewise, gives solutions. This continues until gives one solution. gives no solution. Thus, .
Solution 2
Let = and . Now the 3 differences would be
Adding equations and would give . Then doubling equation would give . The difference between them would be . Since , then . Since is prime, or . However, since , we must have , which means .
If , the only possible values of are . Plugging this into our differences, we get
The difference between and is , which should be divisible by 3. So . Also note that since , . Now we can try different values of and :
When , triples.
When , triples..
... and so on until
When , triple.
So the answer is
~SoilMilk
See also
2013 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last Problem | |
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.