PYTHON

python - prime number generator

# Prime number generator
def prime_generator(end):
    for n in range(2, end):     # n starts from 2 to end
        for x in range(2, n):   # check if x can be divided by n
            if n % x == 0:      # if true then n is not prime
                break
        else:                   # if x is found after exhausting all values of x
            yield n             # generate the prime


g = prime_generator(1000)       # give firt 1000 prime numbers
print(list(g)) 

generate random prime number python

import sympy

primeNumber = sympy.randprime(min, max)

prime number generator python

#prime number gen

nums=[]
max=10000

class N:
    def crazy():
        for i in range(max):
            nums.append(True)
        nums[0]=False
        nums[1]=False

        for index in range(max):
            if nums[index]:
                current_multiple = 2
                while index*current_multiple < max:
                    nums[index*current_multiple ]= False
                    current_multiple += 1

        for index in range(max):
            if nums[index]:
                print(f"----> {index} is a prime #")

N.crazy()