Question

python coding

Suppose a list of positive numbers is given like the following list (remember this is only an example and the list could be any list of positive numbers) exampleList: 15 19 10 11 8 7 3 3 1 We would like to know the “prime visibility” of each index of the list. The “prime visibility” of a given index shows how many numbers in the list with indexes lower than the given index are prime. For instance, in the examplList, the “prime visibility” of the index 4 is 2 because there are 2 numbers (19 and 11) before index 4 that are prime. To solve this problem, design and implement a function called primeVisibility with two parameters: 1- The list of numbers 2- The index The function finds and returns the “prime visibility” of the given index.

Answer 1

Source Code:

def isPrime(n):
   prime=False
   for i in range(2,n//2+2):
       if(n%i==0):
           prime=True
           break;
   return prime

def primeVisibilty(lst,index):
   count=0
   for i in range(0,index):
       if(isPrime(lst[i])==True):
           count=count+1
   return count

print(primeVisibilty([15,19,10,11,8,7,3,3,1],4))