4 ms·
To prove something for all n you need to do mathematical induction: First prove that something is true for some n, usually n = 1. Then prove that if it's true
by _nalply 4y ago
To prove something for all n you need to do mathematical induction:
First prove that something is true for some n, usually n = 1.
Then prove that if it's true for n it's for n + 1, too.
Boom. It's true for all n.
But the second step is sometimes very hard or even perhaps impossible.
- Chinjut 4y agoInduction is one way to prove something for all n but hardly the only way.
- galaxyLogic 4y ago> Then prove that if it's true for n it's for n + 1, too. Or you might be able to prove that it is true for n + 2 but not be able to prove it is true for n + 1. Right?