Problem Set #2

CSCI 3104 - Algorithms - Fall 2009

Problem Set #2

Due: 3pm, Sep 25th, 2009

1. Text problem 1.12.

2. Text problem 1.13.

3. Text problem 1.18.

4. Text problem 1.20.

5. What is the smallest 59-pseudoprime?

6. Text problem 1.27.

7. Text problem 1.42.

8. (Extra Credit) Don't do this one until you've worked on all others first! This is worth only a few points and is MUCH harder than the other problems. Define f(0)=1 and f(x) = 7^f(x-1). Find the last 10 decimal digits of f(10). You'll probably want to use Python; make sure you explain the technique you used!