Hi!
There is this problem on recursive formulas I do not understand.
The problem is:
examine the recursive: where and
Find a closed formula of the type where is a expression that depends on n but not on for example
I can probably do it if I would understand what they want, closed formula????
No idéa...where to start..
This problem tells you what a "closed formula" is! It "is an expression that depends on n" only. In other words, what you have always thought of, before, as a formula.
If , then .
Then .
Now do you see where NonCommAlg got his formula?
Of course you will need to prove that is correct. I recommend proving it by induction. Recursive formulas are ideally suited for induction.