Question

Assume the availability of a function is_prime. Assume a variable n has been associated with positive integer. Write the statements needed to find out how many prime numbers (starting with 2 and going in increasing order with successively higher primes [2,3,5,7,11,13,...]) can be added before exceeding n. Associate this number with the variable k. SUBMIT

Answer 1

def main():

# Accept data from the user

n=int(input('Enter the value of n:'))

k=2;

sum=0

print('The list of the prime numbers are as follows:')

# This loop runs from k to n

while k<=n:

# Call is_prime() method,

# to check whether k is a prime or not

sum=sum+is_prime(k)

k=k+1

print('Sum of the prime numbers:',sum)

# is_prime() Method

def is_prime(k):

prime=0

i=1

# Check k is a prime or not

while i<=int(k):

# Find the factors of k

if (k % i) == 0:

prime=prime+1

i=i+1

# If k as two factors

if(prime==2):

print(k)

return k;

# If k as more than two factors

else:

return 0;

# Call the main() method

main()

Step-by-step explanation: