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 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let a 1 = x , a 2 = y , a 3 = z . First note that if any absolute value equals 0, then a n = 0 . Also note that if at any position, a n = a n − 1 , then a n + 2 = 0 . Then, if any absolute value equals 1, then a n = 0 . Therefore, if either ∣ y − x ∣ or ∣ z − y ∣ 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 ∣ y − x ∣ > 1 , and ∣ z − y ∣ > 1 . Then, a 4 ≥ 2 z , a 5 ≥ 4 z , and a 6 ≥ 4 z . However, since the minimum values of a 5 and a 6 are equal, there must be a scenario where the criteria was met that does not meet our earlier scenarios. Calculation shows that to be z = 1 , ∣ y − x ∣ = 2 . Again assume that any other scenario will not meet criteria. To prove, divide the other scenarios into two cases: z > 1 , ∣ y − x ∣ > 1 , and ∣ z − y ∣ > 1 ; and z = 1 , ∣ y − x ∣ > 2 , and ∣ z − y ∣ > 1 . For the first one, a 4 ≥ 2 z , a 5 ≥ 4 z , a 6 ≥ 8 z , and a 7 ≥ 1 6 z , by which point we see that this function diverges. For the second one, a 4 ≥ 3 , a 5 ≥ 6 , a 6 ≥ 1 8 , and a 7 ≥ 5 4 , by which point we see that this function diverges. Therefore, the only scenarios where a n = 0 is when any of the following are met: ∣ y − x ∣ < 2 (280 options) ∣ z − y ∣ < 2 (280 options, 80 of which coincide with option 1) z = 1 , ∣ y − x ∣ = 2 . (16 options, 2 of which coincide with either option 1 or option 2) Adding the total number of such ordered triples yields 2 8 0 + 2 8 0 − 8 0 + 1 6 − 2 = 4 9 4 .