This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n 3 + 7 n 3(1) n + 5 n 3 + 7 n 10 n + 5 n 3 5(2 n + n 3 ) 0 (mod 5). ThereFore, 3 n 5 + 5 n 3 + 7 n 0 (mod 3) and 3 n 5 + 5 n 3 + 7 n 0 (mod 5), so 3 n 5 + 5 n 3 + 7 n (mod 15), and hence n 5 5 + n 3 3 + 7 n 15 is an integer. Question 9C # 7 (i) IF p is prime, then For all 1 a p1, ( a, p ) = 1. This implies that [ a ] is a unit in Z /p Z . ( p ) is the number oF units in Z /p Z , so ( p ) = p1. (ii) ( p n ) is the number oF integers a , where 1 a p n and ( a, p n ) = 1. Since p is prime, ( a, p n ) = 1 iF and only iF pa . So ( p n ) counts all number between 1 and p n , inclusive, that are not multiples oF p . Since p n = p n1 p , then there are p n1 multiples oF p between 1 and p n inclusive. ThereFore, ( p n ) = p np n1 iF p is prime. 1...
View Full
Document
 Spring '08
 BILLERA
 Math, Algebra

Click to edit the document details