Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
100 views

Class XI Mathematics Chapter:4 Principle of Mathematical Induction

1. The principle of mathematical induction is a method of proof that is useful for proving statements about natural numbers. 2. It involves first proving that the statement holds true for the base case of 1, and then assuming the statement holds for an arbitrary natural number k before proving it holds for k+1. 3. By using inductive reasoning to prove the statement first for the base case and then assuming it holds true for an arbitrary case k before proving it for the next case k+1, the principle of mathematical induction shows the statement holds true for all natural numbers.

Uploaded by

Aniruddh Maheshwari
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
100 views

Class XI Mathematics Chapter:4 Principle of Mathematical Induction

1. The principle of mathematical induction is a method of proof that is useful for proving statements about natural numbers. 2. It involves first proving that the statement holds true for the base case of 1, and then assuming the statement holds for an arbitrary natural number k before proving it holds for k+1. 3. By using inductive reasoning to prove the statement first for the base case and then assuming it holds true for an arbitrary case k before proving it for the next case k+1, the principle of mathematical induction shows the statement holds true for all natural numbers.

Uploaded by

Aniruddh Maheshwari
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1

Class XI Mathematics Chapter:4 Principle of Mathematical Induction Chapter Notes Top Concepts 1. There are two types of reasoning the deductive and inductive. 2. In deduction , given a statement to be proven, often called a conjecture or a theorem, valid deductive steps are derived and a proof may or may not be established. 3. Deduction is the application of a general case to a particular case. 4. Inductive reasoning depends on working with each case, and developing a conjecture by observing incidence till each and every case is observed. 5. Induction means the generalisation from particular cases or facts. 6. Deductive approach is known as the top-down" approach. Given the theorem which is narrowed down to specific hypotheses then to observation. Finally the hypotheses is tested with specific data to get the confirmation (or not) of original theory.

Get the Power of Visual Impact on your side Log on to www.topperlearning.com

2
7. Inductive reasoning works the other way, moving from specific observations to broader generalisations and theories. Informally, this is known as a "bottom up" approach.

8. To prove statements or results formulated in terms of n , where n is a positive integer a principle based on inductive reasoning called Principle of Mathematical Induction is used. 9. The principle of mathematical induction or PMI is one such tool which can be used to prove a wide variety of mathematical statements. Each such statement is assumed as P (n) associated with positive integer n, for which the correctness for the case n = 1 is examined. Then assuming the truth of P (k) for some positive integer k, the truth of P (k + 1) is established. 10.Let p(n) denote a mathematical statement such that (1) p(1) is true (2) p(k + 1) is true whenever p(k) is true. Then the statement is true for all natural numbers n by Principle of Mathematical Induction. 11.Principle of Mathematical Induction is based on Peanos Axiom 12. PMI is based on series of well defined steps so it necessary to verify all of them. 13. PMI can be used to prove the equality, inequalities and divisibility of natural numbers. Key Formulae 1. Sum of n natural numbers: 1+2+3+.+n =

n(n 1) 2

Get the Power of Visual Impact on your side Log on to www.topperlearning.com

3
2.Sum of n2 natural numbers: 12+22+32+n2 =

n(n+1)(2n+1) 6

3. Sum of odd natural numbers:1+3+5+7+(2n-1)=n2

4. Steps of PMI 1) Denote the given statement in terms of n by P(n) (2) Check whether the proposition is true for n = 1 (3) Assume that the proposition result is true for n = k (4) Using p(k), prove that the proposition is true for p(k + 1) 5.Rules of Inequalities (a)If a < b and b < c then a < c. (b) If a < b then a + c < b + c (c) If a < b and c > 0 which means c is +ve then ac < bc. (d) if a < b and c < 0 which means c is +ve then ac > bc.

Get the Power of Visual Impact on your side Log on to www.topperlearning.com

You might also like