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).

25.2

step-by-step explanation:

2+4x6-8/10= 25.2

days of the week

step-by-step explanation:

javier earned more money then kyle, so that won't always be a constant term, but the days of the week do not change so that term is always constant.

edit: i meant

1,407.5 hours

step-by-step explanation:

we first convert all the time to hours and then sum them up.

there are 24 hours in 1 day, in 58 days, there are 24 x 58 = 1,392 hours.

there are 60 minutes in 1 hour, thus, 30 minutes will be equivalent to 30 / 60 = 0.5 hours.

therefore, the number of hours it will take mercury to complete a full rotation is 1,392 + 15 + 0.5 = 1,407.5 hours

y=-2x0 is most likey your asnwer