- #1

issacnewton

- 1,026

- 36

I just have some questions on the principle of recursion. We use it to build sequences like Fibonacci etc. In such cases, the recursive rule is additive. So its very simple. But imagine the

problems of constructing the sequences. This comes often in mathematics when the problem asks to prove that such and such sequence exists. There might be problems where recursive

steps can not be written in simple addition of last few terms or using simple mathematical operations. The recursive step might involve complex construction of (n+1)

^{th}

term assuming that n

^{th}term is defined. When recursion is introduced in discrete math books, I see only simple examples. Can you provide examples where complicated steps

are involved in recursive steps in going from n

^{th}term to (n+1)

^{th}

term ? We might talk about the examples outside mathematics, because recursion seems very general idea.

thanks