×
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-3: Solving Quadratic Equations by Completing the Square

Algebra 1, Student Edition (MERRILL ALGEBRA 1) | 1st Edition | ISBN: 9780078738227 | Authors: Berchie Holliday, Gilbert J. Cuevas, Beatrice Luchin, Ruth M. Casey, Linda M. Hayek, John A. Carter, Daniel Marks, Roger Day, & 2 more

Full solutions for Algebra 1, Student Edition (MERRILL ALGEBRA 1) | 1st Edition

ISBN: 9780078738227

Algebra 1, Student Edition (MERRILL ALGEBRA 1) | 1st Edition | ISBN: 9780078738227 | Authors: Berchie Holliday, Gilbert J. Cuevas, Beatrice Luchin, Ruth M. Casey, Linda M. Hayek, John A. Carter, Daniel Marks, Roger Day, & 2 more

Solutions for Chapter 9-3: Solving Quadratic Equations by Completing the Square

Solutions for Chapter 9-3
4 5 0 338 Reviews
25
2
Textbook: Algebra 1, Student Edition (MERRILL ALGEBRA 1)
Edition: 1
Author: Berchie Holliday, Gilbert J. Cuevas, Beatrice Luchin, Ruth M. Casey, Linda M. Hayek, John A. Carter, Daniel Marks, Roger Day, & 2 more
ISBN: 9780078738227

This expansive textbook survival guide covers the following chapters and their solutions. Since 65 problems in chapter 9-3: Solving Quadratic Equations by Completing the Square have been answered, more than 37057 students have viewed full step-by-step solutions from this chapter. Algebra 1, Student Edition (MERRILL ALGEBRA 1) was written by and is associated to the ISBN: 9780078738227. This textbook survival guide was created for the textbook: Algebra 1, Student Edition (MERRILL ALGEBRA 1) , edition: 1. Chapter 9-3: Solving Quadratic Equations by Completing the Square includes 65 full step-by-step solutions.

Key Math Terms and definitions covered in this textbook
  • Adjacency matrix of a graph.

    Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected). Adjacency matrix of a graph. Square matrix with aij = 1 when there is an edge from node i to node j; otherwise aij = O. A = AT when edges go both ways (undirected).

  • Block matrix.

    A matrix can be partitioned into matrix blocks, by cuts between rows and/or between columns. Block multiplication ofAB is allowed if the block shapes permit.

  • Cayley-Hamilton Theorem.

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

  • Cholesky factorization

    A = CTC = (L.J]))(L.J]))T for positive definite 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).

  • Complete solution x = x p + Xn to Ax = b.

    (Particular x p) + (x n in nullspace).

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

  • Hessenberg matrix H.

    Triangular matrix with one extra nonzero adjacent diagonal.

  • Identity matrix I (or In).

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

  • Least squares solution X.

    The vector x that minimizes the error lie 112 solves AT Ax = ATb. Then e = b - Ax is orthogonal to all columns of A.

  • Partial pivoting.

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

  • Particular solution x p.

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

  • Pascal matrix

    Ps = pascal(n) = the symmetric matrix with binomial entries (i1~;2). Ps = PL Pu all contain Pascal's triangle with det = 1 (see Pascal in the index).

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

  • Random matrix rand(n) or randn(n).

    MATLAB creates a matrix with random entries, uniformly distributed on [0 1] for rand and standard normal distribution for randn.

  • Skew-symmetric matrix K.

    The transpose is -K, since Kij = -Kji. Eigenvalues are pure imaginary, eigenvectors are orthogonal, eKt is an orthogonal matrix.

  • Subspace S of V.

    Any vector space inside V, including V and Z = {zero vector only}.

  • Trace of A

    = sum of diagonal entries = sum of eigenvalues of A. Tr AB = Tr BA.

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

    T- 1 has rank 1 above and below diagonal.

  • Wavelets Wjk(t).

    Stretch and shift the time axis to create Wjk(t) = woo(2j t - k).

×
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