make  check-TESTS
make[1]: entrant dans le répertoire « /home/parisse/giac-1.2.2/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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.03
// Time 0.01
// Time 0.04
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0.03
// 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.04
// Time 0
// Time 0
// Time 0
// Time 0.03
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// 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
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.05
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Total time 0.37
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/fr/aide_cas not found
Added 174 synonyms
// 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.01
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0.1
// Total time 0.15
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/fr/aide_cas not found
Added 174 synonyms
// Time 0.01
// Time 0.01
// Time 0.01
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.31
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0

Temps mis pour l'évaluation: 4.5
// Time 4.5
// Total time 4.85
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/fr/aide_cas not found
Added 174 synonyms
// 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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/fr/aide_cas not found
Added 174 synonyms
// Time 0.01
// 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.02
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0.02
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// 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.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.12
// Time 0
// Time 0.01
// Total time 0.33
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Success
// Success
// 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
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// 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.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.01
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.01
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.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.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.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
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.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
// Time 0
// 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.28
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// 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
// Time 0.04
// Time 0
// Time 0.01
// Time 0.03
// Time 0
// Time 0
// Time 0
// Total time 0.57
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// 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
// Time 0.01
// 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.01
// 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.01
// 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
Feuerbach theorem
// 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
teste que le pied de la altitude est sur c de 2 facons, doit renvoyer 1 puis 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
circle incircle de A,B,C, center
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
Le prochain resultat doit etre 0
// Time 0
// Time 0
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
// Time 0
// Time 0
// Time 0
Variable x should be purged
Variable y should be purged
// Time 0.01
// Time 0
// Time 0
Morley theorem
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.04
// Time 0.03
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Total time 0.21
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Parsing find_equi
// Warning: Ptest,test, declared as global variable(s) compiling find_equi
// Parsing find_equi
// Warning: Ptest,test, declared as global variable(s) compiling find_equi
// Time 0.01
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: 1.6
// Time 1.6
// Time 0
// Total time 1.61
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// 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.01
// Time 0.01
// Time 0
// Time 0.01
// Time 0.02
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Time 0.01
// Time 0

Evaluation time: 0.6
// Time 0.6
// Time 0.15
Simplification assuming t near 0
Simplification assuming t near 0
// Time 0.13
Simplification assuming t near 0
Simplification assuming t near 0
// Time 0.29
// Total time 1.26
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: a, declared as global variable(s)
// End defining f
// Success
// End defining f
// Success
// End defining f
// Warning: f, declared as global variable(s)
// End defining T
// Warning: a,n, declared as global variable(s)
// Warning: L,a, declared as global variable(s)
(Comment) scanning line 91
(Comment) scanning line 92
(Comment) scanning line 93
(Comment) scanning line 94
(Comment) scanning line 95
(Comment) scanning line 96
// Time 0
// Time 0
// 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
// Time 0
calcul du det 8x8 antisymetrique formel
// Time 0

Evaluation time: 1.42
// Time 1.42
// Time 0.03
OK c'est bien nul

Evaluation time: 0.93
// Time 0.93
Gcdheu begin 28 2840000 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
Gcdheu end copy2840000
Gcdheu end ppz2840000 1 2
//Gcdheu exact division failed! 2840000
// GCD eval dimension 28 2840000 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 2840000 [0,0,0,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= 2850000 0
Gb= 2850000 0
Find_good_eval 2850000 [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= 2960000 %%%{-13570,[2]%%%}+%%%{-1665,[1]%%%}+%%%{-8878,[0]%%%}
Gb= 3000000 %%%{-13570,[1]%%%}+%%%{14173,[0]%%%}
FOUND good eval3000000 [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 3000000
lgcd(q) ok 28 3010000
Success q/lgcd(q) as gcd 28 3020000

Evaluation time: 0.59
// Time 0.6
OK pour le pfaffien 8x8
// 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
// Time 0
// Time 0
// Time 0
// 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
// 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
// Total time 3.02
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Success
// Success
// End defining Cond
// Success
// Success
// 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.11
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.15
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// 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
// Total time 0.3
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Success
// Success
// End defining minval
// Success
// End defining trans
// Warning: k,n,l,B,minval,j,trans, declared as global variable(s)
// End defining Zequiv
// Success
// End defining f
// Success
// End defining transC
// Warning: k,n,l,B,minval,j,transC, declared as global variable(s)
// End defining ZequivC
// Warning: n,Zequiv,d,L,f,T,ZequivC, declared as global variable(s)
// End defining elem
// 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.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
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Total time 0.04
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: a, declared as global variable(s)
// Success
// Success
// Success
// Success
// Success
// Success
// Success
// Success
// End defining T
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// 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.01
// Time 0
// Time 0
// Time 0.01
// Time 0
0
0
0
0
0
0
0
0
0
// Time 0.03
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
0
0
0
0
// Time 0.05
// Time 0
// Time 0
// Time 0
// Time 0
0
// Time 0.06
// 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.03
// Time 0.13
// Time 0.2
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
Probabilistic algorithm for determinant
(run proba_epsilon:=0 for a deterministic answer, this is slower).
Error probability is less than 2.08166e-16
// Time 0.14
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.19
// Time 0.19
// Time 0.19
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.35
// Time 0.11
// Time 0.21
// Time 0.12
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.25
// Time 0
// Time 0
// Time 0.01

Evaluation time: 0.74
// Time 0.74
// 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
// Total time 3.06
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: j, declared as global variable(s)
// End defining extr
// Warning: a, declared as global variable(s)
// Success
// End defining monpolyfaddeev
// Success
// Warning: P,x,k, declared as global variable(s)
// Warning: x, declared as global variable(s)
// End defining cf
// Warning: a, declared as global variable(s)
// 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.05
// Time 0
// Time 0
// Time 0
// Time 0.03
// Time 0.01
// Time 0
// Time 0
// Time 0.04
// Time 0
// Time 0
// Time 0.12
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.04
// Time 0.05
// Time 0.22
// Time 0.15
// Time 0
// Time 0
// 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.01
// Time 0.02
// Time 0
// Time 0.06
// Time 0.06
// Time 0
// Time 0.02
// Time 0.03
// Total time 0.95
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: x, declared as global variable(s)
// End defining monlagrange
// Success
// Success
// Success
// Success
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0

Evaluation time: 0.99
// Time 0.99
// Time 0
// Time 0
// Time 0.01
// Time 0.33
// Time 0.34
// Time 0.1
// Time 0.29
pcar OK
// Time 0
pcar OK
// Time 0
// Time 0.05

Evaluation time: 0.82
// Time 0.82
// Time 0
// Time 0.02

Evaluation time: 1.19
// Time 1.19

Evaluation time: 1.19
// Time 1.19
// 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
// Total time 5.35
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Success
// End defining M
// Success
// End defining f
// Warning: a,b,c, declared as global variable(s)
// End defining egal
// Warning: y,z,x,egal,t, declared as global variable(s)
// End defining pointresiduel
// Warning: pointresiduel, declared as global variable(s)
// End defining plus
// Warning: plus, declared as global variable(s)
// End defining nplus
// Success
// End defining egalomega
// Warning: egalomega,plus, declared as global variable(s)
// 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]
Near [0,0], 1/epsilon^2*f([0,0]+epsilon*[1,t])=-3*t roots [0.0]
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],[50,50,0.0,0.0666666666667+0.00148146522433*i],[50,50,0.0,-0.0666666666667+0.0014814977397*i],[50,50,0.0,0.0666666666667+0.00148146522433*i],[50,50,0.0,-0.0666666666667+0.0014814977397*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 
Bad branch, questionnable accuracy
// Time 0.14
// 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.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
// 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: 0.98
// Time 0.98
// 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: 2.9
// Time 2.9
// Total time 4.1
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: t, declared as global variable(s)
// End defining P
// Warning: a,l, declared as global variable(s)
// End defining f
// Success
// End defining puis
// 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.01
// 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.01
// Time 0.02
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// 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
// Time 0
// Time 0
// Time 0.08
// Time 0
// Time 0
// Time 0
// Total time 0.24
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Time 0
// Time 0
// Time 0.01
// Time 0.18
// Time 0.14
// Time 0.2
// Time 0.01
// Time 0
// Time 0.33
// Time 0.01
// Time 0
// Time 0

Evaluation time: 3.69
// Time 3.69
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// 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.3

Evaluation time: 0.47
// Time 0.47

Evaluation time: 0.47
// Time 0.47
// Time 0
// Time 0.14
// Time 0.19
// 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.35
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Success
// End defining orbites
// Warning: X, declared as global variable(s)
// End defining phi
// Warning: P, declared as global variable(s)
// End defining puiss
// Warning: P,x, declared as global variable(s)
// End defining puiss
// Warning: puiss,q, declared as global variable(s)
// End defining testcarre
// Warning: puiss,q, declared as global variable(s)
// End defining inve
// Success
// End defining ordre
// 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.01
// 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.05
Assigning variables b and L
Now e.g. b^200+1 will build an element of L
// Time 0.01
[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
1,2
2,4
2,8
4,16
8,32
16,64
32,128
64,256
// Time 0.01
(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
// 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.03
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.03
// 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
// Time 0.01
// 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
// 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
ca marche
// Time 0
// Total time 0.23
PASS: 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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: x, declared as global variable(s)
// End defining facto1
// Warning: x, declared as global variable(s)
// End defining facto2
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// 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
[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
// 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
[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.01
// 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
// Time 0.02
// Time 0
// Time 0.02
// Total time 0.07
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: x, declared as global variable(s)
// End defining randP
// Warning: x,l, declared as global variable(s)
// End defining berl
// Warning: A,B,rep,p,N,r,LX,Q,P,x,Powmod, declared as global variable(s)
// End defining unfacteur
// Warning: unfacteur,t,tt, declared as global variable(s)
// End defining facteurpseudoirred
// Warning: A, declared as global variable(s)
// 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.07
// Time 0
// 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
// Time 0
// Time 0.01
f est irred
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// 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
x^2+9*x+17,"est un diviseur dans Z"
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Total time 0.13
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: v, declared as global variable(s)
// End defining paff
// Warning: a, declared as global variable(s)
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// 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
Ellipsis of center (-50/7,17/2)
// 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
// 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 0.04
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: q,x, declared as global variable(s)
// Warning: S3h,x, declared as global variable(s)
// Warning: S4h,x, declared as global variable(s)
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
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 []
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],[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 
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.1
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Groebner basis computation time 0.01 Memory 0.023192M
schur row 1 5.00933e-12
Francis algorithm not precise enough for[1.0,-8.26409192534e+36,1.70738038376e+73,8.85244006785e+107]
schur row 1 5.00933e-12
Francis algorithm not precise enough for[1.0,-8.26409192534e+36,1.70738038376e+73,8.85244006785e+107]
schur row 1 5.00933e-12
Francis algorithm not precise enough for[1.0,-8.26409192534e+36,1.70738038376e+73,8.85244006785e+107]
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.01
// 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
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.01
// Time 0
// 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.01
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
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
Ellipsoid of center [0.0,0.0,0.0]
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0 Memory 0.024648M

Evaluation time: 0.46
// Time 0.46
// Time 0
// Time 0
// 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
// Groebner basis computation time 0 Memory 0.024836M
// Time 0.11
// 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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: x,y,z, declared as global variable(s)
// End defining rl
// Warning: rl, declared as global variable(s)
// End defining ql
// Time 0
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0 Memory 0.02208M
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.17
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
c'est bon, le point trouve est bien sur la cubique
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Groebner basis computation time 0 Memory 0.022952M
S est
 bien  lisse. on peut continuer!
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
c'est bon
// 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.13
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0.01
// 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
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.01
// Time 0
c'est bien de degre 27
// Time 0
// Total time 0.43
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: A,x,P, declared as global variable(s)
// Time 0.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Groebner basis computation time 0 Memory 0.022292M
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.01623362426-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.994229813536*i],[40,40,1.0+i,1.01742962193+0.979398867042*i],[40,40,1.0+i,0.98399065966+1.02060113296*i],[40,40,1.0+i,1.01892941475+1.05393446629*i],[40,40,1.0+i,0.985250778258+0.946065533708*i]]

Evaluation time: 0.49
// Time 0.49
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
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.01
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.01
// 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
// Total time 0.82
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// 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.01
// Time 0
Warning: non-square matrix!
// Time 0
// Time 0
// Time 0
Hyperbola of center (1201/284,-523/568)
// Time 0.02
// Groebner basis computation time 0 Memory 0.023672M
// Time 0.16
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0.02
// Time 0
// Time 0
// Time 0
// Time 0

// Groebner basis computation time 0 Memory 0.024376M
// 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.27
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: x,g, declared as global variable(s)
// Warning: x,tmp, declared as global variable(s)
// End defining ST
// Warning: PU, declared as global variable(s)
// Warning: x,j, declared as global variable(s)
// End defining MU
// Warning: x,MU,U, declared as global variable(s)
// End defining scalU
// Warning: scalU, declared as global variable(s)
// Warning: x, declared as global variable(s)
// End defining recip
// 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
[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.01
// Time 0.11
// Time 0.23
// 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.04
// Time 0
// Time 0
// Time 0.01
// 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.06
// Time 0
// Time 0
// Time 0
// Total time 0.48
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Success
// End defining puis
// Warning: x,p, declared as global variable(s)
// End defining periode
// Time 0
// Time 0
// Time 0

Evaluation time: 15.58
// Time 15.58
// 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.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
// 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
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.02
// Time 0
// Total time 15.68
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: S, declared as global variable(s)
// End defining f
// Warning: S, declared as global variable(s)
// End defining f
// Warning: S, declared as global variable(s)
// End defining f
// Warning: S,f, declared as global variable(s)
// End defining h
// Warning: H,rep,w,k,r, declared as global variable(s)
// End defining jeu
// Success
// End defining f
// Warning: H,HE, declared as global variable(s)
// End defining syst
// Warning: syst, declared as global variable(s)
// End defining sol
// Warning: S, declared as global variable(s)
// End defining f
// Warning: sol,S,f,a,b,c,l, declared as global variable(s)
// End defining question
// Warning: j, declared as global variable(s)
// End defining prodlist
// Success
// Warning: prodlist,powerlist,aa,a, declared as global variable(s)
// End defining powerlist
// Warning: j, declared as global variable(s)
// End defining powerlist2
// Warning: S, declared as global variable(s)
// End defining f
// Warning: sol,S,powerlist2,L,f,A,l, declared as global variable(s)
// End defining questionbis
// Success
// End defining f
// Success
// End defining distham
// Warning: distham,v, declared as global variable(s)
// Warning: distham,C, declared as global variable(s)
// Warning: distham,C, declared as global variable(s)
// 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.01
// Time 0
// Time 0
// Time 0
// Time 0
c'est bien nul
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// 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
// Time 0.01
"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.01
// 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
// Time 0
// Time 0.03
// Time 0.03
// Time 0.03
// Total time 0.14
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/
// Giac share root-directory:/usr/share/giac/
Help file /usr/share/giac/doc/en/aide_cas not found
Added 26 synonyms
// Warning: x,f, declared as global variable(s)
// End defining g
// Success
// End defining f
// Warning: f, declared as global variable(s)
// End defining df
// Warning: J, declared as global variable(s)
// End defining f
// Warning: p, declared as global variable(s)
// End defining f
// Warning: x,m,p,dp,u,s,t,d,invdp, declared as global variable(s)
// End defining Dunford
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// 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
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.01
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0
// Time 0.01
// Time 0
// Time 0.04
// Time 0
// Time 0.01
// Time 0
// Time 0.18
// Time 0
// Time 0
// 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.01
// Time 0
// Time 0.01
// Time 0.01
// Time 0
// Total time 0.3
PASS: chk_fhan7
===================
All 30 tests passed
===================
make[1]: quittant le répertoire « /home/parisse/giac-1.2.2/check »
