Return to number CVS log

Up to [local] / OpenXM_contrib / pari-2.2 / src / test / 32

Upgraded pari-2.2 to pari-2.2.4.

   realprecision = 38 significant digits
   echo = 1 (on)
? addprimes([nextprime(10^9),nextprime(10^10)])
[1000000007, 10000000019]
? bestappr(Pi,10000)
355/113
? bezout(123456789,987654321)
[-8, 1, 9]
? bigomega(12345678987654321)
8
? binomial(1.1,5)
-0.0045457499999999999999999999999999999997
? chinese(Mod(7,15),Mod(13,21))
Mod(97, 105)
? content([123,456,789,234])
3
? contfrac(Pi)
[3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2, 2, 2, 1, 84, 2, 1
, 1, 15, 3, 13, 1, 4, 2, 6, 6]
? contfrac(Pi,5)
[3, 7, 15, 1, 292]
? contfrac((exp(1)-1)/(exp(1)+1),[1,3,5,7,9])
[0, 6, 10, 42, 30]
? contfracpnqn([2,6,10,14,18,22,26])

[19318376 741721]

[8927353 342762]

? contfracpnqn([1,1,1,1,1,1,1,1;1,1,1,1,1,1,1,1])

[34 21]

[21 13]

? core(54713282649239)
5471
? core(54713282649239,1)
[5471, 100003]
? coredisc(54713282649239)
21884
? coredisc(54713282649239,1)
[21884, 100003/2]
? divisors(8!)
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 28, 30, 32, 
35, 36, 40, 42, 45, 48, 56, 60, 63, 64, 70, 72, 80, 84, 90, 96, 105, 112, 12
0, 126, 128, 140, 144, 160, 168, 180, 192, 210, 224, 240, 252, 280, 288, 315
, 320, 336, 360, 384, 420, 448, 480, 504, 560, 576, 630, 640, 672, 720, 840,
 896, 960, 1008, 1120, 1152, 1260, 1344, 1440, 1680, 1920, 2016, 2240, 2520,
 2688, 2880, 3360, 4032, 4480, 5040, 5760, 6720, 8064, 10080, 13440, 20160, 
40320]
? eulerphi(257^2)
65792
? factor(17!+1)

[661 1]

[537913 1]

[1000357 1]

? factor(100!+1,0)

[101 1]

[14303 1]

[149239 1]

[432885273849892962613071800918658949059679308685024481795740765527568493010
727023757461397498800981521440877813288657839195622497225621499427628453 1]

? factor(40!+1,100000)

[41 1]

[59 1]

[277 1]

[1217669507565553887239873369513188900554127 1]

? factorback(factor(12354545545))
12354545545
? factorcantor(x^11+1,7)

[Mod(1, 7)*x + Mod(1, 7) 1]

[Mod(1, 7)*x^10 + Mod(6, 7)*x^9 + Mod(1, 7)*x^8 + Mod(6, 7)*x^7 + Mod(1, 7)*
x^6 + Mod(6, 7)*x^5 + Mod(1, 7)*x^4 + Mod(6, 7)*x^3 + Mod(1, 7)*x^2 + Mod(6,
 7)*x + Mod(1, 7) 1]

? centerlift(lift(factorff(x^3+x^2+x-1,3,t^3+t^2+t-1)))

[x - t 1]

[x + (t^2 + t - 1) 1]

[x + (-t^2 - 1) 1]

? 10!
3628800
? factorial(10)
3628800.0000000000000000000000000000000
? factormod(x^11+1,7)

[Mod(1, 7)*x + Mod(1, 7) 1]

[Mod(1, 7)*x^10 + Mod(6, 7)*x^9 + Mod(1, 7)*x^8 + Mod(6, 7)*x^7 + Mod(1, 7)*
x^6 + Mod(6, 7)*x^5 + Mod(1, 7)*x^4 + Mod(6, 7)*x^3 + Mod(1, 7)*x^2 + Mod(6,
 7)*x + Mod(1, 7) 1]

? factormod(x^11+1,7,1)

[1 1]

[10 1]

? setrand(1);ffinit(2,11)
Mod(1, 2)*x^11 + Mod(1, 2)*x^10 + Mod(1, 2)*x^8 + Mod(1, 2)*x^4 + Mod(1, 2)*
x^3 + Mod(1, 2)*x^2 + Mod(1, 2)
? setrand(1);ffinit(7,4)
Mod(1, 7)*x^4 + Mod(1, 7)*x^3 + Mod(1, 7)*x^2 + Mod(1, 7)*x + Mod(1, 7)
? fibonacci(100)
354224848179261915075
? gcd(12345678,87654321)
9
? gcd(x^10-1,x^15-1,2)
x^5 - 1
? hilbert(2/3,3/4,5)
1
? hilbert(Mod(5,7),Mod(6,7))
1
? isfundamental(12345)
1
? isprime(12345678901234567)
0
? ispseudoprime(73!+1)
1
? issquare(12345678987654321)
1
? issquarefree(123456789876543219)
0
? kronecker(5,7)
-1
? kronecker(3,18)
0
? lcm(15,-21)
105
? lift(chinese(Mod(7,15),Mod(4,21)))
67
? modreverse(Mod(x^2+1,x^3-x-1))
Mod(x^2 - 3*x + 2, x^3 - 5*x^2 + 8*x - 5)
? moebius(3*5*7*11*13)
-1
? nextprime(100000000000000000000000)
100000000000000000000117
? numdiv(2^99*3^49)
5000
? omega(100!)
25
? precprime(100000000000000000000000)
99999999999999999999977
? prime(100)
541
? primes(100)
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 
157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 2
39, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 33
1, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421
, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509,
 521, 523, 541]
? qfbclassno(-12391)
63
? qfbclassno(1345)
6
? qfbclassno(-12391,1)
63
? qfbclassno(1345,1)
6
? Qfb(2,1,3)*Qfb(2,1,3)
Qfb(2, -1, 3)
? qfbcompraw(Qfb(5,3,-1,0.),Qfb(7,1,-1,0.))
Qfb(35, 43, 13, 0.E-38)
? qfbhclassno(2000003)
357
? qfbnucomp(Qfb(2,1,9),Qfb(4,3,5),3)
Qfb(2, -1, 9)
? form=Qfb(2,1,9);qfbnucomp(form,form,3)
Qfb(4, -3, 5)
? qfbnupow(form,111)
Qfb(2, -1, 9)
? qfbpowraw(Qfb(5,3,-1,0.),3)
Qfb(125, 23, 1, 0.E-38)
? qfbprimeform(-44,3)
Qfb(3, 2, 4)
? qfbred(Qfb(3,10,12),,-1)
Qfb(3, -2, 4)
? qfbred(Qfb(3,10,-20,1.5))
Qfb(3, 16, -7, 1.5000000000000000000000000000000000000)
? qfbred(Qfb(3,10,-20,1.5),2,,18)
Qfb(3, 16, -7, 1.5000000000000000000000000000000000000)
? qfbred(Qfb(3,10,-20,1.5),1)
Qfb(-20, -10, 3, 2.1074451073987839947135880252731470615)
? qfbred(Qfb(3,10,-20,1.5),3,,18)
Qfb(-20, -10, 3, 1.5000000000000000000000000000000000000)
? quaddisc(-252)
-7
? quadgen(-11)
w
? quadpoly(-11)
x^2 - x + 3
? quadregulator(17)
2.0947125472611012942448228460655286534
? quadunit(17)
3 + 2*w
? sigma(100)
217
? sigma(100,2)
13671
? sigma(100,-3)
1149823/1000000
? sqrtint(10!^2+1)
3628800
? znorder(Mod(33,2^16+1))
2048
? forprime(p=2,100,print(p," ",lift(znprimroot(p))))
2 1
3 2
5 2
7 3
11 2
13 2
17 3
19 2
23 5
29 2
31 3
37 2
41 6
43 3
47 5
53 2
59 2
61 2
67 2
71 7
73 5
79 3
83 2
89 3
97 5
? znstar(3120)
[768, [12, 4, 4, 2, 2], [Mod(67, 3120), Mod(2341, 3120), Mod(1847, 3120), Mo
d(391, 3120), Mod(2081, 3120)]]
? getheap
[86, 2661]
? print("Total time spent: ",gettime);
Total time spent: 80
? \q