You are not logged in.
Hi!I have a recursive formula like this:a0 = 0a3 = 1a4 = 3a5 = 6a6 = 10an+1 = an + (n-1) n >= 3I need to find a formula for this recursion and prove it by induction. How would i do this?
I don't see what your asking. Something seems jumbled.All I see is that your example keeps increasing by an amount that goes up by one each time.
Last edited by John E. Franklin (2005-09-28 05:48:00)
Powered by FluxBB