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

Solutions for Chapter Chapter 6: Probability

Full solutions for Mathematics: A Discrete Introduction | 3rd Edition

ISBN: 9780840049421

Solutions for Chapter Chapter 6: Probability

Solutions for Chapter Chapter 6
4 5 0 371 Reviews
Textbook: Mathematics: A Discrete Introduction
Edition: 3
Author: Edward A. Scheinerman
ISBN: 9780840049421

Chapter Chapter 6: Probability includes 16 full step-by-step solutions. This expansive textbook survival guide covers the following chapters and their solutions. Since 16 problems in chapter Chapter 6: Probability have been answered, more than 9176 students have viewed full step-by-step solutions from this chapter. This textbook survival guide was created for the textbook: Mathematics: A Discrete Introduction, edition: 3. Mathematics: A Discrete Introduction was written by and is associated to the ISBN: 9780840049421.

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

    Tv = Av + Vo = linear transformation plus shift.

  • Associative Law (AB)C = A(BC).

    Parentheses can be removed to leave ABC.

  • Characteristic equation det(A - AI) = O.

    The n roots are the eigenvalues of A.

  • Companion matrix.

    Put CI, ... ,Cn in row n and put n - 1 ones just above the main diagonal. Then det(A - AI) = ±(CI + c2A + C3A 2 + .•. + cnA n-l - An).

  • Condition number

    cond(A) = c(A) = IIAIlIIA-III = amaxlamin. In Ax = b, the relative change Ilox III Ilx II is less than cond(A) times the relative change Ilob III lib II· Condition numbers measure the sensitivity of the output to change in the input.

  • Covariance matrix:E.

    When random variables Xi have mean = average value = 0, their covariances "'£ ij are the averages of XiX j. With means Xi, the matrix :E = mean of (x - x) (x - x) T is positive (semi)definite; :E is diagonal if the Xi are independent.

  • Determinant IAI = det(A).

    Defined by det I = 1, sign reversal for row exchange, and linearity in each row. Then IAI = 0 when A is singular. Also IABI = IAIIBI and

  • Echelon matrix U.

    The first nonzero entry (the pivot) in each row comes in a later column than the pivot in the previous row. All zero rows come last.

  • Ellipse (or ellipsoid) x T Ax = 1.

    A must be positive definite; the axes of the ellipse are eigenvectors of A, with lengths 1/.JI. (For IIx II = 1 the vectors y = Ax lie on the ellipse IIA-1 yll2 = Y T(AAT)-1 Y = 1 displayed by eigshow; axis lengths ad

  • Gauss-Jordan method.

    Invert A by row operations on [A I] to reach [I A-I].

  • Hessenberg matrix H.

    Triangular matrix with one extra nonzero adjacent diagonal.

  • Particular solution x p.

    Any solution to Ax = b; often x p has free variables = o.

  • Permutation matrix P.

    There are n! orders of 1, ... , n. The n! P 's have the rows of I in those orders. P A puts the rows of A in the same order. P is even or odd (det P = 1 or -1) based on the number of row exchanges to reach I.

  • Plane (or hyperplane) in Rn.

    Vectors x with aT x = O. Plane is perpendicular to a =1= O.

  • Rank one matrix A = uvT f=. O.

    Column and row spaces = lines cu and cv.

  • Row picture of Ax = b.

    Each equation gives a plane in Rn; the planes intersect at x.

  • 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 ].

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

    T- 1 has rank 1 above and below diagonal.

  • Vector space V.

    Set of vectors such that all combinations cv + d w remain within V. Eight required rules are given in Section 3.1 for scalars c, d and vectors v, w.

Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide
Reset your password