Consider the sequence s(n) that satisfies the recursion
relation s(n +2) =
(7/51)*s(n+1) + (44/51)*s(n) with initial conditions s(1)=0 and s(2)=1.
Find integers a and b such that the limit as n approaches
infinity of the sequence s(n) is a/b, with a/b in lowest terms.
Deadline
Monday, November 30, 2009
Any undergraduate submitting a correct solution by the deadline receives a Problem of the Fortnight T-shirt. The most elegant mathematical solution and computer solution each also receive a book from the department's collection. Grad students are eligible to compete although they will be judged as part of a separate pool. The most elegant solution submitted by a graduate student also wins a T-shirt.
Place your solution in an envelope, include your name, RedID number, date, address, phone and email. Please also indicate whether you are a graduate or an undergraduate student. Submit your solution to the Math & CS Dept Office in GMCS 413.
Previous
Problems of the Fortnight