forked from nryoung/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_factorization.py
More file actions
47 lines (36 loc) · 1.11 KB
/
test_factorization.py
File metadata and controls
47 lines (36 loc) · 1.11 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import random
import unittest
from algorithms.factorization.pollard_rho import pollard_rho
from algorithms.factorization.trial_division import trial_division
from algorithms.factorization.fermat import fermat
class TestFermat(unittest.TestCase):
def test_fermat(self):
x = random.randint(1, 100000000)
factors = fermat(x)
res = 1
for i in factors:
res *= i
self.assertEqual(x, res)
class TestPollardRho(unittest.TestCase):
def test_pollard_rho(self):
x = random.randint(1, 100000000000)
factors = pollard_rho(x)
res = 1
for j in factors:
res *= j
self.assertEqual(x, res)
def test_pollard_rho_x_is_zero(self):
x = 0
factors = pollard_rho(x)
res = 1
for j in factors:
res *= j
self.assertEqual(x, res)
class TestTrialDivision(unittest.TestCase):
def test_trial_division(self):
x = random.randint(0, 10000000000)
factors = trial_division(x)
res = 1
for i in factors:
res *= i
self.assertEqual(x, res)