Question

Write function all_coprime_pairs( ) which takes as input a list, L, with positive unique integers (i.e. no duplicated integers), and should return:

1. List (of tuples) containing all pairs of numbers in L that are coprime.

2. Empty list, If no pair of numbers in L is coprime.

Your solution must include a function call to the function coprime designed in the previous question. The order of the tuples or the order of the two numbers within the tuples is not important.

My function coprime(x,y) is:

def coprime(x,y):

for i in range (2,x+1):

if x%i==0 and y%i==0:

return False

return True

###This is in Python###

Answer 1

PYTHON CODE:

import math

import math

def coprime(x,y):

for i in range (2,x+1):

if x%i==0 and y%i==0:

return False

return True

def all_coprime_pairs(L):

coprime_list = [] #create empty list

n = len(L)

for i in range(0,n-1):

for j in range(i+1,n): # we start the loop from i+1 so that we do not repeat the pairs added to list before

if(coprime(L[i],L[j])):

coprime_list.append((L[i],L[j])) #append the tuple to the list if both the numbers are coprime

return coprime_list

arr = [1, 2, 5, 4, 8, 3, 9]

all_coprime_pairs(arr)

OUTPUT:

(Note please refer the following screenshots in case of indentation error)