# CMPSCI 250: Introduction to Computation

### David Mix Barrington

### Fall, 2004

# Homework Assignment #3

#### Posted Tuesday 5 October 2004

#### Due on paper in class, Wednesday 13 October 2004

There are thirteen ordinary questions for 100 total points plus one
extra credit question for 10 points. All are from
the textbook, *A
Mathematical Foundation for Computer Science* - Chapter 3 is in the blue
volume and Chapter 4 in the green volume. "Problem 1.1.2", for
example, refers to Problem #2 in Section 1.1, and similarly. Make sure
you don't do an Exercise when a Problem is assigned!

Students are responsible for understanding and following
the academic honesty
policies indicated on this page.

- Page 2-37: Problem 2.9.3 (10)
- Page 2-43: Problem 2.10.4 (10)
- Page 2-49: Problem 2.11.2 (10)
- Page 3-7: Problem 3.1.1 (5) (Note: I'm not looking for a computer search
or a reference to a table of primes, because I'm not looking for the
*first* such sequence. I'm looking for 100 numbers in a row that it's
easy to *prove* to be all composite.)
- Page 3-16 and 3-17: Problems 3.3.1 (5) and 3.3.4 (10 extra credit)
- Page 3-20: Problem 3.4.2 (5) (Hint: This is very similar to 3.4.1, which
was part of Discussion #4 and thus has a solution
posted, or will have after 6 October.)
- Pages 3-26 and 3-27: Problems 3.5.2 (10) and 3.5.5 (10)
- Pages 3-31 and 3-32: Problems 3.6.2 (5) and 3.6.4 (5)
- Page 4-8: Problems 4.1.3 (5) and 4.1.5 (10). (Note: There is a typo in
4.1.5 -- the quotes that begin on the second line should end after the right
paren on the third line.)
- Page 4-17: Problem 4.3.2 (10)

Last modified 5 October 2004