Seccin 4.

3 (25-28):

Seccin 4.4 (13-20):

Seccin 5.1 (1, 3,4):

Seccin 5.2 (1, 2, 7, 8,9.):

Seccin 7.1 (9-12,28):

Seccin 7.2 (6-8):

Seccin 7.3 (11, 19, 21,25.):

Seccin 7.4 (4, 13, 14,30.):

Seccin 7.6 (5, 6):

Seccin 8.1 (4, 6,11):

Seccin 8.2 (1):

Some exercises on the Chinese reminder theorem: ( ) for any integer . A) Show that ( ) and B) Suppose that ( ). Prove that ( )) ( . C) A troop of 17 monkeys store their bananas in 11 piles of equal size, each containing more than one banana, with a twelfth pile of 6 left over. When they divide the bananas into 17 equal piles, none are left over. What is the smallest number of bananas they can have?