Question

6. (Strang 4th ed. §4.3 #5) Let Fn be the determinant of the 1, 1, -1 tridiagonal matrix (n-by-n): Fn = [ 1 -1 0 0 ... 0 0 ] [ 1 1 -1 0 ... 0 0 ] [ 0 1 1 -1 ... 0 0 ] [ : : : : ] [ 0 0 0 0 ... 1 -1 ] [ 0 0 0 0 ... 1 1 ] (a) Compute F1 and F2. (b) By expanding in cofactors along row 1 (the recursive method in Khan Academy videos), show that Fn = Fn-1 + Fn-2. This yields the Fibonacci sequence 1, 2, 3, 5, 8, 13, ... for the determinants.

          6. (Strang 4th ed. §4.3 #5) Let Fn be the determinant of the 1, 1, -1 tridiagonal matrix (n-by-n):

Fn = 
[ 1 -1  0  0 ...  0  0 ]
[ 1  1 -1  0 ...  0  0 ]
[ 0  1  1 -1 ...  0  0 ]
[ :     :     :     :  ]
[ 0  0  0  0 ...  1 -1 ]
[ 0  0  0  0 ...  1  1 ]

(a) Compute F1 and F2.
(b) By expanding in cofactors along row 1 (the recursive method in Khan Academy videos), show that Fn = Fn-1 + Fn-2.
This yields the Fibonacci sequence 1, 2, 3, 5, 8, 13, ... for the determinants.

6. (Strang 4th ed. §4.3 #5) Let Fn be the determinant of the 1, 1, -1 tridiagonal matrix (n-by-n):

Fn =
[ 1 -1 0 0 ... 0 0 ]
[ 1 1 -1 0 ... 0 0 ]
[ 0 1 1 -1 ... 0 0 ]
[ : : : : ]
[ 0 0 0 0 ... 1 -1 ]
[ 0 0 0 0 ... 1 1 ]

(a) Compute F1 and F2.
(b) By expanding in cofactors along row 1 (the recursive method in Khan Academy videos), show that Fn = Fn-1 + Fn-2.
This yields the Fibonacci sequence 1, 2, 3, 5, 8, 13, ... for the determinants.

Added by David G.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Madhur L

05/24/2022

Step 1

Therefore, F1 = 1. ** Show more…

Show all steps

Thanks for your feedback!

6. (Strang 4th ed. §4.3 #5) Let Fn be the determinant of the 1, 1, -1 tridiagonal matrix (n-by-n): (a) Compute F1 and F2. (b) By expanding in cofactors along row 1 (the recursive method in Khan Academy videos), show that Fn = Fn-1 + Fn-2. This yields the Fibonacci sequence 1, 2, 3, 5, 8, 13, ... for the determinants.