Divisors, (Extended) Euclidean algorithm 1. Express the numbers 12! = 479,001,600 and the binomial coefficient (2) = 2,704,156, each as products of their prime factors. Do this without using your calculator in any way. Use this to calculate the greatest common divisor, and least common multiple of the two numbers. Confirm how these relate to the product of the numbers. 2. I purchased a number of items that cost $31.70 mch and some other items that met $116.90 each. The total cost of my purchases was $ XXXXXXXXXXHow many items of mch type did I purchase? 3. Let g be the greatest common factor of a = 2,637,110,736 and 6 = 2,961,110,016. (a) Find g using Euclid's algorithm% and (b) using one of the techniques shown in lectures, Sod suitable integers x and y to satisfy the equation g = 2,961,110,016 x+2,637,110,7369. (c) Check whether 6768 is a multiple of g. (It should be!) Find integers s and t mob that 527,760 = 2,961,110,016s + 2,637,110,736 t. Don't just give a single s and t, but find all pairs of integers (s, t) that satisfy this equation. (d) As part of your answer to part (c) you should check that the numbers you have found do indeed satisfy the given equation. If you haven't done so, then do it here, as if a separate task. Explain any difficulties you encountered while doing mob a check, and how you overcame them.
First downloaded: 21/10/2017 at 20:51,17 tl'ou may use appmpriate software when answering parts of this exercise, provided you explain what programs you have ..a, for what purpose, and how you actually made use of them.