| |
Due Date |
Exercises to Complete |
| HW #1 |
Feb 9 |
[1.1] 2, 6, 7, 13, 24, 25, 33, 34
[1.2] 1, 3, 10, 12, 19, 21, 26
[1.3] 5, 7, 10, 11, 21, 25, 32, 34
|
| HW #2 |
Feb 16 |
[1.4] 3, 4, 13, 15, 24, 29, 31, 35
[1.5] 3, 10, 12, 18, 23, 27, 36, 40
[1.7] 7, 12, 22, 28, 33, 38, 40
|
| HW #3 |
Feb 23 |
[1.8] 2, 4, 9, 17, 21, 25, 28, 32, 33, 34
[1.9] 1, 4, 9, 14, 19, 24, 31, 33, 35, 36, 37, 39
|
| HW #4 |
Mar 2 |
[2.1] 4, 5, 12, 13, 23, 24, 34
[2.2] 3, 7a, 9, 13, 16, 17, 18, 20, 31
|
| HW #5 |
Mar 9 |
[2.3] 4, 8, 11, 15, 20, 26, 28, 36
|
| HW #6 |
Mar 16 |
[3.1] 8, 20, 22, 37
[3.2] 19, 21, 27, 28, 31, 32, 34, 35
[3.3] 23, 25, 29, 31
[*] Suppose T and L are both
linear transformations from Rn to
Rn. Use the correspondence between linear
transformations and matrices, Theorem 4 (pg 194) and Theorem 6 (pg 196) to
prove
that T composed with L is invertible if and only if both
T and L are invertible.
|
| HW #7 |
Mar 23 |
[4.1] 3, 4, 11, 16, 21, 23, 28, 29, 33, 34
[4.2] 1, 6, 8, 10, 11, 25, 29, 31, 33, 34
|
| HW #8 |
Apr 6 |
[4.3] 1, 8, 11, 14, 20, 22, 24, 26, 34
[4.4] 1, 7, 9, 13, 23, 24, 26, 28
[4.5] 2, 3, 13, 19, 26, 27, 28, 31
|
| HW #9 |
Apr 13 |
[4.6] 3, 6, 7, 18, 28, 29, 30, 32
[4.7] 2, 6, 10, 13, 20a
[5.1] 1, 3, 6, 15, 22, 26, 29, 32 Note the change, 5.1 not 4.9
|
| HW #10 |
Apr 27 |
[5.2] 3, 6, 12, 17, 20, 21
[5.3] 1, 6, 7, 8, 11 (see page 325 for the eigenvalues), 27, 28, 31, 32
[Challenge Problem—Optional]
Use the method from Friday's worksheet to find a closed form
for the nth term of the Fibonacci sequence:
f0 = 0; f1=1;
fn+1 = fn+fn-1.
|
| HW #11 |
May 4 |
[5.4] 13 (the notation [T]B, means A-tilde that I talked about in class,
the matrix of the linear transformation T in the basis B), 19, 21, 22, 25
[6.1] 1, 3, 5, 7, 14, 20, 24, 29, 31
[6.2] 2, 5, 11, 13, 17, 22, 28
|
| HW #12 |
Will not be collected |
[6.3] 1, 6, 11, 21, 22, 23
[6.4] 2, 9
[6.7] 1, 3, 5, 13, 14, 15, 21, 23
|