Express the GCD as a linear combination for the following
For some x and y
1. 72 and 24
2. 48 and 18
3.252 and 198
4. 216 and 126
5. 657 and 963
Open in App
Solution
GCD divisor d is computed by applying Euclidean algorith (1) 24,72 72=24*3+0 hence d=GCD(24,72)=3.it can be written as a combination of d=24x+72y.reverse above Euclidean algorith computation 3=24*5-72*1 GCD=24x-72y