×
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 9: EULER'S CRITERION

Full solutions for Elementary Number Theory | 7th Edition

ISBN: 9780073383149

Solutions for Chapter 9: EULER'S CRITERION

Solutions for Chapter 9
4 5 0 327 Reviews
25
2
Textbook: Elementary Number Theory
Edition: 7
Author: Professor David Burton
ISBN: 9780073383149

Since 20 problems in chapter 9: EULER'S CRITERION have been answered, more than 5975 students have viewed full step-by-step solutions from this chapter. This textbook survival guide was created for the textbook: Elementary Number Theory, edition: 7. This expansive textbook survival guide covers the following chapters and their solutions. Chapter 9: EULER'S CRITERION includes 20 full step-by-step solutions. Elementary Number Theory was written by and is associated to the ISBN: 9780073383149.

Key Math Terms and definitions covered in this textbook
  • Cofactor Cij.

    Remove row i and column j; multiply the determinant by (-I)i + j •

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

  • Exponential eAt = I + At + (At)2 12! + ...

    has derivative AeAt; eAt u(O) solves u' = Au.

  • Identity matrix I (or In).

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

  • Indefinite matrix.

    A symmetric matrix with eigenvalues of both signs (+ and - ).

  • Inverse matrix A-I.

    Square matrix with A-I A = I and AA-l = I. No inverse if det A = 0 and rank(A) < n and Ax = 0 for a nonzero vector x. The inverses of AB and AT are B-1 A-I and (A-I)T. Cofactor formula (A-l)ij = Cji! detA.

  • Iterative method.

    A sequence of steps intended to approach the desired solution.

  • Jordan form 1 = M- 1 AM.

    If A has s independent eigenvectors, its "generalized" eigenvector matrix M gives 1 = diag(lt, ... , 1s). The block his Akh +Nk where Nk has 1 's on diagonall. Each block has one eigenvalue Ak and one eigenvector.

  • Lucas numbers

    Ln = 2,J, 3, 4, ... satisfy Ln = L n- l +Ln- 2 = A1 +A~, with AI, A2 = (1 ± -/5)/2 from the Fibonacci matrix U~]' Compare Lo = 2 with Fo = O.

  • Network.

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

  • Normal matrix.

    If N NT = NT N, then N has orthonormal (complex) eigenvectors.

  • Partial pivoting.

    In each column, choose the largest available pivot to control roundoff; all multipliers have leij I < 1. See condition number.

  • Projection matrix P onto subspace S.

    Projection p = P b is the closest point to b in S, error e = b - Pb is perpendicularto S. p 2 = P = pT, eigenvalues are 1 or 0, eigenvectors are in S or S...L. If columns of A = basis for S then P = A (AT A) -1 AT.

  • Projection p = a(aTblaTa) onto the line through a.

    P = aaT laTa has rank l.

  • Simplex method for linear programming.

    The minimum cost vector x * is found by moving from comer to lower cost comer along the edges of the feasible set (where the constraints Ax = b and x > 0 are satisfied). Minimum cost at a comer!

  • Spectral Theorem A = QAQT.

    Real symmetric A has real A'S and orthonormal q's.

  • Standard basis for Rn.

    Columns of n by n identity matrix (written i ,j ,k in R3).

  • Symmetric matrix A.

    The transpose is AT = A, and aU = a ji. A-I is also symmetric.

  • 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