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

Need to finish my juan wants to build a greenhouse in his back yard. he needs to maximize the ratio of floor area to structure volume in order to provide the most room for plants while minimizing the area to be heated. find the description of the structure that best meets juan’s criteria. a.) a hemisphere with a diameter of 12 feet b.) a cube with a side length of 12 feet c.) a cone with a diameter of 12 feet and a height of 10 feet d.) a square pyramid with a base side length of 12 feet and a height of 9 feet