I have the following problem. Out of the runtime analysis of an divide and conquer algorithm I got the following formula for the necessary flops:
flops(n): = (89+1/3)*n^3 + 2 * flops(n/2)
I want to sum it up and to remove the recursion with Maple. But I do not get it working. Everytime Maple complains: Error, (in flops) too many levels of recursion
How can this be done?