Discrete Structures

CS2800
1.

Homework 4
Number Theory

Rosen section 4.1: 35, 38

Rosen section 4.2: 24(a),(b)

2. Note that you derived the algorithms for these problems on your previous homework; these questions give
you more practice executing those algorithms.
Rosen section 4.3: 32(c), 41
Rosen section 4.4: 5(a),(b)
3. (a) List the units of Z9 and their inverses.
(b) What is (9)?
(c) Use Eulers theorem to compute 7242 mod 9.
4. Prove that poly : Zm Zm given by poly : [a] 7 [a2 + 3a + 1] is well defined.
5. Prove that multiplicative inverses are unique. You may use the fact that (for all x and y) xy = yx, and
1x = x.
6. Some authors use the following definition for addition of equivalence classes (we will write to distinguish
this definition from the definition of + given in lecture):
If x1 and x2 are sets of integers, then x1 x2 is defined as {a + b | a x1 and b x2 }.
Prove that for all x1 and x2 in Zm , x1 x2 = x1 + x2 (where + is defined as in lecture).