In python please

Limit [-1000, 1000]

Problem 2. Write a program that generates 104 Euclidean Algorithm (or built in gcd command) to decide whether gcd(a, b) = 1 (i.e., if a and b are co-prime). If m is the number of pairs that are co-prime, calculate 10, 000 'random' pairs (a, b) of integers and then use the 10000 which is the fraction of these pairs that are relatively prime. Follow the same procedure for 10 pairs and 106 pairs. Can you make a guess as to what number this ratio approaches? (Hint: It is an integer divided by n?)