Richard Fateman <fateman <at> cs.berkeley.edu> writes:
> The coefficients in a Taylor series may include arbitrary functions; all you
> know is that they are derivatives of something. I do not see why that should
> make solving the zero-equivalence problem easier.
>
> RJF
>
Hello, this question is very far from the initial point. This are not the
needed batteries. About this point:
Well, you are trying to prove that two power series are the same, this is a
recursion problem, perhaps in same cases it can be proved using the recursion
module.
For example:
a(n) = f(n,a(n-1))
b(n) = g(n,b(n-1))
with f and g rationals.
problem
determine whether a(n) = b(n) for all n.
I don't know whether this is an algorithmically solvable problem, I'm doubt.
-M