Principle of Induction

Page 1

CLASS XI: PROBLEMS IN MATHEMATICAL INDUCTION PROF. SEBASTIAN VATTAMATTAM

1. Mathematical Principle of Induction Let P (n) denote a statement about n ∈ N. If (1) P (1) is true, and (2) P (k) is true implies that P (k + 1) is true, then P (n) is true for all n ∈ N. Problem 1.1. Prove that 1 + 3 + ... + (2n − 1) = n2 Solution Let P (n) := 1 + 3 + ... + (2n − 1) = n2 (1) P (1) := 1 = 12 , which is true. That is P (1) is true. (2) Suppose P (k) is true. ⇒ 1 + 3 + ... + (2k − 1) = k 2 1 + 3 + ... + (2k − 1) + (2k + 1) = k 2 + 2k + 1 = (k + 1)2 So, P (k + 1) is true. By induction P (n), n ∈ N is true. Problem 1.2. Prove that 12 + 22 + ... + n2 = Date: 25-Sept-2010. 1

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


Turn static files into dynamic content formats.

Create a flipbook
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.