| 1 | // File: primitiv_l.tst |
|---|
| 2 | // Intensive tests for primitiv lib |
|---|
| 3 | LIB "tst.lib"; |
|---|
| 4 | tst_init(); |
|---|
| 5 | LIB "primitiv.lib"; |
|---|
| 6 | // ------------ test of primitive and primitive_extra: ------------------- |
|---|
| 7 | printlevel=3; |
|---|
| 8 | ring r=0,x,dp; |
|---|
| 9 | primitive(ideal(x2+1)); |
|---|
| 10 | kill r; |
|---|
| 11 | ring r=0,(x,y),dp; |
|---|
| 12 | ideal i=x2-2,y2-3; |
|---|
| 13 | ideal j=primitive(i); |
|---|
| 14 | factorize(j[1]); |
|---|
| 15 | ring r1=(0,a),x,lp; |
|---|
| 16 | map phi=r,x,a; |
|---|
| 17 | string s=string(phi(j)[1]); |
|---|
| 18 | execute("minpoly="+s+";"); |
|---|
| 19 | if (!defined(phi)) |
|---|
| 20 | { |
|---|
| 21 | map phi=r,x,a; |
|---|
| 22 | } |
|---|
| 23 | ideal v=phi(j)[1],phi(j)[2]^2-2,phi(j)[3]^2-3; |
|---|
| 24 | v; |
|---|
| 25 | if (size(v)>0) |
|---|
| 26 | { "ERROR!!! Result of primitive(i) is not a primitive element!"; } |
|---|
| 27 | // else minpoly(a)=0, g_1(a) is squareroot of 2, g_2(a) is squareroot of 3 |
|---|
| 28 | // as it should be |
|---|
| 29 | setring r; |
|---|
| 30 | primitive_extra(i); |
|---|
| 31 | i=x2-3,y2-x; |
|---|
| 32 | primitive(i); |
|---|
| 33 | primitive_extra(i); |
|---|
| 34 | kill r; |
|---|
| 35 | ring r=0,(x(0..3)),lp; |
|---|
| 36 | int zeit=timer; |
|---|
| 37 | ideal i=x(0)^2-2,x(1)^2-3,x(2)^3-x(0)^2+x(1),x(3)^2-x(2); |
|---|
| 38 | primitive(i); |
|---|
| 39 | tst_ignore(timer-zeit,"time"); |
|---|
| 40 | kill r; |
|---|
| 41 | ring r=0,(x,y),dp; |
|---|
| 42 | poly f1=39x7+37x6+11x5+48x4+30x3+30x2+14x+49; |
|---|
| 43 | poly f2=43x5y2+8x2y5+40x6+48y6+22x4y+7x2y3+7x2y2+16x3+49x2+x+12y+40; |
|---|
| 44 | zeit=timer; |
|---|
| 45 | ideal o=primitive(ideal(f1,f2)); |
|---|
| 46 | tst_ignore(timer-zeit,"time"); |
|---|
| 47 | tst_ignore(kmemory(),"memory"); |
|---|
| 48 | "size of the result :",size(string(o)),"characters"; |
|---|
| 49 | zeit=timer; |
|---|
| 50 | o=primitive_extra(ideal(f1,f2)); |
|---|
| 51 | tst_ignore(timer-zeit,"time"); |
|---|
| 52 | tst_ignore(kmemory(),"memory"); |
|---|
| 53 | "size of the result :",size(string(o)),"characters"; |
|---|
| 54 | kill r; |
|---|
| 55 | ring r=3,(x,y,z),dp; |
|---|
| 56 | ideal i=x2+1,y3-y-1,z2+yz-1; |
|---|
| 57 | primitive(i); |
|---|
| 58 | primitive_extra(i); |
|---|
| 59 | primitive_extra(ideal(i[1],i[2])); |
|---|
| 60 | kill r; |
|---|
| 61 | // ------------ test of splitring: ------------------- |
|---|
| 62 | ring r=2,a,Dp; |
|---|
| 63 | def rr=splitring(a3+a+1); |
|---|
| 64 | setring rr; basering; |
|---|
| 65 | kill r,rr; |
|---|
| 66 | ring r=7,(a,b,c,d,e,n,o,p),Ds; |
|---|
| 67 | def rr=splitring(a2+2); |
|---|
| 68 | kill r,rr; |
|---|
| 69 | ring r=0,(x,y),ds; |
|---|
| 70 | def R1=splitring(x2-5); |
|---|
| 71 | setring R1; basering; |
|---|
| 72 | def R2=splitring(x2-7,a); |
|---|
| 73 | setring R2; |
|---|
| 74 | erg[1]^2; |
|---|
| 75 | basering; |
|---|
| 76 | def R3=splitring(y2+1,a); |
|---|
| 77 | setring R3; basering; |
|---|
| 78 | erg; |
|---|
| 79 | kill r,R1,R2,R3; |
|---|
| 80 | ring r=(2003,j),(a,b,c,d),dp; |
|---|
| 81 | minpoly=j2-2; |
|---|
| 82 | def R1=splitring(b3+b2+b-2,list(a,b,c,d,j)); |
|---|
| 83 | setring R1; erg; |
|---|
| 84 | number(erg[5])^2; |
|---|
| 85 | factorize(b3+b2+b-2); |
|---|
| 86 | def R2=splitring(c2-2j,list(a2+ja,j,erg[5])); |
|---|
| 87 | setring R2; |
|---|
| 88 | erg[3]^2; |
|---|
| 89 | kill R1,R2,r; |
|---|
| 90 | tst_status(1); $ |
|---|
