Let a and b be positive integers.
* use the euclidean algorithm to compute the following greatest common divisor: gcd(139024789,93278890)
* then, use the extended euclidean algorithm to find integers u and v such that au + bv = gcd(a, b) for the same gcd(a, b) values as above.
* finally, suppose that there are integers u and v satisfying au + bv = 6. is it necessarily true that gcd(a, b) = 6? if not, give a specific counterexample, and describe in general all of the possible values of gcd(a, b).

b

step-by-step explanation:

if a was wrong then it has to be b it cant be c either because not all the y intercepts are the same!

ok now , i would like brainlest plz

i believe the correct answer is b.

step-by-step explanation:

1

center (1,3) with radius 6

step-by-step explanation:

we must complete the square to find the center and radius of the circle.

first make sure the x and y squared terms have 1 as their coefficients. we also make sure x and y terms together.

we now create space between the x and y terms with parenthesis.

we complete the square by taking the middle terms -2x and the -6y - divide each and square them.

we add the squares to both sides.

simplify.

and write the quadratics in factored form.

the center is (h,k) or (1,3). the radius is the square root of 36 which is 6.