Math 4030 Homework



Homework 1:  From Section 1.1 of Textbook:
                        3, 7, 9, 10;
                        Write down a proof by induction that the puzzle called
                        "Towers of Hanoi" discussed in class can be solved in
                        2^n - 1 steps, where n is the number of disks.


Homework 2


Homework 3


Homework 4


Homework 5:  1.  Problems 4,5,6 of Homework 4, postponed one week.
                        2.  Problems 2,3,4 of section 1.3 of text (page 32).


Homework 6:  Problems 1,5,7,8 of section 1.4 of the text (pages 40 - 42).

Homework 7: Problems 7, 8 of Homework 6, postponed from last time.
For 8c use Eisenstein Graph Paper
Fill in all missing points and write down all distances from the origin.
You can bring the completed sheet to class on  Friday and hand  it  in  as one of the problems in  the quiz.

Homework 8:  Problems 2,3,4,6 of Chapter 2.1 of  the text (pages  51-52).

Homework 9:  Finish any problems left from Homework 8.  Then do 5-5 (p 52) and 6-4, 6-5 (p 60).

Homework 10

Homework 11:  Problem 2 of Homework 10 and 7.3 of the text (p 71).

Homework 12:  7-2 (c), 7-3 (e,f),  8-2, 8-3.

Homework 13: 8-4, 8-5 and 10-4 a,b,c.