def find_primes(n):

    numbers = [2] 

    for i in range(3, n + 1):
        if i % 2 != 0:
            numbers.append(i) 


    for number in numbers:
        is_prime(number) 
Exemple #2
0
Fichier : h.py Projet : sudo-gera/c
def next_prime(q):
    if q < 2:
        return 2
    q -= (q + 1) % 2
    q += 2
    while not is_prime(q):
        q += 2
    return q
Exemple #3
0
def problem5(n):
	result = 1
	for i in range(2, n + 1):
		x = prime_power(i)
		if is_prime(i):
			result *= i
		elif x[0]:
			result *= x[1]
	return result
Exemple #4
0
Fichier : h.py Projet : sudo-gera/c
def prev_prime(q):
    if q < 3:
        return None
    if q == 3:
        return 2
    q += (q + 1) % 2
    q -= 2
    while not is_prime(q):
        q -= 2
    return q
 def test_09 (self) :
     self.assertTrue(is_prime(9))
 def test_07 (self) :
     self.assertTrue(is_prime(7))
 def test_05 (self) :
     self.assertTrue(is_prime(5))
 def test_04 (self) :
     self.assertFalse(is_prime(4))
 def test_03 (self) :
     self.assertTrue(is_prime(3))
 def test_02 (self) :
     self.assertFalse(is_prime(2))
Exemple #11
0
 def test_is_four_non_prime(self):
     """is four correctly determined not to be prime?
     """
     #self.assertTrue(is_prime(4),msg="Four is not prime!")# this raises an error and gives us the msg :"Four is not prime!"
     self.assertFalse(is_prime(4),msg="Four is not prime!")# this will pass the test
     self.assertFalse(is_prime(4))
Exemple #12
0
from is_prime import *

n = 100000000
while is_prime(n) is False:
    if is_prime(n) is False:
        n += 1
    else:
        break
print(n)
Exemple #13
0
from is_prime import *

for i in range(10000, 10051):
    if is_prime(i):
        if i == 10039:
            print(i)
        else:
            print(i, end=", ")
Exemple #14
0
Fichier : h.py Projet : sudo-gera/c
 def __eq__(s, o):
     return is_prime(o)
Exemple #15
0
 def test_is_five_prime(self):
     """Is five successfully determined to be prime?
     """
     self.assertTrue(is_prime(5))
Exemple #16
0
from is_prime import *

for i in range(222281, 222381):
    binaire = bin(i)
    if is_prime(binaire.count('1')):
        print(i)
Exemple #17
0
 def test_negative_numver(self):
     """is a negative number correctly determined not to be prime?
     """
     for index in range(-1,-10,-1):
         self.assertFalse(is_prime(index),msg="{} should not be determined to be prime".format(index))
 def test_27 (self) :
     self.assertFalse(is_prime(27))
 def test_01 (self) :
     self.assertFalse(is_prime(1))
 def test_29 (self) :
     self.assertTrue(is_prime(29))
Exemple #21
0
 def test_is_zero_not_prime(self):
     """is zero correctly determined not to be prime?
     """
     self.assertFalse(is_prime(0)) # we'll get a Fail for this test since True is not false