make  check-TESTS
make[1]: entrant dans le répertoire « /home/parisse/giac-1.2.3/check »
// Using locale /usr/share/locale/
// setlocale returns 0
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.03
// Time 0.01
// Time 0.05
// Time 0
// Time 0
// Time 0.03
// Time 0
// Time 0.01
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.04
// Time 0.01
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
No check were made for singular points of antiderivative -1/ln(t) for definite integration in [2,x]
// Time 0
No check were made for singular points of antiderivative ln(n+1)+2*ln(n+2)-3*ln(n+3)+n*ln(1+2/n/(n+3)) for definite integration in [1,+infinity]
// Time 0.01
No check were made for singular points of antiderivative (t^2*n^2-t*pi*n^2-2)*n^3/(-n^3)^2*cos(n*t)-(2*t*n-pi*n)*n^3/(-n^3)^2*sin(n*t) for definite integration in [0,pi]
// Time 0.01
No check were made for singular points of antiderivative exp(t)*(1/(1+n^2)*cos(n*t)+n/(1+n^2)*sin(n*t)) for definite integration in [-pi,pi]
// Time 0.01
No check were made for singular points of antiderivative exp(-x)*(-1/2*cos(x)+1/2*sin(x)) for definite integration in [0,+infinity]
// Time 0
// Time 0.01
Warning, integration of abs or sign assumes constant sign by intervals (correct if the argument is real):
Check [abs(ln(x))]
Discontinuities at zeroes of ln(x) were not checked
No check were made for singular points of antiderivative x^2*exp(ln(x)*sign(ln(x)))/(sign(ln(x))+2) for definite integration in [2,t]
// Time 0.01
No check were made for singular points of antiderivative 1/sqrt(2)*exp(-t^2/2)*2/t*sqrt(t*x) for definite integration in [a,b]
// Time 0.01
// Time 0
// Time 0.04
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Total time 0.4
PASS: chk_integrate
// Using locale /usr/share/locale/
// fr_FR.UTF-8
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/fr/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.01
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0.11
// Total time 0.19
PASS: chk_factor
// Using locale /usr/share/locale/
// fr_FR.UTF-8
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/fr/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Time 0.01
// Time 0.01
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.33
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0

Temps mis pour l'évaluation: 4.83
// Time 4.83
// Total time 5.19
PASS: chk_normalize
// Using locale /usr/share/locale/
// fr_FR.UTF-8
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/fr/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Time 0
// Total time 0
PASS: chk_partfrac
// Using locale /usr/share/locale/
// fr_FR.UTF-8
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/fr/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.03
// Time 0
// Time 0.02
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.03
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.05
// Time 0
// Time 0.02
// Total time 0.27
PASS: chk_limit
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Success
// Success
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
Unable to build a single algebraic extension for simplifying.
Trying rational simplification only. This might return a wrong answer if simplifying 0/0!
// Time 0
// Time 0.03
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
Warning, argument is not an equation, solving x^2-1=0
// Time 0
// Time 0.01
Warning, argument is not an equation, solving x^2-3=0
// Time 0
Warning, argument is not an equation, solving x^3-3*y=0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0

Evaluation time: 0.54
// Time 0.54
// Time 0
// Time 0.05
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.03
// Time 0
// Time 0
// Time 0.03
// Time 0
// Time 0
// Time 0.01
// Total time 0.86
PASS: chk_cas
// Using locale /usr/share/locale/
// setlocale returns 0
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Time 0
// Time 0
medianes
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
mediatrices
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
bissectrices
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.03
// Time 0
// Time 0
Napoleon theorem
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
Feuerbach theorem
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
teste que le pied de la altitude est sur c de 2 facons, doit renvoyer 1 puis 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
circle incircle de A,B,C, center
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0.01
Warning, ^ is ambiguous on non square matrices. Use .^ to apply ^ element by element.
// Time 0
Le prochain resultat doit etre 0
// Time 0
// Time 0.01
theoreme de Simson
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
Variable x should be purged
Variable y should be purged
// Time 0
// Time 0
// Time 0
Morley theorem
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.03
// Time 0
// Time 0.05
// Time 0.04
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.02
// Total time 0.29
PASS: chk_geo
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Parsing find_equi
// Warning: Ptest,test, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// compiling find_equi
// Parsing find_equi
// Warning: Ptest,test, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// compiling find_equi
// Time 0
q:0
q:1
"test equilateral",1,1,1
"equilateral",1,1,1,"confirme"
"test equilateral",1,3,13
Warning, the test a==b is performed by checking
that the internal representation of regroup(a-b) is not 0.
Therefore a==b may return false even if a and b are mathematically equal,
if they have different internal representations.
You can explicitly call a simplification function like simplify(a-b)==0 to avoid this.
"equilateral",1,3,13,"confirme"
q:2
q:3
"test equilateral",3,13,1
"equilateral",3,13,1,"confirme"
"test equilateral",3,17,25
"equilateral",3,17,25,"confirme"
q:4
q:5
"test equilateral",5,27,13
"equilateral",5,27,13,"confirme"
"test equilateral",5,29,25
"equilateral",5,29,25,"confirme"
q:6
q:7
q:8
q:9
q:10
q:11
q:12
q:13
"test equilateral",13,1,3
"equilateral",13,1,3,"confirme"
"test equilateral",13,5,27
"equilateral",13,5,27,"confirme"
q:14
q:15
"test equilateral",15,15,15
"equilateral",15,15,15,"confirme"
"test equilateral",15,17,27
"equilateral",15,17,27,"confirme"
q:16
q:17
"test equilateral",17,25,3
"equilateral",17,25,3,"confirme"
"test equilateral",17,27,15
"equilateral",17,27,15,"confirme"
q:18
q:19
q:20
q:21
q:22
q:23
q:24
q:25
"test equilateral",25,3,17
"equilateral",25,3,17,"confirme"
"test equilateral",25,5,29
"equilateral",25,5,29,"confirme"
q:26
q:27
"test equilateral",27,13,5
"equilateral",27,13,5,"confirme"
"test equilateral",27,15,17
"equilateral",27,15,17,"confirme"
q:28
q:29
"test equilateral",29,25,5
"equilateral",29,25,5,"confirme"
"test equilateral",29,29,29
"equilateral",29,29,29,"confirme"
q:30
q:31
q:32
q:33
q:34
q:35

Evaluation time: 2.79
// Time 2.79
// Time 0
// Total time 2.79
PASS: chk_morley_demo
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Success
// End defining f
// Success
// End defining m1
// Success
// End defining m2
// Success
// End defining m3
// Success
// End defining m4
// Success
// End defining h1
// Time 0
// Time 0.02
// Time 0.01
// Time 0
// Time 0.01
// Time 0.02
// Time 0
// Time 0.01
// Time 0.04
// Time 0
// Time 0.01
// Time 0.04
// Time 0
// Time 0.01
// Time 0

Evaluation time: 0.57
// Time 0.57
// Time 0.29
Simplification assuming t near 0
Simplification assuming t near 0
Simplification assuming t near 0
Simplification assuming t near 0
// Time 0.12
Simplification assuming t near 0
Simplification assuming t near 0
Simplification assuming t near 0
Simplification assuming t near 0

Evaluation time: 0.54
// Time 0.54
// Total time 1.69
PASS: chk_xavier
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: a, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Success
// End defining f
// Success
// End defining f
// Warning: f, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining T
// Warning: a,n, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: L,a, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
(Comment) scanning line 91
(Comment) scanning line 92
(Comment) scanning line 93
(Comment) scanning line 94
(Comment) scanning line 95
(Comment) scanning line 96
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
OK c'est un  carre
// Time 0.01
// Time 0
calcul du det 8x8 antisymetrique formel
// Time 0

Evaluation time: 3.04
// Time 3.04
// Time 0.05
OK c'est bien nul

Evaluation time: 1.48
// Time 1.48
// GCD eval dimension 28 5320000 Vector [2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2] 5250 Vector [1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1]1380 
Find_good_eval 5320000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 5320000 0
Gb= 5320000 0
Find_good_eval 5320000 [81,-88,51,-8,68,48,-46,-59,-69,84,31,45,-28,99,84,56,-66,92,-31,-63,33,44,93,-37,-20,39,-4]
Fb= 5590000 %%%{-13570,[2]%%%}+%%%{-1665,[1]%%%}+%%%{-8878,[0]%%%}
Gb= 5680000 %%%{-13570,[1]%%%}+%%%{14173,[0]%%%}
FOUND good eval5680000 [81,-88,51,-8,68,48,-46,-59,-69,84,31,45,-28,99,84,56,-66,92,-31,-63,33,44,93,-37,-20,39,-4]
// evaled GCD deg 1
Trying q/lgcd(q) as gcd 28 5680000
lgcd(q) ok 28 5700000
Success q/lgcd(q) as gcd 28 5830000

Evaluation time: 1.2
// Time 1.2
OK pour le pfaffien 8x8
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
La jordanisation est bonne
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Total time 5.82
PASS: chk_fhan1
// Using locale /usr/share/locale/
// setlocale returns 0
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Success
// Success
// End defining Cond
// Success
// Success
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.23
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.25
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Total time 0.51
PASS: chk_fhan2
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Success
// Success
// End defining minval
// Success
// End defining trans
// Warning: k,n,l,B,minval,j,trans, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining Zequiv
// Success
// End defining f
// Success
// End defining transC
// Warning: k,n,l,B,minval,j,transC, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining ZequivC
// Warning: n,Zequiv,d,L,f,T,ZequivC, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining elem
============== restarted ===============
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Total time 0.03
PASS: chk_fhan3
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: a, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Success
// Success
// Success
// Success
// Success
// Success
// Success
// Success
// End defining T
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
// Time 0.04
// Time 0
// Time 0
// Time 0
// Time 0
0
0
0
0
0
0
0
0
0
// Time 0.06
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
0
0
0
0
// Time 0.09
// Time 0.01
// Time 0
// Time 0
// Time 0
0
// Time 0.11
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.05
// Time 0.16
// Time 0.23
// Time 0.17
// Time 0
// Time 0
// Time 0
// Time 0.03
// Time 0.31
// Time 0.2
// Time 0.2
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0

Evaluation time: 0.62
// Time 0.62
// Time 0.22

Evaluation time: 0.41
// Time 0.41
// Time 0.27
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0

Evaluation time: 0.42
// Time 0.42
// Time 0
// Time 0.01
// Time 0

Evaluation time: 1.32
// Time 1.32
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Total time 4.98
PASS: chk_fhan4
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: j, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining extr
// Warning: a, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Success
// End defining monpolyfaddeev
// Success
// Warning: P,x,k, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining cf
// Warning: a, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.08
// Time 0
// Time 0
// Time 0
// Time 0.07
// Time 0
// Time 0
// Time 0
// Time 0.08
// Time 0
// Time 0
// Time 0.26
// GCD eval dimension 24 580000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 20 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]20 
Find_good_eval 580000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 580000 0
Gb= 580000 0
Find_good_eval 580000 [-46,-28,-28,23,-26,-46,-87,88,6,-16,14,69,71,-78,-74,81,-27,-87,81,-88,51,-8,68]
Fb= 580000 %%%{-23,[1]%%%}+%%%{-11755,[0]%%%}
Gb= 580000 %%%{-23,[1]%%%}+%%%{-11755,[0]%%%}
FOUND good eval580000 [-46,-28,-28,23,-26,-46,-87,88,6,-16,14,69,71,-78,-74,81,-27,-87,81,-88,51,-8,68]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 580000
lgcd(p) ok 24 580000
Success p/lgcd(p) as gcd 24 580000
// GCD eval dimension 24 580000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 580000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 580000 0
Gb= 580000 0
Find_good_eval 580000 [48,-46,-59,-69,84,31,45,-28,99,84,56,-66,92,-31,-63,33,44,93,-37,-20,39,-4,-40]
Fb= 580000 %%%{6850,[1]%%%}+%%%{9927,[0]%%%}
Gb= 580000 %%%{6850,[1]%%%}+%%%{9927,[0]%%%}
FOUND good eval580000 [48,-46,-59,-69,84,31,45,-28,99,84,56,-66,92,-31,-63,33,44,93,-37,-20,39,-4,-40]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 580000
lgcd(p) ok 24 580000
Success p/lgcd(p) as gcd 24 580000
// GCD eval dimension 24 590000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 590000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 590000 0
Gb= 590000 0
Find_good_eval 590000 [0,-59,28,-36,-43,55,-12,-71,-13,-93,-85,-18,93,-22,-43,-7,-3,46,85,31,84,-86,82]
Fb= 590000 %%%{-6702,[1]%%%}+%%%{-5230,[0]%%%}
Gb= 600000 %%%{-6702,[1]%%%}+%%%{-5230,[0]%%%}
FOUND good eval600000 [0,-59,28,-36,-43,55,-12,-71,-13,-93,-85,-18,93,-22,-43,-7,-3,46,85,31,84,-86,82]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 600000
lgcd(p) ok 24 600000
Success p/lgcd(p) as gcd 24 600000
// GCD eval dimension 24 600000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 600000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 600000 0
Gb= 600000 0
Find_good_eval 600000 [-4,-97,-89,55,30,-21,-65,-82,-62,5,7,87,-69,71,-44,44,-43,85,53,42,-95,-25,59]
Fb= 600000 %%%{917,[1]%%%}+%%%{-10729,[0]%%%}
Gb= 600000 %%%{917,[1]%%%}+%%%{-10729,[0]%%%}
FOUND good eval600000 [-4,-97,-89,55,30,-21,-65,-82,-62,5,7,87,-69,71,-44,44,-43,85,53,42,-95,-25,59]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 600000
lgcd(p) ok 24 600000
Success p/lgcd(p) as gcd 24 600000
// GCD eval dimension 24 610000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 610000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 610000 0
Gb= 610000 0
Find_good_eval 610000 [-80,-8,-96,87,35,14,-15,40,39,65,-63,-42,-12,14,51,-33,71,-83,-85,11,52,33,-80]
Fb= 620000 %%%{-6387,[1]%%%}+%%%{2647,[0]%%%}
Gb= 620000 %%%{-6387,[1]%%%}+%%%{2647,[0]%%%}
FOUND good eval620000 [-80,-8,-96,87,35,14,-15,40,39,65,-63,-42,-12,14,51,-33,71,-83,-85,11,52,33,-80]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 620000
lgcd(p) ok 24 620000
Success p/lgcd(p) as gcd 24 620000
// GCD eval dimension 24 620000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 620000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 620000 0
Gb= 620000 0
Find_good_eval 630000 [22,-4,-8,-94,40,-94,51,37,69,48,59,-92,-84,-59,-80,72,21,32,2,-43,-99,-71,16]
Fb= 630000 %%%{1578,[1]%%%}+%%%{-8965,[0]%%%}
Gb= 640000 %%%{1578,[1]%%%}+%%%{-8965,[0]%%%}
FOUND good eval640000 [22,-4,-8,-94,40,-94,51,37,69,48,59,-92,-84,-59,-80,72,21,32,2,-43,-99,-71,16]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 640000
lgcd(p) ok 24 640000
Success p/lgcd(p) as gcd 24 640000
// GCD eval dimension 24 640000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 60 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]60 
Find_good_eval 640000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 640000 0
Gb= 640000 0
Find_good_eval 640000 [19,34,-59,-77,-5,-94,80,-82,44,18,-19,-38,1,49,-57,-23,-97,68,-33,21,-43,-38,-3]
Fb= 640000 %%%{6673,[1]%%%}+%%%{-12122,[0]%%%}
Gb= 640000 %%%{6673,[1]%%%}+%%%{-12122,[0]%%%}
FOUND good eval640000 [19,34,-59,-77,-5,-94,80,-82,44,18,-19,-38,1,49,-57,-23,-97,68,-33,21,-43,-38,-3]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 640000
lgcd(p) ok 24 640000
Success p/lgcd(p) as gcd 24 640000
// GCD eval dimension 24 650000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 650000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 650000 0
Gb= 650000 0
Find_good_eval 650000 [-4,-83,-8,-38,29,40,-81,-28,-37,-94,39,18,24,-58,14,-99,-66,65,-98,-18,-81,22,73]
Fb= 650000 %%%{9094,[1]%%%}+%%%{-7855,[0]%%%}
Gb= 660000 %%%{9094,[1]%%%}+%%%{-7855,[0]%%%}
FOUND good eval660000 [-4,-83,-8,-38,29,40,-81,-28,-37,-94,39,18,24,-58,14,-99,-66,65,-98,-18,-81,22,73]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 660000
lgcd(p) ok 24 660000
Success p/lgcd(p) as gcd 24 660000
// GCD eval dimension 24 670000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 670000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 670000 0
Gb= 670000 0
Find_good_eval 670000 [-68,35,49,-5,-70,89,-23,-48,-96,98,-57,-10,75,-30,0,-82,36,86,-68,-66,-39,-82,10]
Fb= 670000 %%%{-11911,[1]%%%}+%%%{13056,[0]%%%}
Gb= 680000 %%%{-11911,[1]%%%}+%%%{13056,[0]%%%}
FOUND good eval680000 [-68,35,49,-5,-70,89,-23,-48,-96,98,-57,-10,75,-30,0,-82,36,86,-68,-66,-39,-82,10]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 680000
lgcd(p) ok 24 680000
Success p/lgcd(p) as gcd 24 680000
// GCD eval dimension 24 690000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 690000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 690000 0
Gb= 690000 0
Find_good_eval 690000 [-37,-59,-45,5,-37,2,-99,37,21,-92,94,-89,-86,21,48,-16,13,80,82,-92,-95,41,-73]
Fb= 690000 %%%{-11736,[1]%%%}+%%%{7015,[0]%%%}
Gb= 700000 %%%{-11736,[1]%%%}+%%%{7015,[0]%%%}
FOUND good eval700000 [-37,-59,-45,5,-37,2,-99,37,21,-92,94,-89,-86,21,48,-16,13,80,82,-92,-95,41,-73]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 700000
lgcd(p) ok 24 700000
Success p/lgcd(p) as gcd 24 700000
// GCD eval dimension 24 710000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 710000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 710000 0
Gb= 710000 0
Find_good_eval 710000 [66,-69,45,-8,-97,-5,28,-60,33,-15,27,-3,-76,-17,63,68,98,0,-13,43,61,-9,-88]
Fb= 710000 %%%{10283,[1]%%%}+%%%{-5653,[0]%%%}
Gb= 720000 %%%{10283,[1]%%%}+%%%{-5653,[0]%%%}
FOUND good eval720000 [66,-69,45,-8,-97,-5,28,-60,33,-15,27,-3,-76,-17,63,68,98,0,-13,43,61,-9,-88]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 720000
lgcd(p) ok 24 720000
Success p/lgcd(p) as gcd 24 720000
// GCD eval dimension 24 730000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 730000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 730000 0
Gb= 730000 0
Find_good_eval 730000 [87,61,-69,66,23,-29,45,75,-8,42,-53,11,92,-14,53,-57,-4,26,87,-13,-55,-49,-79]
Fb= 730000 %%%{-10525,[1]%%%}+%%%{572,[0]%%%}
Gb= 730000 %%%{-10525,[1]%%%}+%%%{572,[0]%%%}
FOUND good eval730000 [87,61,-69,66,23,-29,45,75,-8,42,-53,11,92,-14,53,-57,-4,26,87,-13,-55,-49,-79]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 730000
lgcd(p) ok 24 730000
Success p/lgcd(p) as gcd 24 730000
// GCD eval dimension 24 730000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 730000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 730000 0
Gb= 730000 0
Find_good_eval 730000 [-6,-51,-78,-82,50,8,69,78,64,18,27,83,-2,-75,-19,7,50,-46,43,-42,76,60,-73]
Fb= 740000 %%%{2953,[1]%%%}+%%%{-11090,[0]%%%}
Gb= 740000 %%%{2953,[1]%%%}+%%%{-11090,[0]%%%}
FOUND good eval750000 [-6,-51,-78,-82,50,8,69,78,64,18,27,83,-2,-75,-19,7,50,-46,43,-42,76,60,-73]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 750000
lgcd(p) ok 24 750000
Success p/lgcd(p) as gcd 24 750000
// GCD eval dimension 24 750000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 750000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 750000 0
Gb= 750000 0
Find_good_eval 750000 [63,82,97,51,90,-12,-41,-81,21,16,18,19,-89,34,-93,-53,-33,-40,7,54,67,-71,-42]
Fb= 750000 %%%{-11707,[1]%%%}+%%%{-14686,[0]%%%}
Gb= 750000 %%%{-11707,[1]%%%}+%%%{-14686,[0]%%%}
FOUND good eval750000 [63,82,97,51,90,-12,-41,-81,21,16,18,19,-89,34,-93,-53,-33,-40,7,54,67,-71,-42]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 750000
lgcd(p) ok 24 750000
Success p/lgcd(p) as gcd 24 750000
// GCD eval dimension 24 750000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 750000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 750000 0
Gb= 750000 0
Find_good_eval 750000 [62,-85,-13,-75,-80,68,64,80,3,-29,-86,-64,-23,17,-43,94,72,-48,62,70,80,-46,-16]
Fb= 760000 %%%{371,[1]%%%}+%%%{-4481,[0]%%%}
Gb= 760000 %%%{371,[1]%%%}+%%%{-4481,[0]%%%}
FOUND good eval760000 [62,-85,-13,-75,-80,68,64,80,3,-29,-86,-64,-23,17,-43,94,72,-48,62,70,80,-46,-16]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 760000
lgcd(p) ok 24 760000
Success p/lgcd(p) as gcd 24 760000
// GCD eval dimension 24 760000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 760000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 760000 0
Gb= 760000 0
Find_good_eval 760000 [-32,-64,-40,-89,-64,-67,82,58,-17,68,-27,-68,67,-84,-72,80,-90,-5,-92,-2,-27,61,-35]
Fb= 770000 %%%{-6013,[1]%%%}+%%%{-9995,[0]%%%}
Gb= 770000 %%%{-6013,[1]%%%}+%%%{-9995,[0]%%%}
FOUND good eval770000 [-32,-64,-40,-89,-64,-67,82,58,-17,68,-27,-68,67,-84,-72,80,-90,-5,-92,-2,-27,61,-35]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 770000
lgcd(p) ok 24 770000
Success p/lgcd(p) as gcd 24 770000
// GCD eval dimension 24 770000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 770000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 770000 0
Gb= 770000 0
Find_good_eval 770000 [-54,21,-9,-22,-51,55,-32,74,26,-27,-84,97,36,2,-2,5,9,39,-82,75,88,14,-90]
Fb= 780000 %%%{-11418,[1]%%%}+%%%{-5261,[0]%%%}
Gb= 790000 %%%{-11418,[1]%%%}+%%%{-5261,[0]%%%}
FOUND good eval790000 [-54,21,-9,-22,-51,55,-32,74,26,-27,-84,97,36,2,-2,5,9,39,-82,75,88,14,-90]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 790000
lgcd(p) ok 24 790000
Success p/lgcd(p) as gcd 24 790000
// GCD eval dimension 24 790000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 790000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 790000 0
Gb= 790000 0
Find_good_eval 790000 [-50,-96,-85,-8,94,22,-15,-63,77,3,57,80,-1,-32,-18,-85,96,54,-51,12,21,-89,-80]
Fb= 790000 %%%{5676,[1]%%%}+%%%{694,[0]%%%}
Gb= 790000 %%%{5676,[1]%%%}+%%%{694,[0]%%%}
FOUND good eval790000 [-50,-96,-85,-8,94,22,-15,-63,77,3,57,80,-1,-32,-18,-85,96,54,-51,12,21,-89,-80]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 790000
lgcd(p) ok 24 790000
Success p/lgcd(p) as gcd 24 790000
// GCD eval dimension 24 790000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 790000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 790000 0
Gb= 790000 0
Find_good_eval 790000 [63,-32,84,-94,-8,-28,-90,-93,72,-28,-28,68,-18,95,-20,-31,68,-24,87,84,-84,46,11]
Fb= 800000 %%%{6583,[1]%%%}+%%%{-4511,[0]%%%}
Gb= 800000 %%%{6583,[1]%%%}+%%%{-4511,[0]%%%}
FOUND good eval800000 [63,-32,84,-94,-8,-28,-90,-93,72,-28,-28,68,-18,95,-20,-31,68,-24,87,84,-84,46,11]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 800000
lgcd(p) ok 24 800000
Success p/lgcd(p) as gcd 24 800000
// GCD eval dimension 24 810000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 20 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]20 
Find_good_eval 810000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 810000 0
Gb= 810000 0
Find_good_eval 810000 [48,-45,-70,40,46,-2,-41,-57,61,-67,8,81,72,-20,50,35,-72,77,8,-25,95,-7,-63]
Fb= 810000 %%%{-40,[1]%%%}+%%%{-14137,[0]%%%}
Gb= 810000 %%%{-40,[1]%%%}+%%%{-14137,[0]%%%}
FOUND good eval810000 [48,-45,-70,40,46,-2,-41,-57,61,-67,8,81,72,-20,50,35,-72,77,8,-25,95,-7,-63]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 810000
lgcd(p) ok 24 810000
Success p/lgcd(p) as gcd 24 810000
// GCD eval dimension 24 810000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 810000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 810000 0
Gb= 810000 0
Find_good_eval 810000 [-70,50,16,66,-57,81,-94,-77,-3,-27,76,31,81,-69,98,-48,-6,49,15,-14,48,-33,26]
Fb= 810000 %%%{-1248,[1]%%%}+%%%{4890,[0]%%%}
Gb= 810000 %%%{-1248,[1]%%%}+%%%{4890,[0]%%%}
FOUND good eval810000 [-70,50,16,66,-57,81,-94,-77,-3,-27,76,31,81,-69,98,-48,-6,49,15,-14,48,-33,26]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 810000
lgcd(p) ok 24 810000
Success p/lgcd(p) as gcd 24 810000
// GCD eval dimension 24 820000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 820000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 820000 0
Gb= 820000 0
Find_good_eval 820000 [75,96,54,28,-69,58,-7,46,35,-42,-25,-34,-76,17,78,-19,62,-75,67,92,-54,42,68]
Fb= 820000 %%%{2053,[1]%%%}+%%%{6353,[0]%%%}
Gb= 820000 %%%{2053,[1]%%%}+%%%{6353,[0]%%%}
FOUND good eval820000 [75,96,54,28,-69,58,-7,46,35,-42,-25,-34,-76,17,78,-19,62,-75,67,92,-54,42,68]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 820000
lgcd(p) ok 24 820000
Success p/lgcd(p) as gcd 24 820000
// GCD eval dimension 24 820000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 820000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 820000 0
Gb= 820000 0
Find_good_eval 820000 [61,39,-23,-40,42,54,9,27,-77,-62,-15,72,95,-97,71,-64,68,-41,89,39,56,71,0]
Fb= 820000 %%%{-4758,[1]%%%}+%%%{-14613,[0]%%%}
Gb= 820000 %%%{-4758,[1]%%%}+%%%{-14613,[0]%%%}
FOUND good eval820000 [61,39,-23,-40,42,54,9,27,-77,-62,-15,72,95,-97,71,-64,68,-41,89,39,56,71,0]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 820000
lgcd(p) ok 24 820000
Success p/lgcd(p) as gcd 24 820000
// GCD eval dimension 24 830000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 830000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 830000 0
Gb= 830000 0
Find_good_eval 830000 [55,63,97,-34,-78,50,-12,0,62,-54,3,0,9,-25,33,-62,73,-74,-68,-39,4,-76,-97]
Fb= 830000 %%%{2782,[1]%%%}+%%%{-14117,[0]%%%}
Gb= 830000 %%%{2782,[1]%%%}+%%%{-14117,[0]%%%}
FOUND good eval830000 [55,63,97,-34,-78,50,-12,0,62,-54,3,0,9,-25,33,-62,73,-74,-68,-39,4,-76,-97]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 830000
lgcd(p) ok 24 830000
Success p/lgcd(p) as gcd 24 830000
// GCD eval dimension 24 830000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 830000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 830000 0
Gb= 830000 0
Find_good_eval 830000 [-77,56,-78,38,-64,-74,69,15,-93,79,-19,50,-98,42,-37,12,-3,10,93,-32,-68,14,4]
Fb= 840000 %%%{1243,[1]%%%}+%%%{-7256,[0]%%%}
Gb= 840000 %%%{1243,[1]%%%}+%%%{-7256,[0]%%%}
FOUND good eval840000 [-77,56,-78,38,-64,-74,69,15,-93,79,-19,50,-98,42,-37,12,-3,10,93,-32,-68,14,4]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 840000
lgcd(p) ok 24 840000
Success p/lgcd(p) as gcd 24 840000
// GCD eval dimension 24 840000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 60 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]60 
Find_good_eval 840000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 840000 0
Gb= 840000 0
Find_good_eval 840000 [-60,-34,-14,-23,-93,-4,-92,-33,-84,33,70,20,-38,-64,43,12,52,-61,-23,67,97,57,86]
Fb= 840000 %%%{-11767,[1]%%%}+%%%{2369,[0]%%%}
Gb= 840000 %%%{-11767,[1]%%%}+%%%{2369,[0]%%%}
FOUND good eval840000 [-60,-34,-14,-23,-93,-4,-92,-33,-84,33,70,20,-38,-64,43,12,52,-61,-23,67,97,57,86]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 840000
lgcd(p) ok 24 840000
Success p/lgcd(p) as gcd 24 840000
// GCD eval dimension 24 840000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 840000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 840000 0
Gb= 840000 0
Find_good_eval 840000 [-97,89,54,-99,11,54,7,-13,-67,8,-61,-60,56,-86,-41,-79,31,36,-52,-13,-65,17,-27]
Fb= 840000 %%%{5881,[1]%%%}+%%%{11955,[0]%%%}
Gb= 840000 %%%{5881,[1]%%%}+%%%{11955,[0]%%%}
FOUND good eval840000 [-97,89,54,-99,11,54,7,-13,-67,8,-61,-60,56,-86,-41,-79,31,36,-52,-13,-65,17,-27]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 840000
lgcd(p) ok 24 840000
Success p/lgcd(p) as gcd 24 840000
// GCD eval dimension 24 850000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 850000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 850000 0
Gb= 850000 0
Find_good_eval 850000 [-7,24,49,-35,-31,25,-43,49,-44,-78,8,-49,59,29,60,-53,7,42,-17,82,-35,-69,-53]
Fb= 850000 %%%{-3818,[1]%%%}+%%%{-12009,[0]%%%}
Gb= 860000 %%%{-3818,[1]%%%}+%%%{-12009,[0]%%%}
FOUND good eval860000 [-7,24,49,-35,-31,25,-43,49,-44,-78,8,-49,59,29,60,-53,7,42,-17,82,-35,-69,-53]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 860000
lgcd(p) ok 24 860000
Success p/lgcd(p) as gcd 24 860000
// GCD eval dimension 24 860000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 860000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 860000 0
Gb= 860000 0
Find_good_eval 860000 [-95,-11,23,82,-86,95,-13,5,79,-51,94,84,-69,-65,46,-72,90,-39,32,-49,78,38,50]
Fb= 860000 %%%{7416,[1]%%%}+%%%{-3379,[0]%%%}
Gb= 860000 %%%{7416,[1]%%%}+%%%{-3379,[0]%%%}
FOUND good eval860000 [-95,-11,23,82,-86,95,-13,5,79,-51,94,84,-69,-65,46,-72,90,-39,32,-49,78,38,50]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 860000
lgcd(p) ok 24 860000
Success p/lgcd(p) as gcd 24 860000
// GCD eval dimension 24 860000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 860000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 860000 0
Gb= 860000 0
Find_good_eval 860000 [24,-50,18,55,71,-12,-8,-78,-65,14,63,-94,18,20,-21,-99,4,-52,-28,-39,-6,-32,-10]
Fb= 860000 %%%{14506,[1]%%%}+%%%{-13676,[0]%%%}
Gb= 870000 %%%{14506,[1]%%%}+%%%{-13676,[0]%%%}
FOUND good eval870000 [24,-50,18,55,71,-12,-8,-78,-65,14,63,-94,18,20,-21,-99,4,-52,-28,-39,-6,-32,-10]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 870000
lgcd(p) ok 24 870000
Success p/lgcd(p) as gcd 24 870000
// GCD eval dimension 24 870000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 870000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 870000 0
Gb= 870000 0
Find_good_eval 870000 [-87,-23,-67,73,-9,51,-41,-23,70,15,8,57,93,-93,39,-19,-77,-87,-69,88,41,-2,-81]
Fb= 870000 %%%{728,[1]%%%}+%%%{8301,[0]%%%}
Gb= 880000 %%%{728,[1]%%%}+%%%{8301,[0]%%%}
FOUND good eval880000 [-87,-23,-67,73,-9,51,-41,-23,70,15,8,57,93,-93,39,-19,-77,-87,-69,88,41,-2,-81]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 880000
lgcd(p) ok 24 880000
Success p/lgcd(p) as gcd 24 880000
// GCD eval dimension 24 880000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 880000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 880000 0
Gb= 880000 0
Find_good_eval 880000 [85,32,-53,-85,20,90,-58,-64,-88,18,79,17,-13,13,-69,-86,71,76,0,-78,61,-49,-62]
Fb= 880000 %%%{-4939,[1]%%%}+%%%{12706,[0]%%%}
Gb= 880000 %%%{-4939,[1]%%%}+%%%{12706,[0]%%%}
FOUND good eval880000 [85,32,-53,-85,20,90,-58,-64,-88,18,79,17,-13,13,-69,-86,71,76,0,-78,61,-49,-62]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 880000
lgcd(p) ok 24 880000
Success p/lgcd(p) as gcd 24 880000
// GCD eval dimension 24 880000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 880000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 880000 0
Gb= 880000 0
Find_good_eval 880000 [12,65,79,76,-22,-78,-30,97,64,-43,20,53,-89,71,7,-73,-58,-70,57,37,-61,-22,57]
Fb= 880000 %%%{-13623,[1]%%%}+%%%{4258,[0]%%%}
Gb= 890000 %%%{-13623,[1]%%%}+%%%{4258,[0]%%%}
FOUND good eval890000 [12,65,79,76,-22,-78,-30,97,64,-43,20,53,-89,71,7,-73,-58,-70,57,37,-61,-22,57]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 890000
lgcd(p) ok 24 890000
Success p/lgcd(p) as gcd 24 890000
// GCD eval dimension 24 890000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 890000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 890000 0
Gb= 890000 0
Find_good_eval 890000 [50,43,-36,-32,3,88,-74,-94,23,92,0,76,44,-85,-25,64,51,25,75,12,-99,94,-57]
Fb= 890000 %%%{12801,[1]%%%}+%%%{-1766,[0]%%%}
Gb= 890000 %%%{12801,[1]%%%}+%%%{-1766,[0]%%%}
FOUND good eval890000 [50,43,-36,-32,3,88,-74,-94,23,92,0,76,44,-85,-25,64,51,25,75,12,-99,94,-57]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 890000
lgcd(p) ok 24 890000
Success p/lgcd(p) as gcd 24 890000
// GCD eval dimension 24 890000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 890000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 890000 0
Gb= 890000 0
Find_good_eval 890000 [-86,40,31,-26,-84,-55,-74,42,0,-14,70,-81,-89,37,16,-50,23,-47,-14,18,-93,-28,95]
Fb= 900000 %%%{5657,[1]%%%}+%%%{-12859,[0]%%%}
Gb= 910000 %%%{5657,[1]%%%}+%%%{-12859,[0]%%%}
FOUND good eval910000 [-86,40,31,-26,-84,-55,-74,42,0,-14,70,-81,-89,37,16,-50,23,-47,-14,18,-93,-28,95]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 910000
lgcd(p) ok 24 910000
Success p/lgcd(p) as gcd 24 910000
// GCD eval dimension 24 910000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 910000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 910000 0
Gb= 910000 0
Find_good_eval 910000 [-82,-60,-43,-20,-96,77,-70,35,-57,87,93,2,14,79,-47,50,30,-76,-82,8,88,-40,-87]
Fb= 910000 %%%{-6995,[1]%%%}+%%%{3192,[0]%%%}
Gb= 910000 %%%{-6995,[1]%%%}+%%%{3192,[0]%%%}
FOUND good eval910000 [-82,-60,-43,-20,-96,77,-70,35,-57,87,93,2,14,79,-47,50,30,-76,-82,8,88,-40,-87]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 910000
lgcd(p) ok 24 910000
Success p/lgcd(p) as gcd 24 910000
// GCD eval dimension 24 910000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 910000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 910000 0
Gb= 910000 0
Find_good_eval 910000 [-55,-27,-89,86,50,56,89,-60,10,-57,-61,0,-21,-92,62,-92,93,-61,-21,-92,7,-19,17]
Fb= 910000 %%%{8882,[1]%%%}+%%%{-11095,[0]%%%}
Gb= 910000 %%%{8882,[1]%%%}+%%%{-11095,[0]%%%}
FOUND good eval910000 [-55,-27,-89,86,50,56,89,-60,10,-57,-61,0,-21,-92,62,-92,93,-61,-21,-92,7,-19,17]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 910000
lgcd(p) ok 24 910000
Success p/lgcd(p) as gcd 24 910000
// GCD eval dimension 24 910000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 910000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 910000 0
Gb= 910000 0
Find_good_eval 910000 [-28,83,-16,58,-92,72,-48,-6,44,-75,-96,91,57,-50,-31,55,84,-84,-4,9,-11,82,-22]
Fb= 910000 %%%{-13043,[1]%%%}+%%%{-8245,[0]%%%}
Gb= 920000 %%%{-13043,[1]%%%}+%%%{-8245,[0]%%%}
FOUND good eval920000 [-28,83,-16,58,-92,72,-48,-6,44,-75,-96,91,57,-50,-31,55,84,-84,-4,9,-11,82,-22]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 920000
lgcd(p) ok 24 920000
Success p/lgcd(p) as gcd 24 920000
// GCD eval dimension 24 920000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 20 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]20 
Find_good_eval 920000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 920000 0
Gb= 920000 0
Find_good_eval 920000 [31,-81,-37,16,20,-15,40,-13,7,-47,-89,-87,-6,26,-26,90,62,-68,52,-61,55,94,-78]
Fb= 930000 %%%{-16,[1]%%%}+%%%{12480,[0]%%%}
Gb= 930000 %%%{-16,[1]%%%}+%%%{12480,[0]%%%}
FOUND good eval930000 [31,-81,-37,16,20,-15,40,-13,7,-47,-89,-87,-6,26,-26,90,62,-68,52,-61,55,94,-78]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 930000
lgcd(p) ok 24 930000
Success p/lgcd(p) as gcd 24 930000
// GCD eval dimension 24 930000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 930000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 930000 0
Gb= 930000 0
Find_good_eval 930000 [-65,-97,-19,76,-42,49,-69,-25,-21,13,-13,56,89,-72,82,-14,-98,-11,29,-45,30,-56,56]
Fb= 930000 %%%{7394,[1]%%%}+%%%{-6833,[0]%%%}
Gb= 930000 %%%{7394,[1]%%%}+%%%{-6833,[0]%%%}
FOUND good eval930000 [-65,-97,-19,76,-42,49,-69,-25,-21,13,-13,56,89,-72,82,-14,-98,-11,29,-45,30,-56,56]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 930000
lgcd(p) ok 24 930000
Success p/lgcd(p) as gcd 24 930000
// GCD eval dimension 24 930000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 930000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 930000 0
Gb= 930000 0
Find_good_eval 930000 [16,-43,-10,-33,51,16,-21,-39,85,-19,70,88,97,-76,47,40,-59,-79,93,-55,-66,34,76]
Fb= 930000 %%%{2200,[1]%%%}+%%%{-7621,[0]%%%}
Gb= 930000 %%%{2200,[1]%%%}+%%%{-7621,[0]%%%}
FOUND good eval930000 [16,-43,-10,-33,51,16,-21,-39,85,-19,70,88,97,-76,47,40,-59,-79,93,-55,-66,34,76]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 930000
lgcd(p) ok 24 930000
Success p/lgcd(p) as gcd 24 930000
// GCD eval dimension 24 940000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 940000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 940000 0
Gb= 940000 0
Find_good_eval 940000 [-40,-71,-78,84,2,-1,-23,60,84,29,-82,14,84,48,-24,58,43,-33,-15,-98,-4,85,-39]
Fb= 940000 %%%{6804,[1]%%%}+%%%{-1677,[0]%%%}
Gb= 940000 %%%{6804,[1]%%%}+%%%{-1677,[0]%%%}
FOUND good eval940000 [-40,-71,-78,84,2,-1,-23,60,84,29,-82,14,84,48,-24,58,43,-33,-15,-98,-4,85,-39]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 940000
lgcd(p) ok 24 940000
Success p/lgcd(p) as gcd 24 940000
// GCD eval dimension 24 940000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 940000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 940000 0
Gb= 940000 0
Find_good_eval 940000 [63,55,25,-89,3,22,74,94,29,24,18,96,-45,-16,-98,-8,51,17,-10,52,-87,27,-43]
Fb= 940000 %%%{3355,[1]%%%}+%%%{-13415,[0]%%%}
Gb= 940000 %%%{3355,[1]%%%}+%%%{-13415,[0]%%%}
FOUND good eval940000 [63,55,25,-89,3,22,74,94,29,24,18,96,-45,-16,-98,-8,51,17,-10,52,-87,27,-43]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 940000
lgcd(p) ok 24 940000
Success p/lgcd(p) as gcd 24 940000
// GCD eval dimension 24 950000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 950000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 950000 0
Gb= 950000 0
Find_good_eval 950000 [74,75,44,49,-28,70,-45,81,-2,46,-37,84,-19,90,-86,54,-89,-65,-81,-38,33,-36,32]
Fb= 950000 %%%{-8129,[1]%%%}+%%%{12131,[0]%%%}
Gb= 950000 %%%{-8129,[1]%%%}+%%%{12131,[0]%%%}
FOUND good eval950000 [74,75,44,49,-28,70,-45,81,-2,46,-37,84,-19,90,-86,54,-89,-65,-81,-38,33,-36,32]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 950000
lgcd(p) ok 24 950000
Success p/lgcd(p) as gcd 24 950000
// GCD eval dimension 24 950000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 60 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]60 
Find_good_eval 950000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 950000 0
Gb= 950000 0
Find_good_eval 950000 [-20,-94,49,-42,53,27,-83,71,-76,-20,-15,-55,-5,-98,-25,-10,-41,-15,27,-75,29,14,-38]
Fb= 950000 %%%{-4051,[1]%%%}+%%%{-5918,[0]%%%}
Gb= 950000 %%%{-4051,[1]%%%}+%%%{-5918,[0]%%%}
FOUND good eval950000 [-20,-94,49,-42,53,27,-83,71,-76,-20,-15,-55,-5,-98,-25,-10,-41,-15,27,-75,29,14,-38]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 950000
lgcd(p) ok 24 950000
Success p/lgcd(p) as gcd 24 950000
// GCD eval dimension 24 960000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 960000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 960000 0
Gb= 960000 0
Find_good_eval 960000 [-26,7,2,-39,-33,47,19,30,-15,-96,66,44,-64,-6,-50,60,98,14,0,-71,74,15,16]
Fb= 960000 %%%{-13789,[1]%%%}+%%%{1461,[0]%%%}
Gb= 960000 %%%{-13789,[1]%%%}+%%%{1461,[0]%%%}
FOUND good eval960000 [-26,7,2,-39,-33,47,19,30,-15,-96,66,44,-64,-6,-50,60,98,14,0,-71,74,15,16]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 960000
lgcd(p) ok 24 960000
Success p/lgcd(p) as gcd 24 960000
// GCD eval dimension 24 960000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 960000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 960000 0
Gb= 960000 0
Find_good_eval 960000 [-73,-26,-95,-41,-48,-38,79,-44,-88,57,94,10,40,97,63,22,94,33,-48,-48,41,89,92]
Fb= 960000 %%%{-787,[1]%%%}+%%%{-392,[0]%%%}
Gb= 960000 %%%{-787,[1]%%%}+%%%{-392,[0]%%%}
FOUND good eval960000 [-73,-26,-95,-41,-48,-38,79,-44,-88,57,94,10,40,97,63,22,94,33,-48,-48,41,89,92]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 960000
lgcd(p) ok 24 960000
Success p/lgcd(p) as gcd 24 960000
// GCD eval dimension 24 970000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 970000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 970000 0
Gb= 970000 0
Find_good_eval 970000 [-65,-45,0,86,-38,85,69,-11,-85,5,-8,58,72,-95,-6,-64,-73,3,9,-29,-98,-9,8]
Fb= 970000 %%%{-11750,[1]%%%}+%%%{-288,[0]%%%}
Gb= 980000 %%%{-11750,[1]%%%}+%%%{-288,[0]%%%}
FOUND good eval980000 [-65,-45,0,86,-38,85,69,-11,-85,5,-8,58,72,-95,-6,-64,-73,3,9,-29,-98,-9,8]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 980000
lgcd(p) ok 24 980000
Success p/lgcd(p) as gcd 24 980000
// GCD eval dimension 24 980000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 980000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 980000 0
Gb= 980000 0
Find_good_eval 980000 [45,-84,-20,-40,-24,90,41,57,93,47,-71,-39,16,-19,78,27,-37,38,9,24,-89,-5,2]
Fb= 980000 %%%{12048,[1]%%%}+%%%{-181,[0]%%%}
Gb= 990000 %%%{12048,[1]%%%}+%%%{-181,[0]%%%}
FOUND good eval990000 [45,-84,-20,-40,-24,90,41,57,93,47,-71,-39,16,-19,78,27,-37,38,9,24,-89,-5,2]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 990000
lgcd(p) ok 24 990000
Success p/lgcd(p) as gcd 24 990000
// GCD eval dimension 24 990000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 990000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 990000 0
Gb= 990000 0
Find_good_eval 990000 [53,57,39,54,-69,54,-63,-56,-37,28,-55,-43,4,-54,-86,3,-42,-4,-72,79,-5,91,-24]
Fb= 990000 %%%{-7921,[1]%%%}+%%%{-10251,[0]%%%}
Gb= 990000 %%%{-7921,[1]%%%}+%%%{-10251,[0]%%%}
FOUND good eval990000 [53,57,39,54,-69,54,-63,-56,-37,28,-55,-43,4,-54,-86,3,-42,-4,-72,79,-5,91,-24]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 990000
lgcd(p) ok 24 990000
Success p/lgcd(p) as gcd 24 990000
// GCD eval dimension 24 990000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 990000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 990000 0
Gb= 990000 0
Find_good_eval 990000 [92,-13,78,60,53,44,-87,-24,-38,-74,97,-47,45,68,-84,-41,-60,23,0,26,99,-63,-95]
Fb= 1000000 %%%{-13966,[1]%%%}+%%%{938,[0]%%%}
Gb= 1010000 %%%{-13966,[1]%%%}+%%%{938,[0]%%%}
FOUND good eval1010000 [92,-13,78,60,53,44,-87,-24,-38,-74,97,-47,45,68,-84,-41,-60,23,0,26,99,-63,-95]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1010000
lgcd(p) ok 24 1010000
Success p/lgcd(p) as gcd 24 1010000
// GCD eval dimension 24 1010000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1010000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1010000 0
Gb= 1010000 0
Find_good_eval 1010000 [-34,25,-68,-35,-35,-69,60,-94,37,-33,49,-81,42,-86,79,64,-45,-89,45,-42,-80,27,81]
Fb= 1010000 %%%{-9939,[1]%%%}+%%%{-11841,[0]%%%}
Gb= 1010000 %%%{-9939,[1]%%%}+%%%{-11841,[0]%%%}
FOUND good eval1010000 [-34,25,-68,-35,-35,-69,60,-94,37,-33,49,-81,42,-86,79,64,-45,-89,45,-42,-80,27,81]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1010000
lgcd(p) ok 24 1010000
Success p/lgcd(p) as gcd 24 1010000
// GCD eval dimension 24 1010000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1010000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1010000 0
Gb= 1010000 0
Find_good_eval 1010000 [81,51,-78,-64,-95,91,-3,-90,-61,-7,12,38,13,16,-22,-26,12,75,-13,95,-49,-44,-49]
Fb= 1010000 %%%{7373,[1]%%%}+%%%{583,[0]%%%}
Gb= 1020000 %%%{7373,[1]%%%}+%%%{583,[0]%%%}
FOUND good eval1020000 [81,51,-78,-64,-95,91,-3,-90,-61,-7,12,38,13,16,-22,-26,12,75,-13,95,-49,-44,-49]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1020000
lgcd(p) ok 24 1020000
Success p/lgcd(p) as gcd 24 1020000
// GCD eval dimension 24 1020000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1020000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1020000 0
Gb= 1020000 0
Find_good_eval 1020000 [-5,53,-96,92,-50,-90,67,-3,24,49,1,57,88,-51,37,-84,-7,-49,-49,46,22,-72,33]
Fb= 1020000 %%%{10171,[1]%%%}+%%%{-3417,[0]%%%}
Gb= 1020000 %%%{10171,[1]%%%}+%%%{-3417,[0]%%%}
FOUND good eval1020000 [-5,53,-96,92,-50,-90,67,-3,24,49,1,57,88,-51,37,-84,-7,-49,-49,46,22,-72,33]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1020000
lgcd(p) ok 24 1020000
Success p/lgcd(p) as gcd 24 1020000
// GCD eval dimension 24 1020000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1020000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1020000 0
Gb= 1020000 0
Find_good_eval 1020000 [49,15,70,-36,-91,-75,-25,-15,66,90,64,-22,5,74,37,-33,-48,91,-81,70,-98,85,83]
Fb= 1020000 %%%{-9965,[1]%%%}+%%%{7121,[0]%%%}
Gb= 1020000 %%%{-9965,[1]%%%}+%%%{7121,[0]%%%}
FOUND good eval1020000 [49,15,70,-36,-91,-75,-25,-15,66,90,64,-22,5,74,37,-33,-48,91,-81,70,-98,85,83]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1020000
lgcd(p) ok 24 1020000
Success p/lgcd(p) as gcd 24 1020000
// GCD eval dimension 24 1020000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1020000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1020000 0
Gb= 1020000 0
Find_good_eval 1020000 [49,-83,-96,-64,-22,-88,93,19,65,69,-99,39,-61,-8,14,-28,49,24,-70,-45,-47,51,-59]
Fb= 1030000 %%%{11616,[1]%%%}+%%%{-859,[0]%%%}
Gb= 1030000 %%%{11616,[1]%%%}+%%%{-859,[0]%%%}
FOUND good eval1030000 [49,-83,-96,-64,-22,-88,93,19,65,69,-99,39,-61,-8,14,-28,49,24,-70,-45,-47,51,-59]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1030000
lgcd(p) ok 24 1030000
Success p/lgcd(p) as gcd 24 1030000
// GCD eval dimension 24 1030000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1030000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1030000 0
Gb= 1030000 0
Find_good_eval 1030000 [0,-73,50,20,-94,-48,-23,-89,-42,-30,58,16,-50,-4,-28,32,-91,56,35,1,-30,-78,85]
Fb= 1030000 %%%{-14840,[1]%%%}+%%%{-475,[0]%%%}
Gb= 1040000 %%%{-14840,[1]%%%}+%%%{-475,[0]%%%}
FOUND good eval1040000 [0,-73,50,20,-94,-48,-23,-89,-42,-30,58,16,-50,-4,-28,32,-91,56,35,1,-30,-78,85]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1040000
lgcd(p) ok 24 1040000
Success p/lgcd(p) as gcd 24 1040000
// GCD eval dimension 24 1040000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 16 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]16 
Find_good_eval 1040000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1040000 0
Gb= 1040000 0
Find_good_eval 1040000 [-49,48,69,-82,41,84,-57,15,-4,-88,93,15,-1,4,0,-19,78,49,-44,44,-44,80,33]
Fb= 1040000 %%%{82,[1]%%%}+%%%{-3049,[0]%%%}
Gb= 1040000 %%%{82,[1]%%%}+%%%{-3049,[0]%%%}
FOUND good eval1040000 [-49,48,69,-82,41,84,-57,15,-4,-88,93,15,-1,4,0,-19,78,49,-44,44,-44,80,33]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1040000
lgcd(p) ok 24 1040000
Success p/lgcd(p) as gcd 24 1040000
// GCD eval dimension 24 1040000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 24 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]24 
Find_good_eval 1040000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1040000 0
Gb= 1040000 0
Find_good_eval 1040000 [25,-54,27,57,58,85,38,55,87,-94,75,53,9,-87,-86,91,82,30,-37,-29,19,-70,78]
Fb= 1040000 %%%{-11341,[1]%%%}+%%%{-6105,[0]%%%}
Gb= 1040000 %%%{-11341,[1]%%%}+%%%{-6105,[0]%%%}
FOUND good eval1040000 [25,-54,27,57,58,85,38,55,87,-94,75,53,9,-87,-86,91,82,30,-37,-29,19,-70,78]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1040000
lgcd(p) ok 24 1040000
Success p/lgcd(p) as gcd 24 1040000
// GCD eval dimension 24 1040000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 30 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]30 
Find_good_eval 1040000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1040000 0
Gb= 1040000 0
Find_good_eval 1040000 [44,-2,-14,-11,93,83,-12,-82,91,-31,27,-62,4,97,-53,-62,-27,-10,6,80,-22,22,-65]
Fb= 1040000 %%%{5182,[1]%%%}+%%%{-3811,[0]%%%}
Gb= 1050000 %%%{5182,[1]%%%}+%%%{-3811,[0]%%%}
FOUND good eval1050000 [44,-2,-14,-11,93,83,-12,-82,91,-31,27,-62,4,97,-53,-62,-27,-10,6,80,-22,22,-65]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1050000
lgcd(p) ok 24 1050000
Success p/lgcd(p) as gcd 24 1050000
// GCD eval dimension 24 1060000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 30 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]30 
Find_good_eval 1060000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1060000 0
Gb= 1060000 0
Find_good_eval 1060000 [21,30,48,46,84,95,57,-98,33,-5,2,44,99,17,-66,-43,34,-23,-59,58,-83,-37,-74]
Fb= 1060000 %%%{3043,[1]%%%}+%%%{5573,[0]%%%}
Gb= 1060000 %%%{3043,[1]%%%}+%%%{5573,[0]%%%}
FOUND good eval1060000 [21,30,48,46,84,95,57,-98,33,-5,2,44,99,17,-66,-43,34,-23,-59,58,-83,-37,-74]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1060000
lgcd(p) ok 24 1060000
Success p/lgcd(p) as gcd 24 1060000
// GCD eval dimension 24 1060000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 30 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]30 
Find_good_eval 1060000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1060000 0
Gb= 1060000 0
Find_good_eval 1060000 [-37,3,-46,-12,11,-19,30,42,7,60,-44,-15,23,36,-92,2,-69,14,-61,-92,88,73,-29]
Fb= 1070000 %%%{252,[1]%%%}+%%%{7571,[0]%%%}
Gb= 1070000 %%%{252,[1]%%%}+%%%{7571,[0]%%%}
FOUND good eval1070000 [-37,3,-46,-12,11,-19,30,42,7,60,-44,-15,23,36,-92,2,-69,14,-61,-92,88,73,-29]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1070000
lgcd(p) ok 24 1070000
Success p/lgcd(p) as gcd 24 1070000
// GCD eval dimension 24 1070000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 30 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]30 
Find_good_eval 1070000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1070000 0
Gb= 1070000 0
Find_good_eval 1070000 [-10,65,-84,-77,-2,32,74,99,6,-72,44,14,-67,-48,-80,35,63,-29,-10,9,41,-94,70]
Fb= 1070000 %%%{4400,[1]%%%}+%%%{-9733,[0]%%%}
Gb= 1070000 %%%{4400,[1]%%%}+%%%{-9733,[0]%%%}
FOUND good eval1070000 [-10,65,-84,-77,-2,32,74,99,6,-72,44,14,-67,-48,-80,35,63,-29,-10,9,41,-94,70]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1070000
lgcd(p) ok 24 1070000
Success p/lgcd(p) as gcd 24 1070000
// GCD eval dimension 24 1070000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 48 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]48 
Find_good_eval 1070000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1070000 0
Gb= 1070000 0
Find_good_eval 1070000 [70,-88,65,75,-14,10,21,82,66,19,41,93,27,-78,66,-37,59,-67,22,92,95,4,-57]
Fb= 1070000 %%%{2399,[1]%%%}+%%%{4197,[0]%%%}
Gb= 1070000 %%%{2399,[1]%%%}+%%%{4197,[0]%%%}
FOUND good eval1070000 [70,-88,65,75,-14,10,21,82,66,19,41,93,27,-78,66,-37,59,-67,22,92,95,4,-57]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1070000
lgcd(p) ok 24 1070000
Success p/lgcd(p) as gcd 24 1070000
// GCD eval dimension 24 1070000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 72 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]72 
Find_good_eval 1070000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1070000 0
Gb= 1070000 0
Find_good_eval 1070000 [81,-14,96,-52,-58,-49,55,69,0,85,52,13,68,-47,17,59,25,-24,-82,-46,26,-89,60]
Fb= 1070000 %%%{9773,[1]%%%}+%%%{-9108,[0]%%%}
Gb= 1070000 %%%{9773,[1]%%%}+%%%{-9108,[0]%%%}
FOUND good eval1070000 [81,-14,96,-52,-58,-49,55,69,0,85,52,13,68,-47,17,59,25,-24,-82,-46,26,-89,60]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1070000
lgcd(p) ok 24 1070000
Success p/lgcd(p) as gcd 24 1070000
// GCD eval dimension 24 1080000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 78 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]78 
Find_good_eval 1080000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1080000 0
Gb= 1080000 0
Find_good_eval 1080000 [69,79,5,23,-64,26,44,-99,-48,-69,-17,1,7,-39,21,-89,-89,-55,35,-26,92,-15,-65]
Fb= 1090000 %%%{9250,[1]%%%}+%%%{-10131,[0]%%%}
Gb= 1090000 %%%{9250,[1]%%%}+%%%{-10131,[0]%%%}
FOUND good eval1090000 [69,79,5,23,-64,26,44,-99,-48,-69,-17,1,7,-39,21,-89,-89,-55,35,-26,92,-15,-65]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1090000
lgcd(p) ok 24 1090000
Success p/lgcd(p) as gcd 24 1090000
// GCD eval dimension 24 1090000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 78 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]78 
Find_good_eval 1090000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1090000 0
Gb= 1090000 0
Find_good_eval 1090000 [36,55,-71,61,49,56,-33,37,-48,4,23,56,-45,8,6,59,-47,-56,-69,-10,-77,36,89]
Fb= 1100000 %%%{12792,[1]%%%}+%%%{-2332,[0]%%%}
Gb= 1100000 %%%{12792,[1]%%%}+%%%{-2332,[0]%%%}
FOUND good eval1100000 [36,55,-71,61,49,56,-33,37,-48,4,23,56,-45,8,6,59,-47,-56,-69,-10,-77,36,89]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1100000
lgcd(p) ok 24 1100000
Success p/lgcd(p) as gcd 24 1100000
// GCD eval dimension 24 1100000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 78 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]78 
Find_good_eval 1100000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1100000 0
Gb= 1100000 0
Find_good_eval 1100000 [45,-14,73,74,-45,24,71,75,24,38,32,-43,-92,-4,-90,2,58,56,0,-92,-11,-4,-25]
Fb= 1100000 %%%{289,[1]%%%}+%%%{8580,[0]%%%}
Gb= 1100000 %%%{289,[1]%%%}+%%%{8580,[0]%%%}
FOUND good eval1100000 [45,-14,73,74,-45,24,71,75,24,38,32,-43,-92,-4,-90,2,58,56,0,-92,-11,-4,-25]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1100000
lgcd(p) ok 24 1100000
Success p/lgcd(p) as gcd 24 1100000
// GCD eval dimension 24 1110000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 78 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]78 
Find_good_eval 1110000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1110000 0
Gb= 1110000 0
Find_good_eval 1110000 [-66,-27,76,-93,-31,-77,7,31,-74,-9,-14,80,1,-20,59,-2,-50,49,-47,-57,-82,92,82]
Fb= 1110000 %%%{-10932,[1]%%%}+%%%{3988,[0]%%%}
Gb= 1110000 %%%{-10932,[1]%%%}+%%%{3988,[0]%%%}
FOUND good eval1110000 [-66,-27,76,-93,-31,-77,7,31,-74,-9,-14,80,1,-20,59,-2,-50,49,-47,-57,-82,92,82]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1110000
lgcd(p) ok 24 1110000
Success p/lgcd(p) as gcd 24 1110000
// GCD eval dimension 24 1110000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1110000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1110000 0
Gb= 1110000 0
Find_good_eval 1110000 [67,36,94,-20,25,51,-67,-76,62,-43,-19,24,-65,75,35,-91,-29,21,15,-67,69,-76,24]
Fb= 1110000 %%%{-9870,[1]%%%}+%%%{14509,[0]%%%}
Gb= 1110000 %%%{-9870,[1]%%%}+%%%{14509,[0]%%%}
FOUND good eval1110000 [67,36,94,-20,25,51,-67,-76,62,-43,-19,24,-65,75,35,-91,-29,21,15,-67,69,-76,24]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1110000
lgcd(p) ok 24 1110000
Success p/lgcd(p) as gcd 24 1110000
// GCD eval dimension 24 1110000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1110000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1110000 0
Gb= 1110000 0
Find_good_eval 1110000 [13,-16,80,81,44,-42,-4,-45,57,-57,-72,80,-54,98,0,-98,-65,35,27,-20,77,2,-49]
Fb= 1120000 %%%{-1153,[1]%%%}+%%%{3781,[0]%%%}
Gb= 1120000 %%%{-1153,[1]%%%}+%%%{3781,[0]%%%}
FOUND good eval1120000 [13,-16,80,81,44,-42,-4,-45,57,-57,-72,80,-54,98,0,-98,-65,35,27,-20,77,2,-49]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1120000
lgcd(p) ok 24 1120000
Success p/lgcd(p) as gcd 24 1120000
// GCD eval dimension 24 1120000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1120000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1120000 0
Gb= 1120000 0
Find_good_eval 1120000 [15,37,7,83,-93,23,-6,-45,11,-3,-67,-70,-71,-97,65,28,91,-87,-23,23,9,-79,85]
Fb= 1120000 %%%{-7356,[1]%%%}+%%%{13207,[0]%%%}
Gb= 1120000 %%%{-7356,[1]%%%}+%%%{13207,[0]%%%}
FOUND good eval1120000 [15,37,7,83,-93,23,-6,-45,11,-3,-67,-70,-71,-97,65,28,91,-87,-23,23,9,-79,85]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1120000
lgcd(p) ok 24 1120000
Success p/lgcd(p) as gcd 24 1120000
// GCD eval dimension 24 1120000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1120000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1120000 0
Gb= 1120000 0
Find_good_eval 1120000 [-67,-18,-69,35,60,21,53,-67,-10,38,-25,-43,-87,-5,35,89,-24,-15,-68,-13,97,-65,50]
Fb= 1120000 %%%{4701,[1]%%%}+%%%{-14832,[0]%%%}
Gb= 1130000 %%%{4701,[1]%%%}+%%%{-14832,[0]%%%}
FOUND good eval1130000 [-67,-18,-69,35,60,21,53,-67,-10,38,-25,-43,-87,-5,35,89,-24,-15,-68,-13,97,-65,50]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1130000
lgcd(p) ok 24 1130000
Success p/lgcd(p) as gcd 24 1130000
// GCD eval dimension 24 1130000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1130000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1130000 0
Gb= 1130000 0
Find_good_eval 1130000 [95,10,53,3,85,13,93,-75,-29,-44,54,-53,65,61,-82,-30,8,26,50,-86,-15,-81,-46]
Fb= 1130000 %%%{-4567,[1]%%%}+%%%{13650,[0]%%%}
Gb= 1130000 %%%{-4567,[1]%%%}+%%%{13650,[0]%%%}
FOUND good eval1130000 [95,10,53,3,85,13,93,-75,-29,-44,54,-53,65,61,-82,-30,8,26,50,-86,-15,-81,-46]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1130000
lgcd(p) ok 24 1130000
Success p/lgcd(p) as gcd 24 1130000
// GCD eval dimension 24 1130000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1130000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1130000 0
Gb= 1130000 0
Find_good_eval 1130000 [43,-7,5,73,-19,-89,39,90,7,52,-56,43,-87,26,78,-95,-69,-8,-59,-72,-20,-52,-90]
Fb= 1140000 %%%{4238,[1]%%%}+%%%{-9124,[0]%%%}
Gb= 1140000 %%%{4238,[1]%%%}+%%%{-9124,[0]%%%}
FOUND good eval1140000 [43,-7,5,73,-19,-89,39,90,7,52,-56,43,-87,26,78,-95,-69,-8,-59,-72,-20,-52,-90]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1140000
lgcd(p) ok 24 1140000
Success p/lgcd(p) as gcd 24 1140000
// GCD eval dimension 24 1140000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1140000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1140000 0
Gb= 1140000 0
Find_good_eval 1140000 [55,-70,22,-34,-96,38,22,35,66,58,-11,-4,96,-65,-43,81,-95,-78,78,-39,73,-92,-94]
Fb= 1140000 %%%{3482,[1]%%%}+%%%{6877,[0]%%%}
Gb= 1140000 %%%{3482,[1]%%%}+%%%{6877,[0]%%%}
FOUND good eval1140000 [55,-70,22,-34,-96,38,22,35,66,58,-11,-4,96,-65,-43,81,-95,-78,78,-39,73,-92,-94]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1140000
lgcd(p) ok 24 1140000
Success p/lgcd(p) as gcd 24 1140000
// GCD eval dimension 24 1150000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 20 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]20 
Find_good_eval 1150000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1150000 0
Gb= 1150000 0
Find_good_eval 1150000 [20,57,7,9,-11,-72,93,-88,-98,-80,-45,15,-25,-85,46,-27,39,-78,-10,17,10,86,-99]
Fb= 1150000 %%%{-9,[1]%%%}+%%%{5574,[0]%%%}
Gb= 1150000 %%%{-9,[1]%%%}+%%%{5574,[0]%%%}
FOUND good eval1150000 [20,57,7,9,-11,-72,93,-88,-98,-80,-45,15,-25,-85,46,-27,39,-78,-10,17,10,86,-99]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1150000
lgcd(p) ok 24 1150000
Success p/lgcd(p) as gcd 24 1150000
// GCD eval dimension 24 1150000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1150000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1150000 0
Gb= 1150000 0
Find_good_eval 1150000 [-61,2,73,-68,9,-85,-41,58,-48,7,-16,13,80,-30,89,18,-42,-64,53,23,-11,14,52]
Fb= 1150000 %%%{7976,[1]%%%}+%%%{-13949,[0]%%%}
Gb= 1150000 %%%{7976,[1]%%%}+%%%{-13949,[0]%%%}
FOUND good eval1150000 [-61,2,73,-68,9,-85,-41,58,-48,7,-16,13,80,-30,89,18,-42,-64,53,23,-11,14,52]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1150000
lgcd(p) ok 24 1150000
Success p/lgcd(p) as gcd 24 1150000
// GCD eval dimension 24 1160000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1160000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1160000 0
Gb= 1160000 0
Find_good_eval 1160000 [40,-12,-60,18,-56,58,9,-92,-1,-53,99,91,18,-50,-4,-59,52,97,56,61,62,-54,-69]
Fb= 1160000 %%%{-7136,[1]%%%}+%%%{-9788,[0]%%%}
Gb= 1160000 %%%{-7136,[1]%%%}+%%%{-9788,[0]%%%}
FOUND good eval1160000 [40,-12,-60,18,-56,58,9,-92,-1,-53,99,91,18,-50,-4,-59,52,97,56,61,62,-54,-69]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1160000
lgcd(p) ok 24 1160000
Success p/lgcd(p) as gcd 24 1160000
// GCD eval dimension 24 1170000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1170000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1170000 0
Gb= 1170000 0
Find_good_eval 1170000 [-91,-93,-91,-52,-55,-85,-8,64,14,-86,-24,-21,16,-46,42,-36,53,8,82,-86,-91,29,-85]
Fb= 1170000 %%%{-2438,[1]%%%}+%%%{-8584,[0]%%%}
Gb= 1170000 %%%{-2438,[1]%%%}+%%%{-8584,[0]%%%}
FOUND good eval1170000 [-91,-93,-91,-52,-55,-85,-8,64,14,-86,-24,-21,16,-46,42,-36,53,8,82,-86,-91,29,-85]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1170000
lgcd(p) ok 24 1170000
Success p/lgcd(p) as gcd 24 1170000
// GCD eval dimension 24 1170000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1170000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1170000 0
Gb= 1170000 0
Find_good_eval 1170000 [-18,-61,2,10,-20,4,75,5,-43,43,-72,-37,47,46,68,-90,-67,69,-77,-26,-55,-49,-67]
Fb= 1170000 %%%{4120,[1]%%%}+%%%{-2315,[0]%%%}
Gb= 1180000 %%%{4120,[1]%%%}+%%%{-2315,[0]%%%}
FOUND good eval1180000 [-18,-61,2,10,-20,4,75,5,-43,43,-72,-37,47,46,68,-90,-67,69,-77,-26,-55,-49,-67]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1180000
lgcd(p) ok 24 1180000
Success p/lgcd(p) as gcd 24 1180000
// GCD eval dimension 24 1180000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1180000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1180000 0
Gb= 1180000 0
Find_good_eval 1180000 [-29,56,-3,43,38,-17,95,-31,8,0,-76,-81,51,28,-73,-58,76,-40,-78,73,-32,51,26]
Fb= 1180000 %%%{1300,[1]%%%}+%%%{-12781,[0]%%%}
Gb= 1180000 %%%{1300,[1]%%%}+%%%{-12781,[0]%%%}
FOUND good eval1180000 [-29,56,-3,43,38,-17,95,-31,8,0,-76,-81,51,28,-73,-58,76,-40,-78,73,-32,51,26]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1180000
lgcd(p) ok 24 1180000
Success p/lgcd(p) as gcd 24 1180000
// GCD eval dimension 24 1180000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 60 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]60 
Find_good_eval 1180000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1180000 0
Gb= 1180000 0
Find_good_eval 1180000 [81,77,12,44,-41,42,-10,78,-37,-19,-91,33,-11,1,-38,97,29,-40,-75,7,-7,-20,52]
Fb= 1180000 %%%{6974,[1]%%%}+%%%{-1193,[0]%%%}
Gb= 1180000 %%%{6974,[1]%%%}+%%%{-1193,[0]%%%}
FOUND good eval1180000 [81,77,12,44,-41,42,-10,78,-37,-19,-91,33,-11,1,-38,97,29,-40,-75,7,-7,-20,52]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1180000
lgcd(p) ok 24 1180000
Success p/lgcd(p) as gcd 24 1180000
// GCD eval dimension 24 1180000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1180000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1180000 0
Gb= 1180000 0
Find_good_eval 1180000 [-4,-13,-7,-59,-40,-52,-95,-35,-66,-60,-27,14,-9,-17,6,-35,82,85,-9,-80,-60,-67,43]
Fb= 1190000 %%%{9213,[1]%%%}+%%%{-7920,[0]%%%}
Gb= 1190000 %%%{9213,[1]%%%}+%%%{-7920,[0]%%%}
FOUND good eval1190000 [-4,-13,-7,-59,-40,-52,-95,-35,-66,-60,-27,14,-9,-17,6,-35,82,85,-9,-80,-60,-67,43]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1190000
lgcd(p) ok 24 1190000
Success p/lgcd(p) as gcd 24 1190000
// GCD eval dimension 24 1190000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1190000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1190000 0
Gb= 1190000 0
Find_good_eval 1190000 [-7,65,51,97,-85,-73,57,5,-86,38,-92,-37,-22,7,-7,-66,-43,-25,0,-57,27,-49,15]
Fb= 1190000 %%%{4693,[1]%%%}+%%%{1368,[0]%%%}
Gb= 1200000 %%%{4693,[1]%%%}+%%%{1368,[0]%%%}
FOUND good eval1200000 [-7,65,51,97,-85,-73,57,5,-86,38,-92,-37,-22,7,-7,-66,-43,-25,0,-57,27,-49,15]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1200000
lgcd(p) ok 24 1200000
Success p/lgcd(p) as gcd 24 1200000
// GCD eval dimension 24 1200000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1200000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1200000 0
Gb= 1200000 0
Find_good_eval 1200000 [57,4,53,55,97,-30,-15,-14,49,91,-80,-81,-44,88,-74,59,-29,-25,-80,-86,-1,5,-85]
Fb= 1200000 %%%{13775,[1]%%%}+%%%{-2336,[0]%%%}
Gb= 1200000 %%%{13775,[1]%%%}+%%%{-2336,[0]%%%}
FOUND good eval1200000 [57,4,53,55,97,-30,-15,-14,49,91,-80,-81,-44,88,-74,59,-29,-25,-80,-86,-1,5,-85]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1200000
lgcd(p) ok 24 1200000
Success p/lgcd(p) as gcd 24 1200000
// GCD eval dimension 24 1200000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1200000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1200000 0
Gb= 1200000 0
Find_good_eval 1200000 [17,-77,43,0,-74,-35,37,34,22,10,-84,-52,-48,-8,95,-90,-43,-64,77,-72,-99,92,93]
Fb= 1210000 %%%{-2975,[1]%%%}+%%%{-12070,[0]%%%}
Gb= 1210000 %%%{-2975,[1]%%%}+%%%{-12070,[0]%%%}
FOUND good eval1210000 [17,-77,43,0,-74,-35,37,34,22,10,-84,-52,-48,-8,95,-90,-43,-64,77,-72,-99,92,93]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1210000
lgcd(p) ok 24 1210000
Success p/lgcd(p) as gcd 24 1210000
// GCD eval dimension 24 1220000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1220000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1220000 0
Gb= 1220000 0
Find_good_eval 1220000 [-75,9,-40,-16,-85,-95,31,5,-92,74,-55,-22,-35,-17,-13,52,-91,-83,43,3,0,-76,64]
Fb= 1220000 %%%{5063,[1]%%%}+%%%{14489,[0]%%%}
Gb= 1220000 %%%{5063,[1]%%%}+%%%{14489,[0]%%%}
FOUND good eval1220000 [-75,9,-40,-16,-85,-95,31,5,-92,74,-55,-22,-35,-17,-13,52,-91,-83,43,3,0,-76,64]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1220000
lgcd(p) ok 24 1220000
Success p/lgcd(p) as gcd 24 1220000
// GCD eval dimension 24 1220000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1220000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1220000 0
Gb= 1220000 0
Find_good_eval 1220000 [75,19,12,-26,-87,22,88,-78,-88,-14,-64,-71,-76,-4,28,21,-51,56,-67,-61,93,-37,34]
Fb= 1220000 %%%{-9990,[1]%%%}+%%%{2360,[0]%%%}
Gb= 1230000 %%%{-9990,[1]%%%}+%%%{2360,[0]%%%}
FOUND good eval1230000 [75,19,12,-26,-87,22,88,-78,-88,-14,-64,-71,-76,-4,28,21,-51,56,-67,-61,93,-37,34]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1230000
lgcd(p) ok 24 1230000
Success p/lgcd(p) as gcd 24 1230000
// GCD eval dimension 24 1230000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1230000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1230000 0
Gb= 1230000 0
Find_good_eval 1230000 [-6,-10,59,-62,52,43,39,59,75,-73,25,91,77,63,65,10,-81,-95,47,-39,20,-78,-66]
Fb= 1230000 %%%{-11738,[1]%%%}+%%%{14486,[0]%%%}
Gb= 1230000 %%%{-11738,[1]%%%}+%%%{14486,[0]%%%}
FOUND good eval1230000 [-6,-10,59,-62,52,43,39,59,75,-73,25,91,77,63,65,10,-81,-95,47,-39,20,-78,-66]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1230000
lgcd(p) ok 24 1230000
Success p/lgcd(p) as gcd 24 1230000
// GCD eval dimension 24 1230000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1230000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1230000 0
Gb= 1230000 0
Find_good_eval 1230000 [45,84,-76,-45,-50,84,86,-91,-4,14,99,-91,88,86,16,51,70,-31,98,42,-60,7,-69]
Fb= 1240000 %%%{8383,[1]%%%}+%%%{14871,[0]%%%}
Gb= 1240000 %%%{8383,[1]%%%}+%%%{14871,[0]%%%}
FOUND good eval1240000 [45,84,-76,-45,-50,84,86,-91,-4,14,99,-91,88,86,16,51,70,-31,98,42,-60,7,-69]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1240000
lgcd(p) ok 24 1240000
Success p/lgcd(p) as gcd 24 1240000
// GCD eval dimension 24 1240000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1240000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1240000 0
Gb= 1240000 0
Find_good_eval 1240000 [80,-10,59,57,-18,-74,-23,2,9,27,-99,-30,84,-22,-82,53,-16,-77,80,16,-47,-45,93]
Fb= 1250000 %%%{6881,[1]%%%}+%%%{-13889,[0]%%%}
Gb= 1250000 %%%{6881,[1]%%%}+%%%{-13889,[0]%%%}
FOUND good eval1250000 [80,-10,59,57,-18,-74,-23,2,9,27,-99,-30,84,-22,-82,53,-16,-77,80,16,-47,-45,93]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1250000
lgcd(p) ok 24 1250000
Success p/lgcd(p) as gcd 24 1250000
// GCD eval dimension 24 1250000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1250000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1250000 0
Gb= 1250000 0
Find_good_eval 1250000 [-22,87,-70,54,33,33,8,-78,57,5,92,-91,-89,63,97,-29,94,2,7,13,14,87,-24]
Fb= 1260000 %%%{-4395,[1]%%%}+%%%{9145,[0]%%%}
Gb= 1260000 %%%{-4395,[1]%%%}+%%%{9145,[0]%%%}
FOUND good eval1260000 [-22,87,-70,54,33,33,8,-78,57,5,92,-91,-89,63,97,-29,94,2,7,13,14,87,-24]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1260000
lgcd(p) ok 24 1260000
Success p/lgcd(p) as gcd 24 1260000
// GCD eval dimension 24 1260000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1260000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1260000 0
Gb= 1260000 0
Find_good_eval 1260000 [-59,-87,36,-7,-27,-30,-68,-9,-87,54,31,0,98,13,38,-42,-49,46,44,46,37,-21,33]
Fb= 1260000 %%%{-13323,[1]%%%}+%%%{-1131,[0]%%%}
Gb= 1260000 %%%{-13323,[1]%%%}+%%%{-1131,[0]%%%}
FOUND good eval1260000 [-59,-87,36,-7,-27,-30,-68,-9,-87,54,31,0,98,13,38,-42,-49,46,44,46,37,-21,33]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1260000
lgcd(p) ok 24 1260000
Success p/lgcd(p) as gcd 24 1260000
// GCD eval dimension 24 1260000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1260000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1260000 0
Gb= 1260000 0
Find_good_eval 1260000 [42,50,-55,-91,97,-72,-36,8,-39,-86,83,5,-53,-39,82,-41,-23,26,-52,-47,50,1,72]
Fb= 1270000 %%%{5820,[1]%%%}+%%%{7022,[0]%%%}
Gb= 1270000 %%%{5820,[1]%%%}+%%%{7022,[0]%%%}
FOUND good eval1270000 [42,50,-55,-91,97,-72,-36,8,-39,-86,83,5,-53,-39,82,-41,-23,26,-52,-47,50,1,72]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1270000
lgcd(p) ok 24 1270000
Success p/lgcd(p) as gcd 24 1270000
// GCD eval dimension 24 1270000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 20 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]20 
Find_good_eval 1270000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1270000 0
Gb= 1270000 0
Find_good_eval 1270000 [65,46,0,-76,17,9,-98,98,-77,-68,85,66,-95,-68,45,71,90,-3,70,-92,-99,39,-67]
Fb= 1280000 %%%{76,[1]%%%}+%%%{6208,[0]%%%}
Gb= 1280000 %%%{76,[1]%%%}+%%%{6208,[0]%%%}
FOUND good eval1280000 [65,46,0,-76,17,9,-98,98,-77,-68,85,66,-95,-68,45,71,90,-3,70,-92,-99,39,-67]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1280000
lgcd(p) ok 24 1280000
Success p/lgcd(p) as gcd 24 1280000
// GCD eval dimension 24 1280000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1280000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1280000 0
Gb= 1280000 0
Find_good_eval 1280000 [-53,-75,32,13,-97,53,-85,-19,-93,-85,-96,85,69,-18,8,-70,-73,-24,24,40,-79,-27,-93]
Fb= 1280000 %%%{-449,[1]%%%}+%%%{-7971,[0]%%%}
Gb= 1280000 %%%{-449,[1]%%%}+%%%{-7971,[0]%%%}
FOUND good eval1280000 [-53,-75,32,13,-97,53,-85,-19,-93,-85,-96,85,69,-18,8,-70,-73,-24,24,40,-79,-27,-93]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1280000
lgcd(p) ok 24 1280000
Success p/lgcd(p) as gcd 24 1280000
// GCD eval dimension 24 1280000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1280000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1280000 0
Gb= 1280000 0
Find_good_eval 1280000 [84,-42,-93,30,20,35,64,45,56,35,58,-90,-88,-45,-99,-25,-10,4,18,-83,68,63,-39]
Fb= 1280000 %%%{-380,[1]%%%}+%%%{10743,[0]%%%}
Gb= 1280000 %%%{-380,[1]%%%}+%%%{10743,[0]%%%}
FOUND good eval1280000 [84,-42,-93,30,20,35,64,45,56,35,58,-90,-88,-45,-99,-25,-10,4,18,-83,68,63,-39]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1280000
lgcd(p) ok 24 1280000
Success p/lgcd(p) as gcd 24 1280000
// GCD eval dimension 24 1290000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1290000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1290000 0
Gb= 1290000 0
Find_good_eval 1290000 [-4,-15,91,-72,-65,67,70,-74,47,48,-58,6,-52,69,-6,87,18,-28,29,-60,99,-16,-32]
Fb= 1290000 %%%{-1027,[1]%%%}+%%%{-13308,[0]%%%}
Gb= 1290000 %%%{-1027,[1]%%%}+%%%{-13308,[0]%%%}
FOUND good eval1290000 [-4,-15,91,-72,-65,67,70,-74,47,48,-58,6,-52,69,-6,87,18,-28,29,-60,99,-16,-32]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1290000
lgcd(p) ok 24 1290000
Success p/lgcd(p) as gcd 24 1290000
// GCD eval dimension 24 1290000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1290000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1290000 0
Gb= 1290000 0
Find_good_eval 1290000 [-72,10,61,22,33,-56,-79,-33,-17,46,-33,82,82,73,11,-47,52,51,-9,86,-87,53,85]
Fb= 1300000 %%%{-6911,[1]%%%}+%%%{8852,[0]%%%}
Gb= 1300000 %%%{-6911,[1]%%%}+%%%{8852,[0]%%%}
FOUND good eval1300000 [-72,10,61,22,33,-56,-79,-33,-17,46,-33,82,82,73,11,-47,52,51,-9,86,-87,53,85]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1300000
lgcd(p) ok 24 1300000
Success p/lgcd(p) as gcd 24 1300000
// GCD eval dimension 24 1300000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 36 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]36 
Find_good_eval 1300000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1300000 0
Gb= 1300000 0
Find_good_eval 1300000 [42,91,-36,-93,0,-84,90,19,28,17,-76,-3,66,60,34,74,-93,27,-35,23,75,-3,-35]
Fb= 1300000 %%%{-3920,[1]%%%}+%%%{-8956,[0]%%%}
Gb= 1300000 %%%{-3920,[1]%%%}+%%%{-8956,[0]%%%}
FOUND good eval1300000 [42,91,-36,-93,0,-84,90,19,28,17,-76,-3,66,60,34,74,-93,27,-35,23,75,-3,-35]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1300000
lgcd(p) ok 24 1300000
Success p/lgcd(p) as gcd 24 1300000
// GCD eval dimension 24 1300000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 60 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]60 
Find_good_eval 1300000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1300000 0
Gb= 1300000 0
Find_good_eval 1300000 [-97,-6,92,-30,-80,88,-76,-1,-88,-95,-85,-63,47,85,-79,79,49,-63,-34,85,44,-2,88]
Fb= 1300000 %%%{12610,[1]%%%}+%%%{-1322,[0]%%%}
Gb= 1300000 %%%{12610,[1]%%%}+%%%{-1322,[0]%%%}
FOUND good eval1300000 [-97,-6,92,-30,-80,88,-76,-1,-88,-95,-85,-63,47,85,-79,79,49,-63,-34,85,44,-2,88]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1300000
lgcd(p) ok 24 1300000
Success p/lgcd(p) as gcd 24 1300000
// GCD eval dimension 24 1310000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1310000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1310000 0
Gb= 1310000 0
Find_good_eval 1310000 [-67,40,-73,-33,41,-25,43,-49,-20,-74,-43,-78,15,1,-94,-3,-11,-68,81,-9,19,-21,-45]
Fb= 1310000 %%%{-6965,[1]%%%}+%%%{10442,[0]%%%}
Gb= 1310000 %%%{-6965,[1]%%%}+%%%{10442,[0]%%%}
FOUND good eval1310000 [-67,40,-73,-33,41,-25,43,-49,-20,-74,-43,-78,15,1,-94,-3,-11,-68,81,-9,19,-21,-45]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1310000
lgcd(p) ok 24 1310000
Success p/lgcd(p) as gcd 24 1310000
// GCD eval dimension 24 1310000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1310000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1310000 0
Gb= 1310000 0
Find_good_eval 1310000 [-91,-57,21,-36,-47,-58,20,65,-46,-48,54,-72,-53,28,-78,47,90,-25,88,-36,78,47,41]
Fb= 1320000 %%%{-3671,[1]%%%}+%%%{-2663,[0]%%%}
Gb= 1320000 %%%{-3671,[1]%%%}+%%%{-2663,[0]%%%}
FOUND good eval1320000 [-91,-57,21,-36,-47,-58,20,65,-46,-48,54,-72,-53,28,-78,47,90,-25,88,-36,78,47,41]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1320000
lgcd(p) ok 24 1320000
Success p/lgcd(p) as gcd 24 1320000
// GCD eval dimension 24 1320000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1320000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1320000 0
Gb= 1320000 0
Find_good_eval 1320000 [68,71,61,-70,-62,66,-18,-56,90,-34,95,-62,87,-8,12,53,-2,11,61,-24,-24,-94,58]
Fb= 1330000 %%%{7850,[1]%%%}+%%%{12934,[0]%%%}
Gb= 1330000 %%%{7850,[1]%%%}+%%%{12934,[0]%%%}
FOUND good eval1330000 [68,71,61,-70,-62,66,-18,-56,90,-34,95,-62,87,-8,12,53,-2,11,61,-24,-24,-94,58]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1330000
lgcd(p) ok 24 1330000
Success p/lgcd(p) as gcd 24 1330000
// GCD eval dimension 24 1330000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1330000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1330000 0
Gb= 1330000 0
Find_good_eval 1330000 [-20,-67,-59,66,-91,75,-24,-46,78,79,-45,8,44,-69,44,-73,14,5,11,-89,-2,14,-48]
Fb= 1330000 %%%{-14510,[1]%%%}+%%%{-9493,[0]%%%}
Gb= 1330000 %%%{-14510,[1]%%%}+%%%{-9493,[0]%%%}
FOUND good eval1330000 [-20,-67,-59,66,-91,75,-24,-46,78,79,-45,8,44,-69,44,-73,14,5,11,-89,-2,14,-48]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1330000
lgcd(p) ok 24 1330000
Success p/lgcd(p) as gcd 24 1330000
// GCD eval dimension 24 1340000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 96 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]96 
Find_good_eval 1340000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1340000 0
Gb= 1340000 0
Find_good_eval 1340000 [16,-35,-48,-32,96,-78,78,75,35,55,88,45,58,63,25,36,16,30,21,93,-30,-55,-52]
Fb= 1340000 %%%{-10013,[1]%%%}+%%%{-6678,[0]%%%}
Gb= 1340000 %%%{-10013,[1]%%%}+%%%{-6678,[0]%%%}
FOUND good eval1340000 [16,-35,-48,-32,96,-78,78,75,35,55,88,45,58,63,25,36,16,30,21,93,-30,-55,-52]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1340000
lgcd(p) ok 24 1340000
Success p/lgcd(p) as gcd 24 1340000
// GCD eval dimension 24 1350000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1350000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1350000 0
Gb= 1350000 0
Find_good_eval 1350000 [-61,59,-80,-32,-66,71,-44,-85,-95,53,39,30,-4,-77,-58,72,-94,-75,11,-96,15,79,-74]
Fb= 1350000 %%%{2884,[1]%%%}+%%%{10614,[0]%%%}
Gb= 1350000 %%%{2884,[1]%%%}+%%%{10614,[0]%%%}
FOUND good eval1350000 [-61,59,-80,-32,-66,71,-44,-85,-95,53,39,30,-4,-77,-58,72,-94,-75,11,-96,15,79,-74]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1350000
lgcd(p) ok 24 1350000
Success p/lgcd(p) as gcd 24 1350000
// GCD eval dimension 24 1350000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1350000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1350000 0
Gb= 1350000 0
Find_good_eval 1350000 [31,29,11,89,37,-60,54,-64,96,-72,46,-53,-75,-96,8,-19,22,-33,71,60,-84,-68,-8]
Fb= 1350000 %%%{10546,[1]%%%}+%%%{8056,[0]%%%}
Gb= 1360000 %%%{10546,[1]%%%}+%%%{8056,[0]%%%}
FOUND good eval1360000 [31,29,11,89,37,-60,54,-64,96,-72,46,-53,-75,-96,8,-19,22,-33,71,60,-84,-68,-8]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1360000
lgcd(p) ok 24 1360000
Success p/lgcd(p) as gcd 24 1360000
// GCD eval dimension 24 1360000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1360000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1360000 0
Gb= 1360000 0
Find_good_eval 1360000 [45,5,-84,40,-37,-45,-42,78,-13,-76,-78,67,18,9,70,97,-55,45,-24,43,79,-30,76]
Fb= 1360000 %%%{7115,[1]%%%}+%%%{-5761,[0]%%%}
Gb= 1360000 %%%{7115,[1]%%%}+%%%{-5761,[0]%%%}
FOUND good eval1360000 [45,5,-84,40,-37,-45,-42,78,-13,-76,-78,67,18,9,70,97,-55,45,-24,43,79,-30,76]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1360000
lgcd(p) ok 24 1360000
Success p/lgcd(p) as gcd 24 1360000
// GCD eval dimension 24 1370000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1370000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1370000 0
Gb= 1370000 0
Find_good_eval 1370000 [25,-23,-31,94,-67,79,36,-16,-10,26,-19,89,-64,69,84,0,-88,2,86,-12,71,37,28]
Fb= 1370000 %%%{-4616,[1]%%%}+%%%{-4447,[0]%%%}
Gb= 1370000 %%%{-4616,[1]%%%}+%%%{-4447,[0]%%%}
FOUND good eval1370000 [25,-23,-31,94,-67,79,36,-16,-10,26,-19,89,-64,69,84,0,-88,2,86,-12,71,37,28]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1370000
lgcd(p) ok 24 1370000
Success p/lgcd(p) as gcd 24 1370000
// GCD eval dimension 24 1370000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1370000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1370000 0
Gb= 1370000 0
Find_good_eval 1370000 [52,56,2,48,97,10,76,-90,-60,-77,-64,-26,-94,86,89,-32,98,51,84,7,91,95,-80]
Fb= 1370000 %%%{3869,[1]%%%}+%%%{6003,[0]%%%}
Gb= 1370000 %%%{3869,[1]%%%}+%%%{6003,[0]%%%}
FOUND good eval1370000 [52,56,2,48,97,10,76,-90,-60,-77,-64,-26,-94,86,89,-32,98,51,84,7,91,95,-80]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1370000
lgcd(p) ok 24 1370000
Success p/lgcd(p) as gcd 24 1370000
// GCD eval dimension 24 1370000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1370000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1370000 0
Gb= 1370000 0
Find_good_eval 1370000 [-59,26,-53,91,23,-86,-31,-48,-12,-27,-90,-76,-79,34,29,-34,23,97,-2,0,-29,16,52]
Fb= 1370000 %%%{8635,[1]%%%}+%%%{13819,[0]%%%}
Gb= 1380000 %%%{8635,[1]%%%}+%%%{13819,[0]%%%}
FOUND good eval1380000 [-59,26,-53,91,23,-86,-31,-48,-12,-27,-90,-76,-79,34,29,-34,23,97,-2,0,-29,16,52]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1380000
lgcd(p) ok 24 1380000
Success p/lgcd(p) as gcd 24 1380000
// GCD eval dimension 24 1380000 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] 120 Vector [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]120 
Find_good_eval 1380000 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
Fb= 1380000 0
Gb= 1380000 0
Find_good_eval 1390000 [93,-94,53,-97,36,74,96,4,57,-97,32,27,69,-93,-45,-97,56,-92,52,48,6,-3,-30]
Fb= 1390000 %%%{-10478,[1]%%%}+%%%{8272,[0]%%%}
Gb= 1390000 %%%{-10478,[1]%%%}+%%%{8272,[0]%%%}
FOUND good eval1390000 [93,-94,53,-97,36,74,96,4,57,-97,32,27,69,-93,-45,-97,56,-92,52,48,6,-3,-30]
// evaled GCD deg 1
Trying p/lgcd(p) as gcd 24 1390000
lgcd(p) ok 24 1400000
Success p/lgcd(p) as gcd 24 1400000

Evaluation time: 0.83
// Time 0.83
// Time 0
// Time 0
// Time 0
// Time 0.04
// Time 0.04
// Time 0.21
// Time 0.12
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0.02
// Time 0.02
// Time 0
// Time 0.05
// Time 0.06
// Time 0
// Time 0.02
// Time 0.03
// Total time 1.96
PASS: chk_fhan5
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining monlagrange
// Success
// Success
// Success
// Success
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.22
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.36
// Time 0.36
// Time 0.08
// Time 0.29
pcar OK
// Time 0.01
pcar OK
// Time 0
// Time 0.05
// Time 0.08
// Time 0
// Time 0
// Time 0.01

Evaluation time: 1.27
// Time 1.27

Evaluation time: 1.28
// Time 1.28
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Total time 4.04
PASS: chk_fhan6
// Using locale /usr/share/locale/
// setlocale returns 0
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Success
// End defining M
// Success
// End defining f
// Warning: a,b,c, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining egal
// Warning: y,z,x,egal,t, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining pointresiduel
// Warning: pointresiduel, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining plus
// Warning: plus, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining nplus
// Success
// End defining egalomega
// Warning: egalomega,plus, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining factell
// Time 0
// Time 0
// Time 0
// Time 0.05
Near [0,0], 1/epsilon^2*f([0,0]+epsilon*[1,t])=-3*t roots [0.0]
Singular points directions: [cell_i, cell_j, singularity, next solution] [[50,50,0.0,0.0666666666667+0.00148146522433*i],[50,50,0.0,-0.0666666666667+0.0014814977397*i]]
Bad branch, questionnable accuracy
// Time 0.15
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
noneg:noneg
// Time 0
eg:eg
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
1,1,1
1,2,20011
1,3,1
1,4,1
1,5,1
1,6,1
1,7,1
1,8,1
1,9,1
1,10,1
1,11,1
1,12,1
1,13,1
1,14,1
1,15,1
1,16,1
1,17,1
1,18,1
1,19,1
1,20,1
2,1,1
2,2,1
2,3,1
2,4,1
2,5,1
2,6,1
2,7,1
2,8,1
2,9,1
2,10,1
2,11,1
2,12,1
2,13,20011
2,14,1
2,15,1
2,16,1
2,17,1
2,18,1
2,19,20011
2,20,1
3,1,1
3,2,1
3,3,1
3,4,1
3,5,1
3,6,1
3,7,1
3,8,1
3,9,1
3,10,1
3,11,1
3,12,1
3,13,1
3,14,1
3,15,1
3,16,1
3,17,1
3,18,1
3,19,1
3,20,1

Evaluation time: 1.48
// Time 1.48
// Time 0
// Time 0
1,1,1
1,2,1234577
1,3,1
1,4,1
1,5,1
1,6,1
1,7,1
1,8,1
1,9,1
1,10,1
1,11,1
1,12,1
1,13,1
1,14,1
1,15,1
1,16,1
1,17,1
1,18,1
1,19,1
1,20,1
2,1,1
2,2,1
2,3,1
2,4,1
2,5,1234577
2,6,1
2,7,1
2,8,1
2,9,1
2,10,1
2,11,1
2,12,1
2,13,1
2,14,1
2,15,1
2,16,1
2,17,1
2,18,1
2,19,1
2,20,1
3,1,1
3,2,1
3,3,1
3,4,1
3,5,1
3,6,1
3,7,1
3,8,1
3,9,1
3,10,1
3,11,1
3,12,1
3,13,1
3,14,1
3,15,1
3,16,1
3,17,1
3,18,1
3,19,1
3,20,1

Evaluation time: 4.27
// Time 4.27
// Total time 5.97
PASS: chk_fhan8
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: t, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining P
// Warning: a,l, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Success
// End defining puis
============== restarted ===============
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.02
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.08
// Time 0
// Time 0
// Time 0
// Total time 0.23
PASS: chk_fhan0
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0.2
// Time 0.16
// Time 0.21
// Time 0
// Time 0
// Time 0.36
// Time 0
// Time 0
// Time 0.01

Evaluation time: 3.99
// Time 3.99
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
ca fait bien p-1
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0.05
// Time 0
// Time 0.32

Evaluation time: 0.5
// Time 0.5

Evaluation time: 0.51
// Time 0.51
// Time 0
// Time 0.16
// Time 0.26
// Time 0.13
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Total time 6.9
PASS: chk_fhan11
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Success
// End defining orbites
// Warning: X, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining phi
// Warning: P, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining puiss
// Warning: P,x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining puiss
// Warning: puiss,q, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining testcarre
// Warning: puiss,q, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining inve
// Success
// End defining ordre
============== restarted ===============
// Time 0
// Time 0
// Time 0
Assigning variables a and K
Now e.g. a^200+1 will build an element of K
// Time 0
// Time 0
[1 2 0 1]
// Time 0
// Time 0
// Time 0
[0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0.07
Assigning variables b and L
Now e.g. b^200+1 will build an element of L
// Time 0
[1 0 0 0 0 0 0 0 1]
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
[2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
// Time 0
[2 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
// Time 0.01
1,2
2,4
2,8
4,16
8,32
16,64
32,128
64,256
// Time 0
(X-1)*(X+1),2
(X-1)*(X+1)*(X^2+1),4
(X-1)*(X+1)*(X^2+1)*(X^4+1),8
(X-1)*(X+1)*(X^2+1)*(X^4+1)*(X^8+1),16
(X-1)*(X+1)*(X^2+1)*(X^4+1)*(X^8+1)*(X^16+1),32
(X-1)*(X+1)*(X^2+1)*(X^4+1)*(X^8+1)*(X^16+1)*(X^32+1),64
(X-1)*(X+1)*(X^2+1)*(X^4+1)*(X^8+1)*(X^16+1)*(X^32+1)*(X^64+1),128
(X-1)*(X+1)*(X^2+1)*(X^4+1)*(X^8+1)*(X^16+1)*(X^32+1)*(X^64+1)*(X^128+1),256
// Time 0.01
// Time 0
1*X+1
[1 0 1]
1*X^2+1
[1 0 0 0 1]
(1*X^2+1*X-1)*(1*X^2-1*X-1)
[1 0 0 0 0 0 0 0 1]
(1*X^4+1*X^2-1)*(1*X^4-1*X^2-1)
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
(1*X^8+1*X^4-1)*(1*X^8-1*X^4-1)
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
(1*X^16+1*X^8-1)*(1*X^16-1*X^8-1)
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
(1*X^32+1*X^16-1)*(1*X^32-1*X^16-1)
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
(1*X^64+1*X^32-1)*(1*X^64-1*X^32-1)
// Time 0.04
i_i_:64
// Time 0
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0.02
// Time 0
[2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
// Time 0
// Time 0
// Time 0.04
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
ca marche
// Time 0
// Total time 0.24
73,74c73,74
< true,
< false,
---
> 1,
> 0,
83c83
< true,
---
> 1,
FAIL: chk_fhan12
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining facto1
// Warning: x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining facto2
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
[6 0 0 0 0 0 1]
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
[6 0 0 0 0 0 1]
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
[0 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
// Time 0
[0 0 0 0 0 0 0 2 6 5 1 5 3 2 0 1 1 6 1 2 2 5 4 6 3 0 4 1 0 6 0 1 1 6 2 5 3 1 4 5 5 4 6 1 6 6 0 4 4 3 1 5 6 0 1 2 2 4 5 3 0 1 6 6 2 0 5 1 6 6 5 3 0 4 3 4 0 4 4 5 3 1]
// Time 0.01
// Time 0.02
// Time 0
// Time 0.02
// Total time 0.08
PASS: chk_fhan13
// Using locale /usr/share/locale/
// setlocale returns 0
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining randP
// Warning: x,l, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining berl
// Warning: A,B,rep,p,N,r,LX,Q,P,x,Powmod, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining unfacteur
// Warning: unfacteur,t,tt, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining facteurpseudoirred
// Warning: A, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining borne
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
"facteurs multiples",2
[0 0 0 1 0 1 0 1 1 1 1 1 0 1 1 0 1]
"facteurs multiples",3
[0 2 1 0 1 2 1 0 0 1 0 0 1 0 1 1 1]
[2 1 3 1 3 1 1 4 2 1 3 2 0 0 2 3 1]
[0 3 1 5 4 3 5 3 1 4 1 0 3 5 1 2 1]
"facteurs multiples",11
[2 5 4 5 3 6 0 3 5 0 4 9 8 5 1 3 1]
"facteurs multiples",13
[0 2 2 12 5 1 4 12 10 6 9 2 12 9 9 6 1]
[0 8 10 14 7 15 1 8 11 2 6 0 3 1 10 7 1]
"facteurs multiples",19
[0 18 15 14 16 16 17 4 3 11 1 14 8 7 0 1 1]
"facteurs multiples",23
[22 4 3 7 7 3 16 22 18 5 3 17 22 5 7 12 1]
[7 13 21 20 20 1 0 21 10 22 27 2 6 25 24 0 1]
// Time 0.09
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
f est irred
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
[0 3 1 5 4 3 5 3 1 4 1 0 3 5 1 2 1]
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
x^2+9*x+17,"est un diviseur dans Z"
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Total time 0.17
PASS: chk_fhan14
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: v, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining paff
// Warning: a, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
Ellipsis of center (-50/7,17/2)
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Total time 0.03
PASS: chk_fhan15
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: q,x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: S3h,x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: S4h,x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
Near [0,2], 1/epsilon^2*f([0,2]+epsilon*[1,t])=1 roots []
Near [0,2], 1/epsilon^2*f([0,2]+epsilon*[1,t])=1 roots []
Near [0,2], 1/epsilon^2*f([0,2]+epsilon*[1,t])=1 roots []
Singular points directions: [cell_i, cell_j, singularity, next solution] [[50,70,2.0*i,-0.00112947877252+2.03333333333*i],[50,70,2.0*i,0.00112947877252+2.03333333333*i],[50,70,2.0*i,-0.00109243590672+1.96666666667*i],[50,70,2.0*i,0.00109243590672+1.96666666667*i],[50,70,2.0*i,-0.00112947877252+2.03333333333*i],[50,70,2.0*i,0.00112947877252+2.03333333333*i],[50,70,2.0*i,-0.00109243590672+1.96666666667*i],[50,70,2.0*i,0.00109243590672+1.96666666667*i],[50,70,2.0*i,-0.00112947877252+2.03333333333*i],[50,70,2.0*i,0.00112947877252+2.03333333333*i],[50,70,2.0*i,-0.00109243590672+1.96666666667*i],[50,70,2.0*i,0.00109243590672+1.96666666667*i]]
Warning! Could not loop or reach boundaries 
Warning! Could not loop or reach boundaries 
Warning! Could not loop or reach boundaries 
Warning! Could not loop or reach boundaries 
Warning! Could not loop or reach boundaries 
Warning! Could not loop or reach boundaries 
Warning! Could not loop or reach boundaries 
// Time 0.11
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0.01 Memory 0.022284M
schur row 1 5.00933e-12
Francis algorithm not precise enough for[1.0,-8.26409192534e+36,1.70738038376e+73,8.85244006785e+107]
Warning, ^ is ambiguous on non square matrices. Use .^ to apply ^ element by element.
Warning, ^ is ambiguous on non square matrices. Use .^ to apply ^ element by element.
Warning, ^ is ambiguous on non square matrices. Use .^ to apply ^ element by element.
Warning, ^ is ambiguous on non square matrices. Use .^ to apply ^ element by element.
Warning, ^ is ambiguous on non square matrices. Use .^ to apply ^ element by element.
Near [0,0], 1/epsilon^2*f([0,0]+epsilon*[1,t])=9*t^2 roots [0.0]
Singular points directions: [cell_i, cell_j, singularity, next solution] [[0,0,0.0,0.00666666666667-0.00171924829653*i],[0,0,0.0,0.00666666666667+0.00120989161359*i]]
// Time 0.34
// Time 0
// Time 0
// Time 0
Hyperbola of center (0,0)
// Time 0
// Time 0.12
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
Warning, argument is not an equation, solving -14699.0*t^6+25716.0*t^5+1779.0*t^4-15116.0*t^3-624.0*t^2+2496.0*t+448.0=0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.11
// Time 0
// Time 0
schur row 5 -2.79096e-08
// Time 0
// Time 0.01
// Time 0
// Time 0
Warning, argument is not an equation, solving x^3-2.0*x^2-20.0*x+48.0=0
// Time 0
// Time 0
Warning, argument is not an equation, solving x^3-2*x^2-20*x+48=0
// Time 0
// Time 0
Warning, argument is not an equation, solving y^2+6*sqrt(13)+18=0
Warning, argument is not an equation, solving y^2-6*sqrt(13)+18=0
Warning, argument is not an equation, solving y^2=0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
Ellipsoid of center [0.0,0.0,0.0]
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0 Memory 0.0241M

Evaluation time: 0.46
// Time 0.46
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0 Memory 0.024232M
// Time 0.12
// Total time 1.32
PASS: chk_fhan16
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: x,y,z, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining rl
// Warning: rl, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining ql
============== restarted ===============
// Time 0.01
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0 Memory 0.021M
Near [2,1], 1/epsilon^2*f([2,1]+epsilon*[1,t])=-6+2*t+10*t^2 roots [-0.881024967591,0.681024967591]
Singular points directions: [cell_i, cell_j, singularity, next solution] [[60,55,2.0+i,2.06666666667+0.939938800939*i],[60,55,2.0+i,1.93333333333+1.0574044987*i],[60,55,2.0+i,2.06666666667+1.04434273302*i],[60,55,2.0+i,1.93333333333+0.953437648204*i]]
Warning! Could not loop or reach boundaries 
// Time 0.15
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
c'est bon, le point trouve est bien sur la cubique
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0 Memory 0.022096M
S est
 bien  lisse. on peut continuer!
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
c'est bon
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0.14
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
Warning, argument is not an equation, solving (-4*a^6*u+10*a^6*v+57*a^6-18*a^5*u-13*a^5*v+13*a^5-4*a^4*u-15*a^4*v+92*a^4-10*a^3*u+67*a^3*v-458*a^3-66*a^2*u+91*a^2*v+523*a^2-62*a*u+36*a*v-885*a-16*u+4*v+298)/(a^6-2*a^5+9*a^4-16*a^3+24*a^2-32*a+16)=0
// Time 0.01
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Time 0
// Time 0
c'est bien de degre 27
// Time 0
// Total time 0.44
PASS: chk_fhan17
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: A,x,P, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0 Memory 0.021188M
Near [1,0], 1/epsilon^2*f([1,0]+epsilon*[1,t])=7+8*t+t^2 roots [-7.0,-1.0]
Near [2,1], 1/epsilon^2*f([2,1]+epsilon*[1,t])=-4+7*t+13*t^2 roots [-0.885816136226,0.347354597765]
Near [1,1], 1/epsilon^2*f([1,1]+epsilon*[1,t])=-4-2*t+t^2 roots [-1.2360679775,3.2360679775]
Singular points directions: [cell_i, cell_j, singularity, next solution] [[40,20,1.0,1.01750749956-0.116666666667*i],[40,20,1.0,0.984298297257+0.116666666667*i],[40,20,1.0,1.01623362425-0.0166666666667*i],[40,20,1.0,0.982835796847+0.0166666666667*i],[60,40,2.0+i,2.01666666667+0.985089269594*i],[60,40,2.0+i,1.98333333333+1.0146162523*i],[60,40,2.0+i,2.01666666667+1.00580773806*i],[60,40,2.0+i,1.98333333333+0.994229813537*i],[40,40,1.0+i,1.01742962193+0.979398867042*i],[40,40,1.0+i,0.983990659661+1.02060113296*i],[40,40,1.0+i,1.01892941475+1.05393446629*i],[40,40,1.0+i,0.985250778257+0.946065533708*i]]

Evaluation time: 0.48
// Time 0.48
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
Warning, argument is not an equation, solving -44*t^4-81*t^3-84*t^2-29*t-2+(16*t^4+15*t^3+41*t^2+23*t+2)*x=0
// Time 0
// Time 0
// Time 0
// Time 0
Warning, argument is not an equation, solving 77*t^3+73*t^2+6*t+(16*t^4+15*t^3+41*t^2+23*t+2)*y=0
// Time 0
// Time 0.28
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Total time 0.79
PASS: chk_fhan19
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
============== restarted ===============
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
Warning: non-square matrix!
// Time 0
// Time 0
Warning: non-square matrix!
// Time 0
// Time 0.01
// Time 0
Hyperbola of center (1201/284,-523/568)
// Time 0.02
// Groebner basis computation time 0 Memory 0.022748M
// Time 0.15
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0

// Groebner basis computation time 0 Memory 0.023492M
// Time 0
// Time 0.02
// Time 0.01
// Time 0
// Time 0
Line A-5*B+1=0
Line A-3*B-6=0
Line A-2*B-3=0
Line A-2*B+2=0
Line A-B+1=0
// Time 0.01
// Total time 0.26
PASS: chk_fhan20
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: x,g, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: x,tmp, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining ST
// Warning: PU, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: x,j, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining MU
// Warning: x,MU,U, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining scalU
// Warning: scalU, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: x, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining recip
============== restarted ===============
// Time 0
// Time 0
// Time 0.01
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
// Time 0
// Time 0
// Time 0
[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1]
// Time 0
// Time 0
// Time 0
// Time 0.06
// Time 0.09
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.06
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
"ca doit etre nul",0
"ca doit etre nul",0
"ca doit etre nul",0
"ca doit etre nul",0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.05
// Time 0.01
// Time 0
// Time 0
// Total time 0.3
PASS: chk_fhan21
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Success
// End defining puis
// Warning: x,p, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining periode
============== restarted ===============
// Time 0
// Time 0
// Time 0

Evaluation time: 15.91
// Time 15.91
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.06
// Time 0
// Total time 16.06
PASS: chk_fhan9
// Using locale /usr/share/locale/
// C
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: S, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Warning: S, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Warning: S, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Warning: S,f, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining h
// Warning: H,rep,w,k,r, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining jeu
// Success
// End defining f
// Warning: H,HE, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining syst
// Warning: syst, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining sol
// Warning: S, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Warning: sol,S,f,a,b,c,l, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining question
// Warning: j, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining prodlist
// Success
// Warning: prodlist,powerlist,aa,a, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining powerlist
// Warning: j, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining powerlist2
// Warning: S, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Warning: sol,S,powerlist2,L,f,A,l, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining questionbis
// Success
// End defining f
// Success
// End defining distham
// Warning: distham,v, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: distham,C, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// Warning: distham,C, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
============== restarted ===============
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
"menti a la question:",2
// Time 0
// Time 0
"votre nombre est:",13
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
c'est bien nul
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
"est il dans",[8,9,10,11,12,13,14,15]
"est il dans",[4,5,6,7,12,13,14,15]
"est il dans",[2,3,6,7,10,11,14,15]
"est il dans",[1,3,5,7,9,11,13,15]
"est il dans",[1,2,4,7,9,10,12,15]
"est il dans",[1,2,5,6,8,11,12,15]
"est il dans",[1,3,4,6,8,10,13,15]
// Time 0
// Time 0
// Time 0
powerlist: recursive definition
// Time 0
// Time 0
BON
// Time 0.01
// Time 0
"est il dans",[8,9,10,11,12,13,14,15]
"est il dans",[4,5,6,7,12,13,14,15]
"est il dans",[2,3,6,7,10,11,14,15]
"est il dans",[1,3,5,7,9,11,13,15]
"est il dans",[1,2,4,7,9,10,12,15]
"est il dans",[1,2,5,6,8,11,12,15]
"est il dans",[1,3,4,6,8,10,13,15]
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
Warning, the test a==b is performed by checking
that the internal representation of regroup(a-b) is not 0.
Therefore a==b may return false even if a and b are mathematically equal,
if they have different internal representations.
You can explicitly call a simplification function like simplify(a-b)==0 to avoid this.
// Time 0
// Time 0.01
// Time 0
// Time 0.05
// Time 0.05
// Time 0.05
// Total time 0.2
PASS: chk_fhan18
// Using locale /usr/share/locale/
// setlocale returns 0
// /usr/share/locale/
// giac
// UTF-8
// Maximum number of parallel threads 1
// Giac share root-directory:/usr/share/giac/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 0 synonyms
// Giac share root-directory:/usr/share/giac/
// Warning: x,f, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining g
// Success
// End defining f
// Warning: f, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining df
// Warning: J, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Warning: p, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining f
// Warning: x,m,p,dp,u,s,t,d,invdp, declared as global variable(s). If symbolic variables are required, declare them as local and run purge
// End defining Dunford
============== restarted ===============
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.03
0.0857864376269
0.00245310429357
2.12390141741e-06
1.5916157281e-12
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.04
// Time 0
// Time 0
// Time 0
// Time 0.3
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
Warning, the test a==b is performed by checking
that the internal representation of regroup(a-b) is not 0.
Therefore a==b may return false even if a and b are mathematically equal,
if they have different internal representations.
You can explicitly call a simplification function like simplify(a-b)==0 to avoid this.
// Time 0.03
// Time 0
// Time 0.01
// Time 0.03
// Time 0
// Total time 0.49
PASS: chk_fhan7
====================
1 of 30 tests failed
====================
make[1]: *** [check-TESTS] Erreur 1
make[1]: quittant le répertoire « /home/parisse/giac-1.2.3/check »
make: *** [check-am] Erreur 2
