Help me these questions

Show your work when possible for full marks 1. List the rst 10 prime numbers. [2 marks] 2. Using Euclid's Algorithm, find the greatest common divisor (sometimes called the greatest common factor) of the following pairs of numbers. [8 marks] a) 15741 and 17808 b) 5049 and 3536 3. Find the Prime Factorization (aka find the prime factors) of the following numbers (show your work). [6 marks a 111111 b) 12130 C 26110 Page 1 of 34. a) Use Euclid's Algorithm, nd the greatest common divisor of 3060 and 1560, [2 marks] 1)) Find the prime factors of 3060 and the prime factors of 1560. How might you use these prime factors to verify your solution to Part a)? [3 marks] 5. Compute the following. [6 marks] (i) 11 mod 2 (iv) 7 mod 12 (ii) 7 mod?) (V) 14 mod 12 (iii) 23 mod 12 (vi) 16 mod 4 6. A human who is 6 feet tall casts a shadow that is 8 feet long. At the same time of day, a buildings shadow is 36 feet long. How tall is the building? [2 marks] 6 feet sJ l l 8 feet 36 feet