Also express it as a linear combination of 81 and 237 i.e, H.C.F of 81,237=81x+237y for some x,y.
[Note: Values of x and y are not unique]
Open in App
Solution
According to the definition of Euclid's theorem,
a=b×q+r where 0≤r<b.
Since 81<237, let us apply division algorithm to these numbers. 81|237|2 |162| ¯¯¯¯¯¯¯¯¯|75| ∴237=81×2+75 ..... (1) Since the remainder 75≠0 ∴ we consider the divisor 81 and the remainder 75.
Again by division algorithm, 75¯¯¯¯¯¯¯¯¯¯)81(1 75––– 6– ∴81=75×1+6 .... (2)
Again consider divisor 75 and new remainder =6, 6¯¯¯¯¯¯¯¯¯¯)75(12 75––– 3– ... (3)
Again consider divisor 6 and new remainder =3, By division algorithm, 3¯¯¯¯¯¯¯)6(2 6– 0– ∴6=3×2+0 ..... (4) ∴ The remainder =0 ∴H.C.F.=3
In order to write H.C.F. in form of 81 & 237, we have 3=75−6×12=75−(81−75×1)×12 =75−12×81+12×75=13×75−12×81 =13×(237−81×2)−12×81 =13×237−26×81−12×81 =13×237−38×81 Thus 3=237y+81x where y=13 and x=−38