Spaces:
Sleeping
Sleeping
File size: 8,881 Bytes
6a86ad5 |
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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 |
from itertools import permutations
from sympy.external.ntheory import (bit_scan1, remove, bit_scan0, is_fermat_prp,
is_euler_prp, is_strong_prp, gcdext, _lucas_sequence,
is_fibonacci_prp, is_lucas_prp, is_selfridge_prp,
is_strong_lucas_prp, is_strong_selfridge_prp,
is_bpsw_prp, is_strong_bpsw_prp)
from sympy.testing.pytest import raises
def test_bit_scan1():
assert bit_scan1(0) is None
assert bit_scan1(1) == 0
assert bit_scan1(-1) == 0
assert bit_scan1(2) == 1
assert bit_scan1(7) == 0
assert bit_scan1(-7) == 0
for i in range(100):
assert bit_scan1(1 << i) == i
assert bit_scan1((1 << i) * 31337) == i
for i in range(500):
n = (1 << 500) + (1 << i)
assert bit_scan1(n) == i
assert bit_scan1(1 << 1000001) == 1000001
assert bit_scan1((1 << 273956)*7**37) == 273956
# issue 12709
for i in range(1, 10):
big = 1 << i
assert bit_scan1(-big) == bit_scan1(big)
def test_bit_scan0():
assert bit_scan0(-1) is None
assert bit_scan0(0) == 0
assert bit_scan0(1) == 1
assert bit_scan0(-2) == 0
def test_remove():
raises(ValueError, lambda: remove(1, 1))
assert remove(0, 3) == (0, 0)
for f in range(2, 10):
for y in range(2, 1000):
for z in [1, 17, 101, 1009]:
assert remove(z*f**y, f) == (z, y)
def test_gcdext():
assert gcdext(0, 0) == (0, 0, 0)
assert gcdext(3, 0) == (3, 1, 0)
assert gcdext(0, 4) == (4, 0, 1)
for n in range(1, 10):
assert gcdext(n, 1) == gcdext(-n, 1) == (1, 0, 1)
assert gcdext(n, -1) == gcdext(-n, -1) == (1, 0, -1)
assert gcdext(n, n) == gcdext(-n, n) == (n, 0, 1)
assert gcdext(n, -n) == gcdext(-n, -n) == (n, 0, -1)
for n in range(2, 10):
assert gcdext(1, n) == gcdext(1, -n) == (1, 1, 0)
assert gcdext(-1, n) == gcdext(-1, -n) == (1, -1, 0)
for a, b in permutations([2**5, 3, 5, 7**2, 11], 2):
g, x, y = gcdext(a, b)
assert g == a*x + b*y == 1
def test_is_fermat_prp():
# invalid input
raises(ValueError, lambda: is_fermat_prp(0, 10))
raises(ValueError, lambda: is_fermat_prp(5, 1))
# n = 1
assert not is_fermat_prp(1, 3)
# n is prime
assert is_fermat_prp(2, 4)
assert is_fermat_prp(3, 2)
assert is_fermat_prp(11, 3)
assert is_fermat_prp(2**31-1, 5)
# A001567
pseudorpime = [341, 561, 645, 1105, 1387, 1729, 1905, 2047,
2465, 2701, 2821, 3277, 4033, 4369, 4371, 4681]
for n in pseudorpime:
assert is_fermat_prp(n, 2)
# A020136
pseudorpime = [15, 85, 91, 341, 435, 451, 561, 645, 703, 1105,
1247, 1271, 1387, 1581, 1695, 1729, 1891, 1905]
for n in pseudorpime:
assert is_fermat_prp(n, 4)
def test_is_euler_prp():
# invalid input
raises(ValueError, lambda: is_euler_prp(0, 10))
raises(ValueError, lambda: is_euler_prp(5, 1))
# n = 1
assert not is_euler_prp(1, 3)
# n is prime
assert is_euler_prp(2, 4)
assert is_euler_prp(3, 2)
assert is_euler_prp(11, 3)
assert is_euler_prp(2**31-1, 5)
# A047713
pseudorpime = [561, 1105, 1729, 1905, 2047, 2465, 3277, 4033,
4681, 6601, 8321, 8481, 10585, 12801, 15841]
for n in pseudorpime:
assert is_euler_prp(n, 2)
# A048950
pseudorpime = [121, 703, 1729, 1891, 2821, 3281, 7381, 8401,
8911, 10585, 12403, 15457, 15841, 16531, 18721]
for n in pseudorpime:
assert is_euler_prp(n, 3)
def test_is_strong_prp():
# invalid input
raises(ValueError, lambda: is_strong_prp(0, 10))
raises(ValueError, lambda: is_strong_prp(5, 1))
# n = 1
assert not is_strong_prp(1, 3)
# n is prime
assert is_strong_prp(2, 4)
assert is_strong_prp(3, 2)
assert is_strong_prp(11, 3)
assert is_strong_prp(2**31-1, 5)
# A001262
pseudorpime = [2047, 3277, 4033, 4681, 8321, 15841, 29341,
42799, 49141, 52633, 65281, 74665, 80581]
for n in pseudorpime:
assert is_strong_prp(n, 2)
# A020229
pseudorpime = [121, 703, 1891, 3281, 8401, 8911, 10585, 12403,
16531, 18721, 19345, 23521, 31621, 44287, 47197]
for n in pseudorpime:
assert is_strong_prp(n, 3)
def test_lucas_sequence():
def lucas_u(P, Q, length):
array = [0] * length
array[1] = 1
for k in range(2, length):
array[k] = P * array[k - 1] - Q * array[k - 2]
return array
def lucas_v(P, Q, length):
array = [0] * length
array[0] = 2
array[1] = P
for k in range(2, length):
array[k] = P * array[k - 1] - Q * array[k - 2]
return array
length = 20
for P in range(-10, 10):
for Q in range(-10, 10):
D = P**2 - 4*Q
if D == 0:
continue
us = lucas_u(P, Q, length)
vs = lucas_v(P, Q, length)
for n in range(3, 100, 2):
for k in range(length):
U, V, Qk = _lucas_sequence(n, P, Q, k)
assert U == us[k] % n
assert V == vs[k] % n
assert pow(Q, k, n) == Qk
def test_is_fibonacci_prp():
# invalid input
raises(ValueError, lambda: is_fibonacci_prp(3, 2, 1))
raises(ValueError, lambda: is_fibonacci_prp(3, -5, 1))
raises(ValueError, lambda: is_fibonacci_prp(3, 5, 2))
raises(ValueError, lambda: is_fibonacci_prp(0, 5, -1))
# n = 1
assert not is_fibonacci_prp(1, 3, 1)
# n is prime
assert is_fibonacci_prp(2, 5, 1)
assert is_fibonacci_prp(3, 6, -1)
assert is_fibonacci_prp(11, 7, 1)
assert is_fibonacci_prp(2**31-1, 8, -1)
# A005845
pseudorpime = [705, 2465, 2737, 3745, 4181, 5777, 6721,
10877, 13201, 15251, 24465, 29281, 34561]
for n in pseudorpime:
assert is_fibonacci_prp(n, 1, -1)
def test_is_lucas_prp():
# invalid input
raises(ValueError, lambda: is_lucas_prp(3, 2, 1))
raises(ValueError, lambda: is_lucas_prp(0, 5, -1))
raises(ValueError, lambda: is_lucas_prp(15, 3, 1))
# n = 1
assert not is_lucas_prp(1, 3, 1)
# n is prime
assert is_lucas_prp(2, 5, 2)
assert is_lucas_prp(3, 6, -1)
assert is_lucas_prp(11, 7, 5)
assert is_lucas_prp(2**31-1, 8, -3)
# A081264
pseudorpime = [323, 377, 1891, 3827, 4181, 5777, 6601, 6721,
8149, 10877, 11663, 13201, 13981, 15251, 17119]
for n in pseudorpime:
assert is_lucas_prp(n, 1, -1)
def test_is_selfridge_prp():
# invalid input
raises(ValueError, lambda: is_selfridge_prp(0))
# n = 1
assert not is_selfridge_prp(1)
# n is prime
assert is_selfridge_prp(2)
assert is_selfridge_prp(3)
assert is_selfridge_prp(11)
assert is_selfridge_prp(2**31-1)
# A217120
pseudorpime = [323, 377, 1159, 1829, 3827, 5459, 5777, 9071,
9179, 10877, 11419, 11663, 13919, 14839, 16109]
for n in pseudorpime:
assert is_selfridge_prp(n)
def test_is_strong_lucas_prp():
# invalid input
raises(ValueError, lambda: is_strong_lucas_prp(3, 2, 1))
raises(ValueError, lambda: is_strong_lucas_prp(0, 5, -1))
raises(ValueError, lambda: is_strong_lucas_prp(15, 3, 1))
# n = 1
assert not is_strong_lucas_prp(1, 3, 1)
# n is prime
assert is_strong_lucas_prp(2, 5, 2)
assert is_strong_lucas_prp(3, 6, -1)
assert is_strong_lucas_prp(11, 7, 5)
assert is_strong_lucas_prp(2**31-1, 8, -3)
def test_is_strong_selfridge_prp():
# invalid input
raises(ValueError, lambda: is_strong_selfridge_prp(0))
# n = 1
assert not is_strong_selfridge_prp(1)
# n is prime
assert is_strong_selfridge_prp(2)
assert is_strong_selfridge_prp(3)
assert is_strong_selfridge_prp(11)
assert is_strong_selfridge_prp(2**31-1)
# A217255
pseudorpime = [5459, 5777, 10877, 16109, 18971, 22499, 24569,
25199, 40309, 58519, 75077, 97439, 100127, 113573]
for n in pseudorpime:
assert is_strong_selfridge_prp(n)
def test_is_bpsw_prp():
# invalid input
raises(ValueError, lambda: is_bpsw_prp(0))
# n = 1
assert not is_bpsw_prp(1)
# n is prime
assert is_bpsw_prp(2)
assert is_bpsw_prp(3)
assert is_bpsw_prp(11)
assert is_bpsw_prp(2**31-1)
def test_is_strong_bpsw_prp():
# invalid input
raises(ValueError, lambda: is_strong_bpsw_prp(0))
# n = 1
assert not is_strong_bpsw_prp(1)
# n is prime
assert is_strong_bpsw_prp(2)
assert is_strong_bpsw_prp(3)
assert is_strong_bpsw_prp(11)
assert is_strong_bpsw_prp(2**31-1)
|