satya

Tuesday, October 13, 2020

Program 22

                                             Program 22

Write a function called primes that is given a number n and returns a list of the first n primes. Let the default value of n be 100.


def printPrime(n=100):
    l=[]
    x=2
    while(len(l)<n):    
        for i in range(2,int(x**0.5)+1):
            if(x%i==0):
                break
        else:
            l.append(x)
        x=x+1
    return(l)
n=int(input("enter the number of prime numbers:")) 
s=printPrime(n)
print("List of first",n,"primes:",s)
j=printPrime()
print("List of first 100 primes:",j)

      OUTPUT:

>>> 

======= RESTART: C:/Users/crrcse/Desktop/22.py ========

enter the number of prime numbers:10

List of first 10 primes: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]

List of first 100 primes: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541]

>>> 


No comments:

Post a Comment

Program 30

                                                                         Program 30 Write a Python class to implement pow(x, n). class Pow1:...