The Fibonacci sequence F1, F2, . . . is defined by F1 = 1, F2 = 1, and Fn = Fn−2 + Fn−1 (n ≥ 3). Define T ∈ L(R2) by T(x, y) = (y, x + y). (a) Show that T n(0, 1) = (Fn, Fn+1) for each n. (Use induction.) (b) Find the eigenvalues of T. 1 2 MATH 436 HOMEWORK 9 DUE FRIDAY APRIL 3 (c) Find a basis of R2 consisting of eigenvectors of T, so that the matrix of T with respect to that basis is diagonal. (d) Use your answer to (c) to compute T n(0, 1) in a different way, and conclude that Fn = 1 √5 1 + √5 2 !n − 1 − √5 2 !n! .

the correct answer option is (2x-3)(2x+3).

step-by-step explanation:

we are given the following expression and we are to factorize it:

we are to find such factors that when multiplied they give a result of 36 (9 x 4 = 36) and when added they give a result of 0.

the two such factors of 36 are negative six and postive six.

factorizing the given expression to get:

therefore, the correct factorization of is (2x-3)(2x+3).

step-by-step explanation:

and 90% of people marry there 7th grade love. since u have read this, u will be told good news 2night. if u don't pass this on nine comments ur worst week starts now this isn't fake. apparently if u copy and paste this on ten comments in the next ten minutes you will have the best day of ur life tomorrow. you will either get kissed or asked out in the next 53 minutes someone will say i love u

read more on -