Exercise 9.1.1

Prove that a congruence class [ i ] nℤ has a multiplicative inverse if and only if gcd ( i , n ) = 1 . Conclude that ( nℤ ) has order ϕ ( n ) . Be sure you understand what happens when n = 1 .

Answers

Proof. If [ i ] has a multiplicative inverse in the ring nℤ , then there exists [ j ] nℤ such that [ i ] [ j ] = [ ij ] = 1 , so ij 1 [ n ] . Thus there exists k such that ij kn = 1 . This Bézout’s relation between i and n shows that i n = 1 .

Conversely, if i n = 1 , by Bézout’s Theorem, there exist integers j , k such that ij kn = 1 , so [ i ] [ j ] = [ 1 ] , and [ i ] has a multiplicative inverse nℤ .

[ i ] ( nℤ ) i n = 1 .

The mapping

{ { i | 0 i < n , i n = 1 } ( nℤ ) i [ i ]

obtained by restriction of the bijection [[ 0 , n [[ nℤ , i [ i ] , is well defined, and this is a bijection.

Therefore

| ( nℤ ) | = Card ( { i | 0 i < n , i n = 1 } = ϕ ( n ) .

If n = 1 , the ring 1 is the trivial ring { [ 0 ] } , where [ 0 ] = [ 1 ] , so the multiplicative group ( 1 ) = { [ 1 ] } has one element, and the set of integers i such that 0 i < 1 = n is reduced to { 0 } , which satisfies 0 1 = 1 , so ϕ ( 1 ) = 1 . □

User profile picture
2022-07-19 00:00
Comments