Let N be a positive integer and let (kn)n≥1 be a sequence of positive integers with all terms at most N. Annabel begins by choosing integers x1,x2,…,xN. She then extends this to an infinite sequence (xn)n≥1 of integers by defining xn=i=n−kn∑n−1xi for each n>N. Show that there are either finitely many strictly positive terms or finitely many strictly negative terms in the infinite sequence (xn).
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.