Let S be the set of all ordered triple of integers (A1,A2,A3) with 1<=A1,A2,A3<=10. Each ordered triple in S generates a sequence according to the rule An = An-1 * |An-2 - An-3| for all n=>4. Find the number of such sequences for which An = 0 for some n.
(Note: An is A sub n)
Hint: Under what conditions does An = 0? Lots of casework ahead.
Level: 8
No comments:
Post a Comment