/dports/math/octave-forge-symbolic/symbolic-2.9.0/inst/@sym/ |
H A D | nextprime.m | 21 %% @defmethod @@sym nextprime (@var{x}) 27 %% nextprime(sym(2)) 30 %% nextprime([sym(2) 10 0 -1 65530]) 39 function y = nextprime(x) function 41 %y = elementwise_op ('nextprime', x); 44 y = elementwise_op ('lambda a: S(nextprime(a))', x); 49 %!assert (isequal (nextprime(sym(2)), 3)); 50 %!assert (isequal (nextprime(sym(18)), 19)); 51 %!assert (isequal (nextprime(sym([1 2 3])), [2 3 5])); 53 %!assert (isequal (nextprime(sym([-1 0])), [2 2])); [all …]
|
/dports/math/giacxcas/giac-1.6.0/check/ |
H A D | TP10-sol.cas | 26 i:=4;N:=nextprime(10^i+5432)*nextprime(2*10^i+1234); 28 i:=5;N:=nextprime(10^i+5432)*nextprime(2*10^i+1234); #i=6 passe encore mais... 40 N:=nextprime(10^6)*nextprime(2*10^6): 42 N:=nextprime(10^8+5*rand(1000))*nextprime(2*10^8+11*rand(1000)): 57 N:=nextprime((rand(3^(i))))*nextprime((rand(2^(i+1)))); 61 N:=nextprime((rand(3^(i))))*nextprime((rand(2^(i+1)))); 65 N:=nextprime((rand(3^(i))))*nextprime((rand(2^(i+1)))); 93 N:=nextprime(rand(3^i))*nextprime(rand(2^(i+1))); 103 N:=nextprime(10^6)*nextprime(2*10^6); 138 N:=nextprime(10^6)*nextprime(2*10^6): [all …]
|
H A D | TP11-sol.cas | 4 time(p:=nextprime(10^50)): 7 …oir ete utilise pour� trouver le nombre premier avec nextprime. La doc confirme bien que� nextprim… 8 i:=20;n:=nextprime(10^i)*nextprime(20^i); 11 p:=nextprime(nextprime(10^30)*nextprime(20^30)); 45 p:=nextprime(10^13);i:=0;l:=[]; 48 p:=nextprime(p); 50 p:=nextprime(10^13+100); 60 l:=NULL;for i from 1 to 30 do p:=nextprime(rand(10^20)); l:=l,evalf(euler(p-1)/p) od; 63 …l:=NULL;for i from 1 to 30 do p:=nextprime(rand(10^20)); l:=l,[pari_znprimroot(p),p-znorder(Mod(2,… 68 p2:=nextprime(p1);
|
/dports/math/calc/calc-2.14.0.14/help/ |
H A D | nextprime | 2 nextprime - nearest prime greater than specified number 5 nextprime(n [,err]) 14 If n is an integer less than 2^32, nextprime(n) returns the 17 If n >= 2^32 or n is fractional, nextprime(n, err) returns the value 23 ; print nextprime(10), nextprime(100), nextprime(1e6) 26 ; print nextprime(3/2,-99), nextprime(2^32-1,-99), nextprime(2^32,-99)
|
/dports/math/mppp/mppp-0.26/test/ |
H A D | integer_nextprime.cpp | 44 REQUIRE(&nextprime(n1, n2) == &n1); in operator ()() 48 n1.nextprime(); in operator ()() 53 REQUIRE((lex_cast(nextprime(n1)) == lex_cast(m1))); in operator ()() 76 nextprime(n1, n2); in operator ()() 78 REQUIRE((lex_cast(n1) == lex_cast(nextprime(n2)))); in operator ()() 79 n2.nextprime(); in operator ()()
|
/dports/math/R-cran-gmp/gmp/man/ |
H A D | nextprime.Rd | 1 \name{nextprime} 2 \alias{nextprime} 8 nextprime(n) 29 nextprime(14) 31 (p <- nextprime(1e7))
|
/dports/math/pari/pari-2.13.3/src/test/in/ |
H A D | ff | 43 test(nextprime(2^32), 3) 105 test(nextprime(2^7)^5) 106 test(nextprime(2^15)^5) 107 test(nextprime(2^31)^5) 108 test(nextprime(2^63)^5) 109 test(nextprime(2^80)^5) 110 test(nextprime(2^7)^5, 27) 111 test(nextprime(2^15)^5, 27) 112 test(nextprime(2^31)^5, 27) 113 test(nextprime(2^63)^5, 27) [all …]
|
H A D | prime | 24 nextprime(2^32-1) 25 nextprime(2^64-1) 26 nextprime(2.5) 33 nextprime(x)
|
H A D | ellsea | 31 g=ffgen(nextprime(2^32)^2);E=ellinit([g,3]);ellap(E) 37 a=ffgen(ffinit(nextprime(2^30),3),'a); E = ellinit([1,a]); 42 p = nextprime(2^100);
|
H A D | number | 4 addprimes([nextprime(10^9),nextprime(10^10)]) 51 nextprime(100000000000000000000000)
|
H A D | disc | 24 test(ffgen([nextprime(2^100),5],'a)); 27 my(p=nextprime(2^100)); test(Mod(Mod(1,nextprime(2^100)),ffinit(p,3,'a)));
|
H A D | sqrtn | 76 check(Mod(nextprime(2^65),nextprime(2^100))); 78 check(ffgen([nextprime(2^100),3]));
|
H A D | resultant | 86 my(p=nextprime(2^31));polcompositum(p*x^2+x+1,p*x^3+x+1) 87 my(p=nextprime(2^63));polcompositum(p*x^2+x+1,p*x^3+x+1) 113 test(ffgen([nextprime(2^100),5],'a)); 116 my(p=nextprime(2^100)); test(Mod(Mod(1,nextprime(2^100)),ffinit(p,3,'a)));
|
/dports/math/pari/pari-2.13.3/src/test/32/ |
H A D | prime | 31 *** at top-level: nextprime(x) 33 *** nextprime: incorrect type in nextprime (t_POL). 36 *** precprime: incorrect type in nextprime (t_POL).
|
H A D | ff | 56 ? test(nextprime(2^32),3) 240 ? test(nextprime(2^7)^5) 241 ? test(nextprime(2^15)^5) 242 ? test(nextprime(2^31)^5) 243 ? test(nextprime(2^63)^5) 244 ? test(nextprime(2^80)^5) 245 ? test(nextprime(2^7)^5,27) 246 ? test(nextprime(2^15)^5,27) 247 ? test(nextprime(2^31)^5,27) 248 ? test(nextprime(2^63)^5,27) [all …]
|
/dports/math/py-sympy/sympy-1.9/sympy/ntheory/tests/ |
H A D | test_generate.py | 3 from sympy.ntheory import isprime, totient, mobius, randprime, nextprime, prevprime, \ 110 assert nextprime(-4) == 2 111 assert nextprime(2) == 3 112 assert nextprime(5) == 7 113 assert nextprime(12) == 13 126 assert nextprime(90) == 97 127 assert nextprime(10**40) == (10**40 + 121) 169 assert nextprime(2, 2) == 5 187 assert nextprime(2968) == 2969
|
H A D | test_factor_.py | 229 p1 = nextprime(2**32) 231 p3 = nextprime(p2) 247 n = nextprime(2**16)*nextprime(2**17)*nextprime(1901) 251 n = nextprime(2**17) 256 n = nextprime(2**17) 257 n *= nextprime(n) 259 n *= nextprime(n) 262 n *= nextprime(2*n) 268 n = nextprime(8069) 269 n *= nextprime(2*n)*nextprime(2*n, 2) [all …]
|
/dports/math/pari/pari-2.13.3/src/functions/number_theoretical/ |
H A D | nextprime | 1 Function: nextprime 3 C-Name: nextprime 5 Help: nextprime(x): smallest pseudoprime >= x. 7 (gen):int nextprime($1)
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/tests/ntheory/ |
H A D | test_ntheory.py | 347 p1 = nextprime(2**32) 349 p3 = nextprime(p2) 371 n = nextprime(2**16)*nextprime(2**17)*nextprime(1901) 375 n = nextprime(2**17) 380 n = nextprime(2**17) 381 n *= nextprime(n) 383 n *= nextprime(n) 386 n *= nextprime(2*n) 392 n = nextprime(8069) 393 n *= nextprime(2*n)*nextprime(2*n, 2) [all …]
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/functions/number_theoretical/ |
H A D | nextprime | 1 Function: nextprime 5 Help: nextprime(x): smallest pseudoprime >= x 7 (int):int nextprime($1)
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/test/in/ |
H A D | number | 3 gettime; addprimes([nextprime(10^9),nextprime(10^10)]) 49 nextprime(100000000000000000000000)
|
/dports/math/reduce/Reduce-svn5758-src/packages/algint/ |
H A D | torsionb.red | 56 prime1:=nextprime prime1; 57 prime2:=nextprime prime1; 59 prime2:=nextprime prime2; 60 prime3:=nextprime prime2; 62 prime3:=nextprime prime3;
|
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/TmpFactorDir/ |
H A D | primes.c | 77 FFelem nextprime(FFelem n) in nextprime() function 124 ans->start = nextprime(MAX_PRIME/3); /* heuristic/guess */ in PrimeSourceCtor() 138 PS->p = nextprime(PS->p); in NextPrime()
|
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/TmpFactorDir/ |
H A D | primes.c | 77 FFelem nextprime(FFelem n) in nextprime() function 124 ans->start = nextprime(MAX_PRIME/3); /* heuristic/guess */ in PrimeSourceCtor() 138 PS->p = nextprime(PS->p); in NextPrime()
|
/dports/devel/splint/splint-3.1.2/test/tests2.4/ |
H A D | hash.c | 10 static int nextprime(int number); 26 table->size=nextprime(size); in hashcreate() 124 size=nextprime(table->size*2); in hashexpand() 146 nextprime(int number) in nextprime() function
|