source: git/Tst/Short/fglmquot1_s.tst @ 1ebec3

spielwiese
Last change on this file since 1ebec3 was ef52d6, checked in by Oleksandr Motsak <motsak@…>, 11 years ago
Update testsuite wrt current master (320c4f5e64cad778b4ada9556a9b0a6c71cab83a) NOTE: some wrong/bad tests were removed... TODO: add the reset of these updates after updating LIB/
  • Property mode set to 100644
File size: 775 bytes
Line 
1//
2// fglmquot1_s.tst - short tests for fglmquot command
3//
4
5
6LIB "tst.lib";
7tst_init();
8
9option(redSB);
10
11// start with the easy cases
12ring r=0,(x,y,z),lp;
13ideal i=x2,y2,z2; i=std(i);
14fglmquot(i,0);
15fglmquot(i,1);
16fglmquot(i,x);
17// check if it is tested whether the polynomial is reduced
18fglmquot(i,x2);
19
20// now a real world ex
21kill r;
22ring r=0,(x5,x4,x3,x2,x1),lp;
23poly  f1= x1^2 + x1 + x2 + x3 + x4 + x5 - 2*x1 - 4;
24poly  f2= x2^2 + x1 + x2 + x3 + x4 + x5 - 2*x2 - 4;
25poly  f3= x3^2 + x1 + x2 + x3 + x4 + x5 - 2*x3 - 4;
26poly  f4= x4^2 + x1 + x2 + x3 + x4 + x5 - 2*x4 - 4;
27poly  f5= x5^2 + x1 + x2 + x3 + x4 + x5 - 2*x5 - 4;
28ideal i=f1,f2,f3,f4,f5;
29ideal j=stdfglm(i);
30poly q=4*x1^6-12*x1^5-4*x1^4+44*x1^3-48*x1^2+16*x1;
31ideal j1=fglmquot(j,q);
32j1;
33kill r;
34
35tst_status(1);$
Note: See TracBrowser for help on using the repository browser.