The principle of mathematical induction is a very very useful tool in many proofs, and also in proving some useful formulas. \(\color{Red}{\text{The principle states that any given set of positive integers}}\) has ALL natural numbers if it follows the following conditions -
(i) The first natural number, i.e. 1 is in the set.
(ii) Whenever the integer k is in the set, then k+1 is also in the set.
This looks so obvious, see that if you have been given the two statements simultaneously, then by using (ii) on (i), you can say that 2 is in the set. Then again applying the statement (ii) for 2, we say that (3) will be in the set, so on.
Thus if you prove a certain result for 1 , and then assume that the result is true for k, just prove that it is true for k+1 and you're done !
Same thing you can do for 0, then prove for whole numbers !!!
Problems for practice:-
Prove that the following results hold ∀n∈N
(a)k=0∑n2k=2n+1−1
(b)k=1∑nk=2n(n+1)
(c)k=1∑nk2=6n(n+1)(2n+1)
(d)k=1∑nk3=(k=0∑nk)2
(e)24∣2⋅7n+3⋅5n−5
(f)1⋅2+2⋅3+3⋅4+....+n(n+1)=3n(n+1)(n+2)
I felt like sharing because though it's very well known to all, I am willing to find some good level problems for practicing this foundation builder concept once more... Isn’t this a good revision ?
#NumberTheory
#MathematicalInduction
#CosinesGroup
#ObviousThings
#RevisionOfConcepts
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
@Aditya Raut this is really a nice note for practice...... could you please add more divisibility kinda problems to give a more diverse experience to readers? ........ thanks :)
Log in to reply
Here is some additional problems I found on the internet: http://staffhome.ecm.uwa.edu.au/~00021149/Academy/1995/inductionprobs.pdf
Log in to reply
Thanks - they look like a good selection of induction problems
I actually haven't tried (d) and (f) before since doing math XD
Here's the solution for (e) if someone got stuck.
2×7m+1+3×5m+1−5
=2×7m×7+3×5m×5−5
=14×7m+15×5m−5
=12×7m+12×5m+2×7m+3×5m−5
=12(7m+5m)+24k for some k
=24n+24k for some n
(a) Base Case n=1
k=0∑12k=3
2n+1−1=3
True.
Propose it is true ∀n∈N
Then it must be true for n+1
k=0∑n+12k=k=0∑n2k+2n+1
Substituting the value from our proposal,
∑k=0n2k+2n+1=2n+1−1+2n+1=2n+2−1
Thus, LHS=RHS
Thus, LHS=RHS∀n∈N
Sorry for ugly arrangement.
@Aditya Raut Can you add these to the Induction Wiki page? Thanks!
Nice! I'm too into creating notes and problems set for inequality :) Why not take a look at it @Aditya Raut ? :D
What is e) ?... in d) second summation is it k=0 or k=1 ? Nice collection.
Log in to reply
Thanks, but Just think ! Will adding 0 make any change? In that summation, starting from k=0 will yield same thing as starting with k=1, won't it ? @Niranjan Khanderia
Log in to reply
Thanks.
And e) means prove that for all positive integers n, (2⋅7n+3⋅5n−5) is divisible by 24.
a∣b is the symbol of "a divides b" or "b is divisible by a".
Latex code for the symbol ∣ is "\mid"
Log in to reply
Thanks. I did not get it since I did not assume the parenthesis.
/(good/)
A good level problem is here: Fro every positive integer n, prove that (4n+1)<n+(n+1)<(4n+2). Hence or otherwise, prove that [n+n+1]=[4n+1] where [.] denotes floor function. It is an IITJEE problem.