def pfacs(n):
k = 0
count = 2
while checkPrime(n) == False:
if n % count != 0:
count += 1
else:
n = int(n / count)
k += 1
return k + 1
def pfactors(n):
primes=[]
for i in range(2,n+1):
if checkPrime(i):
primes.append(i)
factors=[]
while n!=1:
for i in primes:
if n%i==0:
factors.append(i)
n=n/i
return factors
# sum all the first two million primes primes
from CheckPrime import checkPrime
the_sum = 5
for i in range(6, 2000000, 6):
if checkPrime(i - 1): the_sum += (i - 1)
if checkPrime(i + 1): the_sum += (i + 1)
print("the sum:\t", the_sum)
# a prime, gets user input for and prints wether that number is prime or not
from CheckPrime import checkPrime
keepGoing = True
while keepGoing:
try:
n = int(input("number you suspect is a prime: "))
keepGoing = False
except:
pass
print(checkPrime(n))
# break
# if checkPrime(b):
# num+=1
#print(num)
n = input('test number here')
if not n: n=10**8
else: n=int(n)
sqrtn = int(np.sqrt(n))
for b in range(6,n,6):
print(b)
if 2*(b-1)>n:
break
elif checkPrime(b-1):
num+=1
if 2*(b+1)>n:
break
elif checkPrime(b+1):
num+=1
for b in range(6,n,6):
if 3*(b-1)>n:
break
elif checkPrime(b-1):
num+=1
if 2*(b+1)>n:
break
elif checkPrime(b+1):
num+=1
import numpy as np
from CheckPrime import checkPrime
# load the big list of primes all primes below 10^8
primes = np.load('primes_below_50000000.npy')
# find the largest prime that is smaller than the square root
count=0
while True:
b = 10**4 - 1 - 2*count
if checkPrime(b):
p = b
break
count+=1
index = list(primes).index(p)
larger_primes = list(primes[index+1:])
smaller_primes = primes[:index+1][::-1]# reverses the array
# total
total=0
# l is the number of primes that find themselves between
l = 0
for i in smaller_primes:
l+=1# +1 for the smaller prime that was added
j=0
count = 0
k = larger_primes[0]
while k*i < 10**8:
# all primes prints all primes within a specified range
from CheckPrime import checkPrime
keepGoing = True
while keepGoing:
try:
a = int(input("lower bound: "))
b = int(input("upper bound: "))
if a < b:
keepGoing = False
except:
pass
count = 0
for i in range(a, b):
if checkPrime(i):
count += 1
print(i, end="\t")
if count % 10 == 0:
print()
print()