Searched refs:is_mersenne_prime (Results 1 – 15 of 15) sorted by relevance
/dports/math/py-sympy/sympy-1.9/sympy/ntheory/tests/ |
H A D | test_factor_.py | 13 mersenne_prime_exponent, is_perfect, is_mersenne_prime, is_abundant, 631 assert is_mersenne_prime(10) is False 632 assert is_mersenne_prime(127) is True 633 assert is_mersenne_prime(511) is False 634 assert is_mersenne_prime(131071) is True 635 assert is_mersenne_prime(2147483647) is True
|
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/t/ |
H A D | 29-mersenne.t | 16 is_deeply( [grep { is_mersenne_prime($_) } 0 .. $A000043[-1]],
|
/dports/math/p5-Math-Prime-Util-GMP/Math-Prime-Util-GMP-0.52/t/ |
H A D | 26-mersenne.t | 15 is_deeply( [grep { is_mersenne_prime($_) } 0 .. $A000043[-1]],
|
/dports/math/py-sympy/sympy-1.9/sympy/ntheory/ |
H A D | __init__.py | 13 is_perfect, is_mersenne_prime, is_abundant, is_deficient, is_amicable, \
|
H A D | factor_.py | 2428 def is_mersenne_prime(n): function
|
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/ |
H A D | primality.h | 17 extern int is_mersenne_prime(UV p);
|
H A D | primality.c | 1253 int is_mersenne_prime(UV p) in is_mersenne_prime() function
|
H A D | XS.xs | 1243 is_mersenne_prime = 18 1271 case 18: ret = is_mersenne_prime(n); if (ret == -1) status = 0; break;
|
H A D | Changes | 831 - is_mersenne_prime(p) returns 1 iff 2^p-1 is prime
|
/dports/math/py-sympy/sympy-1.9/doc/src/modules/ |
H A D | ntheory.rst | 99 .. autofunction:: is_mersenne_prime
|
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/bin/ |
H A D | primes.pl | 225 push @mprimes, $Mp if $Mp >= $start && is_mersenne_prime($p);
|
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/lib/Math/Prime/Util/ |
H A D | PPFE.pm | 399 sub is_mersenne_prime { subroutine 402 return Math::Prime::Util::PP::is_mersenne_prime($p);
|
/dports/math/py-sympy/sympy-1.9/sympy/ |
H A D | __init__.py | 139 mersenne_prime_exponent, is_perfect, is_mersenne_prime, is_abundant,
|
/dports/math/p5-Math-Prime-Util-GMP/Math-Prime-Util-GMP-0.52/ |
H A D | XS.xs | 953 int is_mersenne_prime(IN UV n)
|
H A D | Changes | 531 - is_mersenne_prime(p) returns 1 iff 2^p-1 is prime
|