What is the difference between recursion and induction? I have heard those terms used interchangeably, but I was wondering if there is a difference between them, and if so, what the difference is.
The difference between recursion and induction
definition
Related Question
- [Math] What’s the difference between list and sequence (as mathematical concepts not programming point of view)
- [Math] the difference between a polynomial and a function or can they be used interchangebly
- [Math] Difference between SPE and SPNE in Game Theory
- Difference between generating functions and formal power series
Best Answer
In my experience:
Extremely often, if a mathematical statement is made about a recursively-defined object, then the proof of that statement will involve induction.
For example, the definition of the Fibonacci numbers is a recursive definition. The proof of the assertion that the $n$th Fibonacci number is at most $2^n$ is an inductive proof.