I would put what Waldek said a little differently. FriCAS treats kernels in Expression in equivalence classes stored in a cache that is created dynamically. FriCAS chooses the first encountered kernel in each class as the representative of all kernels in a given class. It does not attempt to choose the "simplest" representative of the class - in part at least because the notion of which kernel is simplest is not well defined.
On 1 February 2017 at 20:45, oldk1331 <[email protected]> wrote: > To Waldek and Kurt: > > Thanks for your reply. Now I think it's a bit understandable: > it's like a semi-auto "setSimplifyDenomsFlag(true)". > > If you set "setSimplifyDenomsFlag(true)", then there's nothing > confusing. But Kurt's example is interesting. > > -- > 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 [email protected]. > To post to this group, send email to [email protected]. > Visit this group at https://groups.google.com/group/fricas-devel. > For more options, visit https://groups.google.com/d/optout. -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
