If there is an algorithm for simplify_full(), then presumably it could be programmed in Lisp, and incorporated in Maxima.
You are invited to do so. I assume that there are examples for which it doesn't do what you want, and so you could argue that it should do more work. I also assume there are examples for which it works for too long and does not provide any further simplification, and so you could argue that it should do less work. Here's a simplifier problem: simplify 1/16*(10*sin(x)-5*sin(3*x)+17*sin(5*x)) using commands in Sage. The answer could have as little as 17 characters. On Feb 12, 12:27 am, Simon King <k...@mathematik.uni-jena.de> wrote: > On Feb 12, 7:23 am, rjf <fate...@gmail.com> wrote: > > > How much work do you think Maxima should do to try to determine for > > arbitrary f, if f(x)>0 or not? > > Perhaps the same amount of work as for the successful solution of the > following two problems: > sage: bool((sin(x)^2+cos(x)^2).simplify_full()>0) > True > sage: bool(sin(x)^2+cos(x)^2==1) > True > > Cheers, > Simon --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
