For each of the following pairs a, b of integers, find the greatest common divisor d of a and b and express d in the form ar + bs: (i) a = 7 and b = 11; (ii) a = −28 and b = −63; (iii) a = 91 and b = 126; (iv) a = 630 and b = 132; (v) a = 7245 and b = 4784; (vi) a = 6499 and b = 4288.

Step-by-step explanation:

We are to find gcd of a and b using linear combination algorithm

a) 7 and 11.   1= 3(7)-2(11). Hence GCD =1

b) -28 and -63:  

7=-2(-28)+(-63)

So 7 is GCD

c)

So 7 is GCD and 7 = 7(91)-5(126)

d) 630 and 132

GCD is 6.

6=630(-9)+43(132)

e) 7245 and 4784

GCD is 23

23 = 7245(35)+4784(-53)

f) 6499 and 4288

GCD is 67

67 = 6499(-31)+4288(47)

24

step-by-step explanation:

if it takes 8 pounds to make 12 divide 12 by 8 and you get 1.5, 1.5 x 16 = 24

(w – 2.5)(w + 2.5)

(–4v – 9)(–4v + 9)

step-by-step explanation: