Just some more observations...
That the following expression
r :=
(884*sqrt(5)-1975)*sqrt((-sqrt(-16808278856375992320000000*sqrt(5)-37584454108531654656000000)-2239742361600*sqrt(5)-5008250880000)/2)
I get for
s := recursiveRootSimplification(r)
the value shown after the = sign, but
(s=(884*sqrt(5)-1975)*sqrt(((-19599*sqrt(-3758419364587713331200000)-43896710544998400)*sqrt(5)-43825*sqrt(-3758419364587713331200000)-98156708997120000)/39198))@Boolean
returns false.
I do not complain about the "false", but would rather like to ask how I
can convince recursiveRootSimplification to apply this kind of
simplification that obviously the interpreter is applying when I enter
the actual expression that I get back from recursiveRootSimplification(r)?
There is another interesting thing about r and s.
Obviously, FriCAS tries to make the denominator rational.
While developing recursiveRootSimplification I kept the value of r
without recreating the kernels and later hat problems to compute
1/(r+1). That did not finish. Unfortunately, I cannot reproduce it
anymore, but what actually happens to expressions that have kernels that
where once in the kernel cache but are not anymore after the )compile
command cleared that cache?
Thank you
Ralf
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to fricas-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/9e18960a-52c9-4d72-af01-aef19fc59ff8%40hemmecke.org.
