def kthprimeNumber(Number, position): primeNumber = [] prime = Number if (validate_prime.isprime(Number)): prime = Number + 1 while (len((primeNumber)) != position): if (validate_prime.isprime(prime)): primeNumber.append(prime) prime += 1 return primeNumber[position - 1]
def primeNumbersfrom2(N): PrimeNumbers = [] if (N <= 1 or N == 2): return "Sorry,There is no Prime Numbers" for i in range(2, N): if validate_prime.isprime(i): PrimeNumbers.append(i) return PrimeNumbers
def test_Zero_primenumbers(): #rearrange n = 0 expected = False #act actual = validate_prime.isprime(n) #assert assert expected == actual
def test_some_larger_numbers(): #rearrange n = 123457 expected = True #act actual = validate_prime.isprime(n) #assert assert expected == actual
def test_even_primenumbers(): #rearrange n = 2 expected = True #act actual = validate_prime.isprime(n) #assert assert expected == actual
def test_isprimes(): #rearrange n = 1 excepted = False #act actual = validate_prime.isprime(n) #assert assert excepted == actual
def test_primenumbers(): #rearrange n = 1001 expected = False # because 1001 is divisible by 7 = 143 #act actual = validate_prime.isprime(n) #assert assert expected == actual
def test_negativenumbers(): #rearrange n = -1 excepted = False #act actual = validate_prime.isprime(n) #assert assert excepted == actual
def primenumbers2(Nu): primenumbers=[] if (Nu<=1 or Nu==2): return "not prime" for i in range(2,Nu): if validate_prime.isprime(i): primenumbers.append(i) return primenumbers
def prime_numbers_from_1_to_N(N): primeNumbers = [1] #print ("1") N = abs(N) for i in range(2,N-1): if (validate_prime.isprime(i)): primeNumbers.append(i) #print (i) return primeNumbers
def prime_factors(N): #n = [2,3,5,7,11,13,19,23,29,31,] prime_numbers = [] prime_factorss = [] M = N if (N < 1 or N == 0 or N == 1): return "sorry prime Numbers can't be found" if (validate_prime.isprime(N)): M = M + 1 for i in range(1, M): if (validate_prime.isprime(i)): prime_numbers.append(i) while (N != 1 or N != 1): for i in prime_numbers: if (N % i == 0): prime_factorss.append(i) N = N / i return prime_factorss
def printNumberlessthanorequaltoN(N): count = 0 Prime = 2 PrimeNumbers = [] while (count < N): if (validate_prime.isprime(Prime)): PrimeNumbers.append(Prime) count = len(PrimeNumbers) Prime += 1 #count += 1 return PrimeNumbers #print(printNumberlessthanorequaltoN() )
def inbetweenPrimeNumbers(m, n): if (m > n): return "Provide always M less than N" n = n + 1 count = 0 PrimeNumbers = [] s = str("There is no Prime Numbers exsist") for i in range(m, n): if (validate_prime.isprime(i)): PrimeNumbers.append(i) count += 1 if (m % 2 == 0 and n % 2 == 1 and len(PrimeNumbers) == 2): return s elif (len(PrimeNumbers) == 0 and count == 0): return s else: return PrimeNumbers, count return PrimeNumbers, count
def inbetweenPrimeNumbers(m, n): if (m > n): return "Provide always M less than N" n = n + 1 #if (m==1 and n==2): # n += 1 PrimeNumbers = [] s = str("There is no Prime Numbers exsist") for i in range(m, n): if (validate_prime.isprime(i)): PrimeNumbers.append(i) if (m % 2 == 0 and n % 2 == 1 and len(PrimeNumbers) == 2): return s else: return PrimeNumbers #if (m%2==1 and n%2==1 and len(PrimeNumbers)==1): # return s #else: return PrimeNumbers