×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide

Already have an account? Login here
×
Reset your password

Solutions for Chapter 13: Sequences, Induction; and Binomial Theorem

Algebra and Trigonometry | 8th Edition | ISBN: 9780132329033 | Authors: Michael Sullivan

Full solutions for Algebra and Trigonometry | 8th Edition

ISBN: 9780132329033

Algebra and Trigonometry | 8th Edition | ISBN: 9780132329033 | Authors: Michael Sullivan

Solutions for Chapter 13: Sequences, Induction; and Binomial Theorem

Solutions for Chapter 13
4 5 0 316 Reviews
23
3
Textbook: Algebra and Trigonometry
Edition: 8
Author: Michael Sullivan
ISBN: 9780132329033

Since 420 problems in chapter 13: Sequences, Induction; and Binomial Theorem have been answered, more than 87320 students have viewed full step-by-step solutions from this chapter. This expansive textbook survival guide covers the following chapters and their solutions. Algebra and Trigonometry was written by and is associated to the ISBN: 9780132329033. This textbook survival guide was created for the textbook: Algebra and Trigonometry, edition: 8. Chapter 13: Sequences, Induction; and Binomial Theorem includes 420 full step-by-step solutions.

Key Math Terms and definitions covered in this textbook
  • Affine transformation

    Tv = Av + Vo = linear transformation plus shift.

  • Cayley-Hamilton Theorem.

    peA) = det(A - AI) has peA) = zero matrix.

  • Cholesky factorization

    A = CTC = (L.J]))(L.J]))T for positive definite A.

  • Column picture of Ax = b.

    The vector b becomes a combination of the columns of A. The system is solvable only when b is in the column space C (A).

  • Cross product u xv in R3:

    Vector perpendicular to u and v, length Ilullllvlll sin el = area of parallelogram, u x v = "determinant" of [i j k; UI U2 U3; VI V2 V3].

  • Fourier matrix F.

    Entries Fjk = e21Cijk/n give orthogonal columns FT F = nI. Then y = Fe is the (inverse) Discrete Fourier Transform Y j = L cke21Cijk/n.

  • Hankel matrix H.

    Constant along each antidiagonal; hij depends on i + j.

  • Hilbert matrix hilb(n).

    Entries HU = 1/(i + j -1) = Jd X i- 1 xj-1dx. Positive definite but extremely small Amin and large condition number: H is ill-conditioned.

  • Identity matrix I (or In).

    Diagonal entries = 1, off-diagonal entries = 0.

  • Independent vectors VI, .. " vk.

    No combination cl VI + ... + qVk = zero vector unless all ci = O. If the v's are the columns of A, the only solution to Ax = 0 is x = o.

  • Left inverse A+.

    If A has full column rank n, then A+ = (AT A)-I AT has A+ A = In.

  • Left nullspace N (AT).

    Nullspace of AT = "left nullspace" of A because y T A = OT.

  • Linearly dependent VI, ... , Vn.

    A combination other than all Ci = 0 gives L Ci Vi = O.

  • Network.

    A directed graph that has constants Cl, ... , Cm associated with the edges.

  • Orthonormal vectors q 1 , ... , q n·

    Dot products are q T q j = 0 if i =1= j and q T q i = 1. The matrix Q with these orthonormal columns has Q T Q = I. If m = n then Q T = Q -1 and q 1 ' ... , q n is an orthonormal basis for Rn : every v = L (v T q j )q j •

  • Rotation matrix

    R = [~ CS ] rotates the plane by () and R- 1 = RT rotates back by -(). Eigenvalues are eiO and e-iO , eigenvectors are (1, ±i). c, s = cos (), sin ().

  • Row space C (AT) = all combinations of rows of A.

    Column vectors by convention.

  • Schur complement S, D - C A -} B.

    Appears in block elimination on [~ g ].

  • Symmetric factorizations A = LDLT and A = QAQT.

    Signs in A = signs in D.

  • Tridiagonal matrix T: tij = 0 if Ii - j I > 1.

    T- 1 has rank 1 above and below diagonal.