Difference between revisions of "2015 AIME I Problems/Problem 9"
m (→Solution: Boxed answer.) |
m |
||
(15 intermediate revisions by 7 users not shown) | |||
Line 2: | Line 2: | ||
Let <math>S</math> be the set of all ordered triple of integers <math>(a_1,a_2,a_3)</math> with <math>1 \le a_1,a_2,a_3 \le 10</math>. Each ordered triple in <math>S</math> generates a sequence according to the rule <math>a_n=a_{n-1}\cdot | a_{n-2}-a_{n-3} |</math> for all <math>n\ge 4</math>. Find the number of such sequences for which <math>a_n=0</math> for some <math>n</math>. | Let <math>S</math> be the set of all ordered triple of integers <math>(a_1,a_2,a_3)</math> with <math>1 \le a_1,a_2,a_3 \le 10</math>. Each ordered triple in <math>S</math> generates a sequence according to the rule <math>a_n=a_{n-1}\cdot | a_{n-2}-a_{n-3} |</math> for all <math>n\ge 4</math>. Find the number of such sequences for which <math>a_n=0</math> for some <math>n</math>. | ||
− | ==Solution== | + | ==Solution 1== |
Let <math>a_1=x, a_2=y, a_3=z</math>. First note that if any absolute value equals 0, then <math>a_n=0</math>. | Let <math>a_1=x, a_2=y, a_3=z</math>. First note that if any absolute value equals 0, then <math>a_n=0</math>. | ||
Also note that if at any position, <math>a_n=a_{n-1}</math>, then <math>a_{n+2}=0</math>. | Also note that if at any position, <math>a_n=a_{n-1}</math>, then <math>a_{n+2}=0</math>. | ||
Line 13: | Line 13: | ||
For the first one, <math>a_4 \ge 2z</math>, <math>a_5 \ge 4z</math>, <math>a_6 \ge 8z</math>, and <math>a_7 \ge 16z</math>, by which point we see that this function diverges. | For the first one, <math>a_4 \ge 2z</math>, <math>a_5 \ge 4z</math>, <math>a_6 \ge 8z</math>, and <math>a_7 \ge 16z</math>, by which point we see that this function diverges. | ||
For the second one, <math>a_4 \ge 3</math>, <math>a_5 \ge 6</math>, <math>a_6 \ge 18</math>, and <math>a_7 \ge 54</math>, by which point we see that this function diverges. | For the second one, <math>a_4 \ge 3</math>, <math>a_5 \ge 6</math>, <math>a_6 \ge 18</math>, and <math>a_7 \ge 54</math>, by which point we see that this function diverges. | ||
+ | |||
+ | |||
Therefore, the only scenarios where <math>a_n=0</math> is when any of the following are met: | Therefore, the only scenarios where <math>a_n=0</math> is when any of the following are met: | ||
<math>|y-x|<2</math> (280 options) | <math>|y-x|<2</math> (280 options) | ||
Line 18: | Line 20: | ||
<math>z=1</math>, <math>|y-x|=2</math>. (16 options, 2 of which coincide with either option 1 or option 2) | <math>z=1</math>, <math>|y-x|=2</math>. (16 options, 2 of which coincide with either option 1 or option 2) | ||
Adding the total number of such ordered triples yields <math>280+280-80+16-2=\boxed{494}</math>. | Adding the total number of such ordered triples yields <math>280+280-80+16-2=\boxed{494}</math>. | ||
+ | |||
+ | *Note to author: | ||
+ | |||
+ | Because <math>a_4 \ge 2z</math>, <math>a_5 \ge 4z</math>, <math>a_6 \ge 8z</math>, and <math>a_7 \ge 16z</math> doesn't mean the function diverges. What if <math>z = 7</math>, <math>a_4 = 60</math>, and <math>a_5 = 30</math> too? | ||
+ | |||
+ | *Note to the Note to author: | ||
+ | |||
+ | This isn't possible because the difference between is either 0, 1, or some number greater than 1. If <math>a_4 = 63</math> (since it must be a multiple of <math>z</math>), then a_5 is either 0, 63, or some number greater than 63. | ||
+ | |||
+ | ==Solution 2== | ||
+ | Note that the only way for a <math>0</math> to be produced at <math>a_n</math> is if either <math>a_{n-1} = 0</math> or <math>a_{n-2} = a_{n-3}</math>. Since the first one will eventually get to the first three assuming that there is no <math>a_{n-2} = a_{n-3}</math> for any <math>n</math>, that is not possible because <math>a_1 , a_2 , a_3 >= 1</math>. Therefore, we need <math>a_{n - 2} = a_{n - 3}</math>. | ||
+ | |||
+ | If <math>2</math> consecutive numbers out of <math>a_1 , a_2 , a_3</math> are equal, then those cases work(<math>a_1</math> and <math>a_2</math> or <math>a_2</math> and <math>a_3</math> <math>\textbf{NOT}</math> <math>a_1</math> and <math>a_3</math>). This is simply <math>10 \cdot 10 + 10 \cdot 10 - 10 = 190</math> by PIE. | ||
+ | |||
+ | Now, note that if any of the first three numbers have difference of <math>1</math>, we have another working case. First, we calculate how many there are given exactly one of <math>a_1,a_2</math> or <math>a_2,a_3</math> have difference <math>1</math>. Given <math>3</math> numbers such that the first <math>2</math> have difference <math>1</math>, exactly <math>4</math> permutations work(assuming the numbers are <math>x,y,</math> and <math>z</math> such that <math>|x-y| = 1</math>): <math>x,y,z</math>; <math>y,x,z</math>; <math>z,x,y</math>; and <math>z,y,x</math>. If the two consecutive numbers are <math>1</math> and <math>2</math>, then the last number has <math>7</math> possiblities: <math>4,5,6,\cdots , 10</math>. This is symmetric for <math>9</math> and <math>10</math>. If the consecutive numbers are <math>(2,3),\cdots , (8,9)</math>, there are <math>6</math> possibilities(<math>10</math> minus the numbers themselves and the numbers directly above and below). Note that we are not counting any cases already counted in the first case. Therefore, this case gives you <math>4(7 + 6 * 7 + 7) = 224</math>. Now we consider the case that there both adjacent <math>a</math>s have increments of <math>1</math>. <cmath>+1 , +1 \rightarrow 8</cmath> <cmath>-1 , -1 \rightarrow 8</cmath> <cmath>+1 , -1 \rightarrow 9</cmath> <cmath>-1 , +1 \rightarrow 9</cmath> Therefore this gives <math>224 + 8 + 8 + 9 + 9 = 258</math>. However, note that we have to add the case where you have <math>3</math> consecutive numbers in arrangement such that only <math>2</math> consecutive numbers have difference <math>1</math>. For example, <math>1,3,2</math> is one such triple. There are <math>8</math> triples of consecutive numbers and <math>4</math> ways to arrange each one(e.x: <math>(1,3,2);(3,1,2);(2,1,3);(2,3,1)</math>). This adds on 32 working cases, so this case gives <math>258 + 32 = 290</math>. | ||
+ | |||
+ | Note that there is an ultraspecial(Yes, I know that's not a word) case where we generate a pair of <math>a_i</math> that have difference one. This can only happen if <math>a_3 = 1</math> and <math>a_1</math> and <math>a_2</math> have difference <math>2</math>. This contributes <math>14</math> cases(<math>2 * 8</math> and then subtract <math>2</math> because of the cases <math>3,1,1</math> and <math>4,2,1</math>). | ||
+ | |||
+ | Therefore, our answer is <math>190 + 290 + 14 = \boxed{494}</math>. | ||
+ | Solution by hyxue | ||
+ | |||
+ | |||
+ | ==Video Solution== | ||
+ | https://youtu.be/nxieVbkk0jY | ||
+ | |||
+ | ~MathProblemSolvingSkills.com | ||
+ | |||
==See Also== | ==See Also== |
Latest revision as of 19:35, 28 July 2023
Problem
Let be the set of all ordered triple of integers with . Each ordered triple in generates a sequence according to the rule for all . Find the number of such sequences for which for some .
Solution 1
Let . First note that if any absolute value equals 0, then . Also note that if at any position, , then . Then, if any absolute value equals 1, then . Therefore, if either or is less than or equal to 1, then that ordered triple meets the criteria. Assume that to be the only way the criteria is met. To prove, let , and . Then, , , and . However, since the minimum values of and are equal, there must be a scenario where the criteria was met that does not meet our earlier scenarios. Calculation shows that to be , . Again assume that any other scenario will not meet criteria. To prove, divide the other scenarios into two cases: , , and ; and , , and . For the first one, , , , and , by which point we see that this function diverges. For the second one, , , , and , by which point we see that this function diverges.
Therefore, the only scenarios where is when any of the following are met:
(280 options)
(280 options, 80 of which coincide with option 1)
, . (16 options, 2 of which coincide with either option 1 or option 2)
Adding the total number of such ordered triples yields .
- Note to author:
Because , , , and doesn't mean the function diverges. What if , , and too?
- Note to the Note to author:
This isn't possible because the difference between is either 0, 1, or some number greater than 1. If (since it must be a multiple of ), then a_5 is either 0, 63, or some number greater than 63.
Solution 2
Note that the only way for a to be produced at is if either or . Since the first one will eventually get to the first three assuming that there is no for any , that is not possible because . Therefore, we need .
If consecutive numbers out of are equal, then those cases work( and or and and ). This is simply by PIE.
Now, note that if any of the first three numbers have difference of , we have another working case. First, we calculate how many there are given exactly one of or have difference . Given numbers such that the first have difference , exactly permutations work(assuming the numbers are and such that ): ; ; ; and . If the two consecutive numbers are and , then the last number has possiblities: . This is symmetric for and . If the consecutive numbers are , there are possibilities( minus the numbers themselves and the numbers directly above and below). Note that we are not counting any cases already counted in the first case. Therefore, this case gives you . Now we consider the case that there both adjacent s have increments of . Therefore this gives . However, note that we have to add the case where you have consecutive numbers in arrangement such that only consecutive numbers have difference . For example, is one such triple. There are triples of consecutive numbers and ways to arrange each one(e.x: ). This adds on 32 working cases, so this case gives .
Note that there is an ultraspecial(Yes, I know that's not a word) case where we generate a pair of that have difference one. This can only happen if and and have difference . This contributes cases( and then subtract because of the cases and ).
Therefore, our answer is . Solution by hyxue
Video Solution
~MathProblemSolvingSkills.com
See Also
2015 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
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.