|
|
last edited 9 years ago by test1 |
1 2 3 | ||
Editor: test1
Time: 2015/06/19 15:52:44 GMT+0 |
||
Note: |
added:
From test1 Fri Jun 19 15:52:44 +0000 2015
From: test1
Date: Fri, 19 Jun 2015 15:52:44 +0000
Subject:
Message-ID: <20150619155244+0000@axiom-wiki.newsynthesis.org>
Status: open => duplicate
I just ran across the following astonishing bug:
s :=-x^3+1/6*(-2*sqrt(6)+2*sqrt(3)+3*sqrt(2))*x^2+1/6*((sqrt(3)+sqrt(2))*sqrt(6)-2*sqrt(2)*sqrt(3))*x-sqrt(2)*sqrt(3)*sqrt(6)/6
(1) |
factor s
(2) |
This is the same problem as 191ExquoAndThereforeGcdCannotHandleUPXEXPRINT. Namely, the roots sqrt(2), sqrt(3) and sqrt(6) are dependent, which cause problems because sqrt(6)^2 = 6 = 23 = sqrt(2)^2sqrt(3)^2 but we do not know if sqrt(6) = sqrt(2)sqrt(3) or sqrt(6) = -sqrt(2)sqrt(3). This effectively creates ring with zero divisors, while factoring/GCD routines assume a field.
There are several things to notice, in fact:
sqrt
denotes the positive square root.Martin
s :=x^2-sqrt(2)*sqrt(3)*sqrt(6)
(3) |
and it seems to occur in 'InnerAlgFactor?':
\begin{axiom} )tr InnerAlgFactor )ma factor(s) \end{axiom}