Use the algorithm from this section to find the inverses of [ 1 0 0 1 1 0 1 1 1 ] and [ 1 0 0 0 1 1 0 0 1 1 1 0 1 1 1 1 ] . Let A be the corresponding n × n matrix, and let B be its inverse. Guess the form of B , and then prove that AB = I and BA = I .
Use the algorithm from this section to find the inverses of [ 1 0 0 1 1 0 1 1 1 ] and [ 1 0 0 0 1 1 0 0 1 1 1 0 1 1 1 1 ] . Let A be the corresponding n × n matrix, and let B be its inverse. Guess the form of B , and then prove that AB = I and BA = I .
Given f(x)= -x +2x$ -3x + x? -4x + 5. Use Horner's algorithm to compute
a. f(-2)
b. f(x)/(x+2)
C. How many multiplications was involved at part (a)
(a) Use the Euclidean algorithm to find gcd(131,326).
(b) Use the above to find a solution to 131x+326y=gcd(131,326)
(c) Does 131 have an inverse modulo 326? If so, find a value in {0,1,2,3,…,325} that is an inverse. If not, explain why not?
. Factor x12 -1 as a product of irreducible polynomials over Z.
Chapter 2 Solutions
Thomas' Calculus and Linear Algebra and Its Applications Package for the Georgia Institute of Technology, 1/e
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, algebra and related others by exploring similar questions and additional content below.