/dports/math/py-sympy/sympy-1.9/sympy/ntheory/tests/ |
H A D | test_factor_.py | 158 assert factorint(0) == {0: 1} 159 assert factorint(1) == {} 160 assert factorint(-1) == {-1: 1} 163 assert factorint(2) == {2: 1} 213 assert factorint(2**64 + 1, use_trial=False) == factorint(2**64 + 1) 220 assert factorint( 222 assert factorint(1, limit=1) == {} 223 assert factorint(0, 3) == {0: 1} 260 assert len(factorint(n)) == 3 280 assert str(factorint(n)) == sans [all …]
|
/dports/math/pari/pari-2.13.3/src/test/in/ |
H A D | factorint | 1 factorint(-33623546348886051018593728804851,1) 2 factorint(691160558642,1) 4 factorint(10^120+1,14) 6 factorint(p^2*q*r,14) 7 factorint(p*q^2*r,14) 8 factorint(p*q*r^2,14) 9 factorint(p^3*r,14) 10 factorint(p^4*r,14) 11 factorint(p^5*r,14)
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/tests/ntheory/ |
H A D | test_ntheory.py | 306 assert factorint(0) == {0: 1} 307 assert factorint(1) == {} 308 assert factorint(-1) == {-1: 1} 311 assert factorint(2) == {2: 1} 328 assert factorint(2**64 + 1, use_trial=False) == factorint(2**64 + 1) 337 assert factorint( 339 assert factorint(1, limit=1) == {} 340 assert factorint(0, 3) == {0: 1} 384 assert len(factorint(n)) == 3 886 assert factorint(1, visual=1) == 1 [all …]
|
/dports/math/py-sympy/sympy-1.9/sympy/ntheory/ |
H A D | factor_.py | 91 facs = factorint(n) 174 facs = factorint(n, visual=False) 374 factors = factorint(p) 1207 factors = factorint( 1465 for p, e in factorint(rat.q, limit=limit, 1531 factordict = factorint(n) 1913 factors = factorint(n) 1989 factors = factorint(n) 2165 for p, e in factorint(n).items(): 2278 return len(factorint(n).keys()) [all …]
|
H A D | residue_ntheory.py | 33 f = factorint(n) 37 fpx = factorint(px - 1) 74 v = [(p - 1) // i for i in factorint(p - 1).keys()] 114 f = factorint(p) 335 f = factorint(p) 506 f = factorint(a) 653 for prime, power in factorint(m).items(): 688 f = factorint(q) 760 f = factorint(m) 1081 a = factorint(n) [all …]
|
H A D | __init__.py | 8 from .factor_ import divisors, proper_divisors, factorint, multiplicity, \
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/ntheory/ |
H A D | factor_.py | 42 facs = factorint(n) 126 facs = factorint(n, visual=False) 967 factors = factorint( 1118 ps = factorint(c, limit=limit - 1, 1139 ps = factorint(c, limit=limit - 1, 1182 for p, e in factorint(rat.denominator, limit=limit, 1235 factors = sorted(factorint(n, limit=limit, verbose=verbose)) 1244 factordict = factorint(n) 1440 factors = factorint(n) 1573 for p, e in factorint(n).items(): [all …]
|
H A D | residue_ntheory.py | 9 from .factor_ import factorint, multiplicity, totient, trailing 33 f = factorint(n) 37 fpx = factorint(px - 1) 72 v = [(p - 1) // i for i in factorint(p - 1)] 109 f = factorint(p) 291 f = factorint(p) 465 f = factorint(a) 613 for prime, power in factorint(m).items(): 647 f = factorint(q) 963 a = factorint(n) [all …]
|
H A D | primetest.py | 287 from .factor_ import factorint, trailing 293 f = factorint(b)
|
H A D | __init__.py | 10 from .factor_ import (divisor_count, divisor_sigma, divisors, factorint,
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/functions/number_theoretical/ |
H A D | factorint | 1 Function: factorint 3 C-Name: factorint 5 Help: factorint(x,{flag=0}): factor the integer x. flag is optional, whose
|
/dports/math/pari/pari-2.13.3/src/functions/number_theoretical/ |
H A D | factorint | 1 Function: factorint 3 C-Name: factorint 5 Help: factorint(x,{flag=0}): factor the integer x. flag is optional, whose
|
H A D | factor | 23 See \tet{factorint} for the algorithms used. The factorization includes the 76 \kbd{factorint(, 1 + 8)} will in general be faster. The latter does not 96 ? factorint(F, 1+8) \\ much faster and all small primes were found
|
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/bench/ |
H A D | bench-factor-semiprime.pl | 73 my ($pn,$pc) = @{factorint($sp)}; 82 …'Pari' => sub { do { my ($pn,$pc) = @{factorint($_)}; my @f = map { int($pn->[$_]) x $pc->[$_] } …
|
H A D | factor-gnufactor.pl | 192 my ($pn,$pc) = @{Math::Pari::factorint($n)};
|
/dports/math/pari/pari-2.13.3/src/functions/polynomials/ |
H A D | poldiscfactors | 8 factorization via factorint. 17 If \fl\ is $1$, finish the factorization using \kbd{factorint}.
|
/dports/math/pari/pari-2.13.3/src/test/32/ |
H A D | factorint | 29 *** factorint: Warning: MPQS: number too big to be factored with MPQS,
|
/dports/science/py-OpenFermion/OpenFermion-1.3.0/src/openfermion/circuits/primitives/ |
H A D | ffft.py | 17 from sympy.ntheory import factorint 205 factors = [f for f, count in factorint(n).items() for _ in range(count)]
|
/dports/math/py-Diofant/Diofant-0.13.0/docs/release/ |
H A D | notes-0.6.7.rst | 17 * implement visual ``factorint()``
|
/dports/math/py-mathics/Mathics3-2.2.0/mathics/builtin/numbers/ |
H A D | numbertheory.py | 230 factors = sympy.factorint(n.value) 238 map(sympy.factorint, n.value.as_numer_denom()) 887 if len(sympy.factorint(n)) == 1:
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/domains/ |
H A D | finitefield.py | 9 from ..ntheory import factorint, is_primitive_root, isprime 107 pp = factorint(order)
|
/dports/math/octave-forge-symbolic/symbolic-2.9.0/inst/@sym/ |
H A D | factor.m | 123 p = pycall_sympy__ ('return factorint(_ins[0], visual=True),', f); 125 cmd = { 'd = factorint(_ins[0], visual=False)'
|
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/xt/ |
H A D | pari-compare.pl | 28 my($pn,$pc) = @{Math::Pari::factorint($n)}; 188 my($pn,$pc) = @{Math::Pari::factorint($n)};
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/polys/ |
H A D | factortools.py | 8 from ..ntheory import factorint, isprime, nextprime 500 e_ff = factorint(int(e_fc)) 560 indices = {n//d for d in factorint(n)} 579 for p, k in factorint(n).items(): 714 for p, k in factorint(n).items():
|
/dports/math/py-sympy/sympy-1.9/doc/src/modules/ |
H A D | ntheory.rst | 51 .. autofunction:: factorint
|