>>>>> "Rupert" == Rupert Swarbrick <rswarbrick at gmail.com> writes:
Rupert> Robert Dodier <robert.dodier at gmail.com> writes:
>> About recognizing df * f, if there are multiple terms, there are many
>> ways of grouping them into f and df (and you'll presumably want to
>> omit any terms not dependent on x). I'm sure it's possible to
>> enumerate them and cycle through them, but I don't see a way to get
>> Maxima to help very much -- as far as I can see, you'll have to do
>> most of the work.
Rupert> I was thinking about this. Could we not extend the pattern matcher to
Or maybe we could expose the schatchen matcher that is used internally
by maxima for the indefinite integration and special integration
routines. I don't know if it's better or worse than the matcher we
have now, though, but it can match things like a*x^r1*(c1+c2*x^q)^r2.
Don't know if the current matcher can do that.
Ray