Math Foundation of CS

4. Find all positive primes 50 (You can just list the positive prime numbers directly.) (10 pts). 5. Find all positive integers less than 50 that are relatively prime to 50 (ahowing the gcd is optional. You can list all the numbers.) (10 pts). Express gcd (990,502)=2 as a linear combination of 990 and 502 by working backwards through the steps of the Euclidean algorithm (10 pts). [Hint refer to Example 17 in the textbook Section 4.3.8] Show that if ab(modm) and cd(modm), where a,b,c,d, and m are integers with m 2 , then acbd(modm)(10pts)