Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
2 Homework Solutions
Fall 2009
Pat Rossi
Name
11104 = 11(6)(16)+8 = 11(6)(16) 118 = (1116 ) 118 (1)6 (1) (mod 17) 1 (mod 17)
i.e., 11104 = 1 (mod 17) 11104 + 1 = 0 (mod 17)
Hence, 17 divides 11104 + 1.Proof.
2. ~
(a) If gcd (a, 35) = 1, show that a12 1 (mod 35)
Proof. Let the hypothesis be given (i.e., suppose that gcd (a, 35) = 1.)
Since 35 = 5 7, it follows that 5 - a nor does 7 - a.
(If 5|a, then gcd (a, 35) 5 and if 7|a, then gcd (a, 35) 7, contrary to our
hypothesis.)
Hence, by Fermats Theorem, we have: a5 a (mod 5) and a7 a (mod 7) , or
equivalently, a4 1 (mod 5) and a6 a (mod 7) .
3
divis by 2
(c) If gcd (a, 133) = gcd (b, 133) = 1, show that 133| (a18 b18 ) .
Proof. Observe: 133 = 7 19
Since gcd (a, 133) = gcd (b, 133) = 1, this implies that 7 - a; 7 - b; 19 - a; and
19 - b.
By Fermats Theorem, we have: a6 1 (mod 7) and b6 1 (mod 7) .
Also: a18 1 (mod 19) and b18 1 (mod 19) .
Since a6 1 (mod 7) and b6 1 (mod 7) , it follows that:
3
3. From Fermats Theorem, deduce that for any integer n 0, 13| (1112n+6 + 1) .
Proof. Since 13 - 11, Fermats Theorem tells us that 1112 1 (mod 13) .
n
6. ~
(a) Find the units digit of 3100 by the use of Fermats Theorem.
First, lets recognize that the units digit of 3100 is the same as 3100 (mod 10) .
Next, note that since neither 2 nor 5 divide 3, that by Fermats Theorem:
3 1 (mod 2) , and hence, 3100 1100 (mod 2) 1 (mod 2) .
i.e., 3100 1 (mod 2) .
Hence, 2| (3100 1) .
50
10
11