Exercise 1.13

Let n 1 , n 2 , , n s . Define the greatest common divisor d of n 1 , n 2 , , n s and prove that there exist integers m 1 , m 2 , , m s such that n 1 m 1 + n 2 m 2 + n s m s = d .

Answers

Proof. Let n 1 , n 2 , , n s . The ideal of , ( n 1 , , n s ) = n 1 + + n s is principal, so there exists an unique d , d 0 such that

n 1 + + n s = d ( d 0 ) .

We define

d = gcd ( n 1 , , n s ) n 1 + + n s = d and d 0 . (1)

The characterization of the gcd is

d = gcd ( n 1 , , n s )

( i ) d 0 (2) ( ii ) d n 1 , , d n s (3) ( iii ) δ , ( δ n 1 , , δ n s ) δ d (4)

(⇒) Indeed, if we suppose (1), then d 0 , and n 1 = n 1 . 1 + n 2 . 0 + + n s . 0 n 1 + + n s = d , so d n 1 . Similarly d n i , 1 i s so (i)(ii) are true. if δ n i , 1 i s , as d = n 1 m 1 + + n s m s , m 1 , , m s , then δ d .

(⇐) Suppose that d verify (i)(ii)(iii). From (ii), we see that n i dℤ , i = 1 , , s , so n 1 + + n s dℤ .

As is a principal ring, there exists δ 0 such that n 1 + + n s = δ . n i n 1 + + n s so n i δℤ , i = 1 , , s : δ n 1 , , δ n s . From (iii), we deduce δ d . As δℤ dℤ , d δ , with d 0 , δ 0 . Consequently, d = δ and n 1 + + n s = d , d 0 , so d = gcd ( n 1 , , n s ) .

At last, as n 1 + + n s = d , there exist integers m 1 , m 2 , , m s such that n 1 m 1 + n 2 m 2 + + n s m s = d . □

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