Math, asked by CaptainAmanMishra, 10 months ago

2 to the power k+1>2k
=K+k>k+1
But how???????

Answers

Answered by Antiquebot
0

Step-by-step explanation:

The principle of mathematical induction

Let P(n) be a given statement involving the natural number n such that

(i) The statement is true for n = 1, i.e., P(1) is true (or true for any fixed natural

number) and

(ii) If the statement is true for n = k (where k is a particular but arbitrary natural

number), then the statement is also true for n = k + 1, i.e, truth of P(k) implies

the truth of P(k + 1). Then P(n) is true for all natural numbers n.

4.2 Solved Examples

Short AnswerType

Prove statements in Examples 1 to 5, by using the Principle of Mathematical Induction

for all n ∈ N, that :

Example 1 1 + 3 + 5 + ... + (2n – 1) = n

2

Solution Let the given statement P(n) be defined as P(n) : 1 + 3 + 5 +...+ (2n – 1) =

n

2

, for n ∈ N. Note that P(1) is true, since

P(1) : 1 = 12

Assume that P(k) is true for some k ∈ N, i.e.,

P(k) : 1 + 3 + 5 + ... + (2k – 1) = k

2

Now, to prove that P(k + 1) is true, we have

1 + 3 + 5 + ... + (2k – 1) + (2k + 1)

= k

2

+ (2k + 1) (Why?)

= k

2

+ 2k + 1 = (k + 1)

PLEASE MARK ME AS BRAINLIEST AND FOLLOW ME AND THANK ME AND DON'T FORGET TO GIVE ME MORE POINTS.....PLEASE

Similar questions