11.

10
An ideal theoretic version of the Chinese Reminder theorem. Let I1 , I2 , I3 , , Ir be
ideals in Z no two of which are contained in a common maximal ideal. Then for any
integer b1 , b2 , b3 , , br there is an x Z such thatx bj Ij for all j.

11.14
Use part (f) of problem 11.12 1 to justify the well known method of casting out nines
to check arithetical computations.

m = a0 + a1 + a2 + + ak (9)

11.20
Prove
X
k<n

1
= n(n)
2

(k,n)=1

11.24
Let Un (d) be the annihilation of d in Zn . The annihilation is:
Un (d) = {x Zn kX d = 0}
= {x Zkxd 0(n)}
(a) Show that Un (d) = Un (d0 ) if d d (n).
(b) Show Un (d) = Un (xd) if (x, n) = 1.

(1)
(2)

11.29
Let (n) be the number of integers 1 k n such that (k,n) = (k+1, n) = 1.
Show is multiplicative, evaluate at prime powers, and deduce
(n) = n

2
(1 )
p
p|n

11.30
Let Z + = {1, 2, 3, 4, 5, } and R the set of functions from Z + to Z. Such a function
is called arithmetic. Some useful members of R are and .

15.3
Prove that there are infinitely many primes (that is, irreducible) polynomials in Zp [x].
Write down the prime polynomials of degree less than or equal to 3 in Z2 [x] and Z3 [x].

15.11
The argument proceeding theorem 14.6 shows that the representation of a prime as
a difference of squares is unique. However,
15 = 82 72 = 42 12
We can count the number of solutions to the Diophantine equation:
x2 y 2 = n
Let
n = 2 p1 1 p2 2

15.11
The argument Proceeding Theorem 14.6 shows that the representation of a prime as
difference of squares is unique. However
15 = 82 72 = 42 12
We can count the number of solutions to the Diophantinie equation:
x2 y 2 = n
Let
n = 2 p1 1 p2 2 p3 3 p4 4 pk k
be the factorization of n as a product of powers of distinct primes. Let
N = ( 1)(1 + 1)(2 + 1)(3 + 1) (k + 1)
Prove that equation x2 y 2 = nhas N/2 positive solutions if N is even and (N+1)/2
if N is odd.

15.12
Which integers can be written as a sum of consecutive odd positive integers of two
or more consecutive odd positive integers?

10

15.13
Answer the questions posed in Problem 15.12 when the word odd is deleted.

11

15.14
Reread Section 1 and Problem 6.1, 6.2 and 6.3, Theorem 14.5 and Problem 15.11 may
suggest new conjectures on representable integers and the number of way to represent
them.

12

22.1
Divisibility tests again. Let m, a0 , a1 , a2 , , ak be as in Problem 11.12 and n, r1 , r2 , r3 ,
, as in Section 16. Prove
m a0 + r1 a1 + r2 a2 + r3 a3 + + rk ak (n) (37)
show that Problem 11.12 consists of special cases of (37). How does this problem
solve Problem 11.13?

13

22.3
In the expansion of 1/7 given by Eq. (1) 2 the sum of the digits in place i and i+3
is always 9: 1 + 8 = 4 + 5 = 2 + 7 = 9 Call n a nine number where (10, n)=1 and the
digits iin place i and ((n)/2) + i in its decimal expansion always sum to 9.
(a) A necessary that n be a nines number is that (n)be even. Does that condition
suffice?
(b) Show that n is a nines number if and only if
10

(n)
2

1(n)

.
(c) Prove: If p is a prime, then (p) is even if and only if p is a nines number.

123456 (p 2)(p 1) 1(p)

14

22.5
Prove that every subgroup of a cyclic group is cyclic. Use that fact to replace the
part of the proof of corollary 17.53 which depends on Eq.(10) of Chapter 2. Then deduce
that equation from Corollary 17.5.

The additive group Zn has exactly (d) elements of order d for each divisor d of n.

15

22.6
Let g and h be commuting elements of the group G. Show that the order of gh divides
the least common multiple m of the order s of g and h. need it equal m? (Compare
Lemma 17.74 )
Write
n = p1 1 p2 2 p3 3 p4 4 pk k
as a product of powers of distinct primes. Show that the least m for which Sm (the
group of permutations of m symbols) contains an element of order n is m = p1 1 + p2 2 +
p3 3 + p4 4 + pk k

The order of < g, h > in G H is the least common multiple of the orders of g in G and h in H.

16

22.7
Deduce Theorem 10.4 from Corollaries 17.5 and 17.8.

Theorem 10.4
The euler -function is multiplicative.

Corollary 17.5
The additive group Zn has exactly (n) elements of order d for each divisor d of n.

17

22.13
Work out a new proof of Theorem 20.3 along the following lines. The kernel K of
the natural map
(p+1 ) (p )
contains the elements of (p+1 ) which are congruent to 1 modulo p . Show K is
naturally isomorphic to the cyclic group Zp , +.
Then use the fact that (p+1 )/K is isomorphic to (p ), which , intuitively, you
may assume is cyclic.

18

22.15
Let g be a primitive root for the odd prime p. When will -g be one too?

19

22.16
Show that the product of the primitive roots of the prime p 3 is congruent to 1
modulo p.

20