• Brainly User
1) we first establish that proposition P(n) is true for lowest possible value of the positive integer n.
2) we assume P(k) is true and P(k+1) is also true.
1 5 1
To prove a problem through mathematical induction we can only prove it for natural no. first we prove it for 1 then we prove if it is true for n where nbelongs to N itwill be true for n+1. so when we proved it for 1 it become true for(1+1)i.e.2; if it is true for 2 it will be true for (2+1)i.e.3 and so on
so we can conclude that it will be true for all natural no.