CS 1050 Section B, Spring 2001

Homework 3 { due Thursday,February 8

Part I

Problem 1

Exercise 16, page 184.

Problem 2

Exercise 24, page 184.

Problem 3

Exercise 44 page 185.

Problem 4

Exercise 62, page 185.

Part II

Problem 5

Exercise 34, page 126.

Problem 6

Exercise 38, page 126.

Problem 7

Prove or disprove: For every positiveintegers

k; m

, and

n

, gcd(

km; kn

)=

k

gcd(

m; n

).

Problem 8

Exercise 8, page 149.