Answer Happy

Problem 3.2. Let (in the matrix, we have ai,i = has size nxn). a) Prove that Dn = = 2Dn-1 Dn-2. b) Compute Dn for any n (Hint: use a) and induction). 2 1 0 1 2 1 0 0 1 2 0 # 0 0 0 1 2 = = 1, ai,i-1 = 1, and all other entries are equal to 0; the matrix Dn := det 2, ai,i+1 0 0 1