Re: [sage-devel] An "easy looking" computation in AA that sage can't do

2017-03-20 Thread Vincent Delecroix
Dear Jaume, The main reason comes from the following very different algorithmic problem: 1) a one time shot question about an equality of algebraic numbers 2) a lot of arithmetic operations involving algebraic numbers Basically your question belongs to 1) and AA is designed for 2). If you

Re: [sage-devel] An "easy looking" computation in AA that sage can't do

2017-03-20 Thread David Joyner
On Mon, Mar 20, 2017 at 7:51 AM, Jaume Aguade wrote: > Let r > a > 0 be real numbers. Let c = a + r, d = sqrt(r^2-a^2). Then, it is > obvious that 2*a*c=c^2-d^2. However, sage crashes when trying to check this > with a and r rather "simple" algebraic numbers. > > I've found

[sage-devel] An "easy looking" computation in AA that sage can't do

2017-03-20 Thread Jaume Aguade
Let r > a > 0 be real numbers. Let c = a + r, d = sqrt(r^2-a^2). Then, it is obvious that 2*a*c=c^2-d^2. However, sage crashes when trying to check this with a and r rather "simple" algebraic numbers. I've found this while using sage to solve elementary geometric problems involving circles