Here are the homework assignments I have addounced in class. The statement of record which actually defines the assigment is whatever I announce in class, so be sure to attend every day or get an update from someone present if you have to be away. 1. Due Friday, September 5 (at the start of class): section 1.1: 1b, 4b, 5b, 6, 8b, 17, 22 section 1.2: 1b, 2, 3, 4, 7, 10, 14, 23 2. Due Friday, Sept 12 section 1.4: 1k, 1l, 6, 14 section 1.5: 1b, 1c, 2a, 4a-b-d-e-i-j, 5, 7, 9, 10, 12, 17 section 2.1: 1a, 1b. 3. Due Friday, Sept 19 section 2.1: 1c, 1e, 2, 4, 6, 10 section 2.2: 2d, 4a, 12 I would also like you to go back to section 1.4 and try 13a,b,c now that you're getting a little better with proofs :-) 4. Due Friday, Sept 26 section 2.3: 2, 7, 8(1,b,c), 18, 21 section 2.4: 1, 3(a,b), 4(a,b), 6, 11, 12 5. Due Friday, Oct 3 section 5.1: 1(a,b,c,g), 7, 8 section 3.1 14, 15, 16, 17 PLEASE NOTE; EXAM 1 will be Monday, Oct 6 6. Due Wednesday, Oct 15 section 3.2 2a, 2d, 2f, 4, 7 section 3.3 9, 14, 16 section 3.4 1a, 2b, 3g, 5a, 5b 7. Due Monday, Oct 27 section 3.3: 8, 13 section 3.4: 11, 15, 19 section 4.1: 3, 4, 7, 8 Special exercise. Let the sequence a_n be defined recursively by a_1=a_2=1, and a_n=a_{n-1}+2a_{n-2}. Compute the first 10 entries in the sequence by hand. Then, give a closed form expression for a_n; that is, write a formula for a_n which doesn't reference prior a_i's. This will parallel the Fibonacci sequence example from class. Make sure to check that your formula works on the first ten entires! PLEASE NOTE: EXAM 2 will be Monday, Nov 3. I will try to get this HW back before then. 8. Due Wednesday, Nov 12 section 4.2: 7 section 4.3: 7,8,9,22 section 4.4: 3,4,7 9. Due Wednesday, Nov 19 section 4.4: 13, 15, 28 section 4.5: 2,3,9,12 10. Due Monday, Dec 1 section 4.5: 7, 13, 17 section 4.7: 3, 4d, 6, 8, 10 Please read ahead over Thanksgiving and start these when you can: 11. Due Friday, Dec 5 section 5.1: 14, 19 section 5.2: 3b, 13