Hello all out there. I am just new here. I have a question: I am using in my daily job Wolfram Mathematica 9. I am dealing now with a recurrence equation that when inserted into Table statement produces a stack overflow essentially. How can i evaluate the ricurrence eqn. without incurring into this problem? The eqn. has also symbolic parameter so it has to be evaluated symbolically. Thanks anyone for help. Alessandro
Thanks Frank i saw already that but my case do not have constant parameter so it cannot be solved like the examples shown. But thanks anyhow
It might help if you use Simplify or FullSimplify after each step to reduce the amount of memory used by the results.
Ok i will try that simplify thanks