/dports/math/pari/pari-2.13.3/src/functions/number_theoretical/ |
H A D | issquarefree | 1 Function: issquarefree 3 C-Name: issquarefree 5 Help: issquarefree(x): true(1) if x is squarefree, false(0) if not. 7 (gen):bool issquarefree($1) 11 ? issquarefree(12) 13 ? issquarefree(6) 15 ? issquarefree(x^3+x^2) 18 *** at top-level: issquarefree(Mod(1,4)*(x^2+x+1)) 20 *** issquarefree: impossible inverse in Fp_inv: Mod(2, 4). 31 ? issquarefree(factor(6)) [all …]
|
H A D | HEADER | 42 \teb{issquarefree}. This machinery relies on a fairly strong
|
/dports/math/pari/pari-2.13.3/src/test/in/ |
H A D | arith | 2 issquarefree(0) 8 if (issquarefree(d[1]) != issquarefree(d[2]), error(d));
|
H A D | number | 44 issquarefree(123456789876543219)
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/functions/number_theoretical/ |
H A D | issquarefree | 1 Function: issquarefree 5 Help: issquarefree(x): true(1) if x is squarefree, false(0) if not 7 (int):bool issquarefree($1)
|
/dports/math/gp2c/gp2c-0.0.12/test2/input/ |
H A D | call | 7 gen([isprime,issquare,issquarefree],3)
|
/dports/math/gp2c/gp2c-0.0.12/test2/gp/ |
H A D | call.gp | 7 baz(x)=gen([isprime,issquare,issquarefree],x)
|
/dports/math/lcalc/lcalc-1.23/include/ |
H A D | Lcommandline_numbertheory.h | 41 bool issquarefree(long long n);
|
/dports/math/lcalc/lcalc-1.23/src/ |
H A D | Lcommandline_numbertheory.cc | 136 bool issquarefree(long long n) in issquarefree() function 157 return(issquarefree(m)); in isfunddiscriminant() 164 return(issquarefree(m/4)); in isfunddiscriminant() 169 else if(m%16==8) return(issquarefree(m/8)); in isfunddiscriminant()
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/test/in/ |
H A D | number | 42 issquarefree(123456789876543219)
|
/dports/math/pari/pari-2.13.3/src/test/32/ |
H A D | number | 155 ? issquarefree(123456789876543219)
|
H A D | err | 433 *** galoisinit: domain error in galoisinit: issquarefree(pol) = 0 496 *** polcompositum: domain error in polcompositum: issquarefree(arg) = 0
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/test/32/ |
H A D | number | 142 ? issquarefree(123456789876543219)
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/test/64/ |
H A D | number | 141 ? issquarefree(123456789876543219)
|
/dports/lang/clisp/clisp-df3b9f6fdcff22832898e89a989eb499c0f842ed/modules/pari/ |
H A D | test.tst | 214 (pari:issquarefree 0) 0 215 (pari:issquarefree 1) 1 216 (pari:issquarefree 9) 0 217 (pari:issquarefree 10) 1 218 (pari:issquarefree #Z"x^5") 0 219 (pari:issquarefree #Z"x^2+1") 1 220 (pari:issquarefree #Z"x^3+2*x^2+x") 0
|
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/ |
H A D | MANIFEST | 173 t/26-issquarefree.t
|
/dports/math/pari/pari-2.13.3/src/language/ |
H A D | init.h | 629 {"issquarefree",0,(void*)issquarefree,5,"lG","issquarefree(x): true(1) if x is squarefree, false(0)…
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/basemath/ |
H A D | arith2.c | 1008 gissquarefree(GEN x) { return arith_proto(issquarefree,x,0); } in gissquarefree() 1040 issquarefree(GEN x) in issquarefree() function
|
/dports/math/pari/pari-2.13.3/ |
H A D | CHANGES-2.10 | 179 and issquarefree (assume input is separable) did not agree. Now, 593 37- issquarefree / isfundamental with integer argument: allow factored form
|
/dports/math/giacxcas/giac-1.6.0/doc/pari/ |
H A D | ModRewrite-table | 453 issquarefree Arithmetic_functions.html#issquarefree
|
/dports/math/p5-Math-Pari/pari-2.3.5/misc/ |
H A D | new.dic | 264 issqfree(x)=issquarefree(x);
|
/dports/math/p5-Math-Pari/pari-2.3.5/src/ |
H A D | funclist | 419 830734758 226 ../src/functions/number_theoretical/issquarefree
|
/dports/math/gp2c/gp2c-0.0.12/desc/ |
H A D | func27.dsc | 8560 issquarefree 8564 issquarefree(${1 code}) 8570 issquarefree
|
H A D | func29.dsc | 9870 issquarefree 9874 issquarefree(${1 code}) 9880 issquarefree
|
/dports/math/py-cypari2/cypari2-2.1.2/cypari2/ |
H A D | gen.pyx | 3159 def issquarefree(self): member in Gen 3166 >>> pari(10).issquarefree() 3168 >>> pari(20).issquarefree() 3172 cdef long t = issquarefree(self.g)
|