Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 0.2.4 (General solution of $ax + by = N$)

Exercise 0.2.4 (General solution of $ax + by = N$)

Let a , b and N be fixed integers with a and b nonzero and let d = ( a , b ) be the greatest common divisor of a and b . Suppose x 0 and y 0 are particular solutions to 𝑎𝑥 + 𝑏𝑦 = N (i.e., a x 0 + b y 0 = N ). Prove for any integer t that the integers

x = x 0 + b d t , and y = y 0 a d t

are also solutions to 𝑎𝑥 + 𝑏𝑦 = N (this is in fact the general solution).

Answers

Proof. Let a b = d denote the g . c . d odf a , b .

We verify that x = x 0 + b d t and y = y 0 a d t are solutions for any integer t :

𝑎𝑥 + 𝑏𝑦 = a ( x 0 + b d t ) + b ( y 0 a d t ) = a x 0 + b y 0 + 𝑎𝑏 d t 𝑎𝑏 d t = a x 0 + b y 0 = N .

Conversely, let ( x , y ) be any solution of 𝑎𝑥 + 𝑏𝑦 = N . Then 𝑎𝑥 + 𝑏𝑦 = a x 0 + b y 0 , so a ( x x 0 ) = b ( y y 0 ) , and since d a and d b ,

A ( x x 0 ) = B ( y y 0 ) , where A = a d , B = b d . (1)

Then B A ( x x 0 ) , where A B = a d b d = a b d = 1 . Therefore B x x 0 , so there is some t such that x = x 0 = 𝑡𝐵 . If we substitute x x 0 by 𝑡𝐵 in (1), we obtain 𝑡𝐴𝐵 = B ( y y 0 ) , where B 0 (since n 0 by hypothesis), thus y y 0 = 𝑡𝐴 . This gives

x = x 0 + b d t , y = y 0 a d . (2)

So (2) is the general solution of 𝑎𝑥 + 𝑏𝑦 = N (where ( x 0 , y 0 ) is a particular solution). □

User profile picture
2025-12-25 11:05
Comments