Question

(a) use mathematical induction to show that 1 + 3 +.....+(2n + 1) = (n +...

(a) use mathematical induction to show that 1 + 3 +.....+(2n + 1) = (n + 1)^2 for all n e N,n>1.(b) n<2^n for all n,n is greater or equels to 1

Homework Answers

Answer #1

To prove by Mathematical Induction:

                           (1)

Proof:
Step 1:

for n = 1:
LHS = 1 + 3 = 4

RHS = (1 + 1)2 = 4

So, (1) is satisfied for n = 1

Step 2:
Assume the formula to be true for n = k.

i.e.,

Step 3:

To prove that (1) is true for n = k+1 also.

i.e.,

To prove:

                         (2)

Step 4:

LHS of (2) is:

= RHS of equation (2)

Thus, it is proved that the given relatio (1) is true for n = k +1 if it true for n = k.

But, we have proved that it is true for n = 1.

So, by mathematical induction, it is true for all n, for n 1

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Use Mathematical Induction to prove that 3 | (n^3 + 2n) for all integers n =...
Use Mathematical Induction to prove that 3 | (n^3 + 2n) for all integers n = 0, 1, 2, ....
Use mathematical induction to prove that for each integer n ≥ 4, 5n ≥ 2 2n+1...
Use mathematical induction to prove that for each integer n ≥ 4, 5n ≥ 2 2n+1 + 100.
(10) Use mathematical induction to prove that 7n – 2n  is divisible by 5 for all n...
(10) Use mathematical induction to prove that 7n – 2n  is divisible by 5 for all n >= 0.
Show by induction that 1 + 3 + 5 + · · · + (2n −...
Show by induction that 1 + 3 + 5 + · · · + (2n − 1) = n^2 for all positive integer n
use mathematical induction to show that n> 2^n for all e n,n>4
use mathematical induction to show that n> 2^n for all e n,n>4
Use the Principle of Mathematical Induction to show that the given statement is true for all...
Use the Principle of Mathematical Induction to show that the given statement is true for all natural numbers n. 2 + 5 + 8 + ... + (3n - 1) = 1/2n (3n + 1)
1. Use mathematical induction to show that, ∀n ≥ 3, 2n2 + 1 ≥ 5n 2....
1. Use mathematical induction to show that, ∀n ≥ 3, 2n2 + 1 ≥ 5n 2. Letting s1 = 0, find a recursive formula for the sequence 0, 1, 3, 7, 15,... 3. Evaluate. (a) 55mod 7. (b) −101 div 3. 4. Prove that the sum of two consecutive odd integers is divisible by 4 5. Show that if a|b then −a|b. 6. Prove or disprove: For any integers a,b, c, if a ∤ b and b ∤ c, then...
Use mathematical induction to prove that 12+22+32+42+52+...+(n-1)2+n2= n(n+1)(2n+1)/6. (First state which of the 3 versions of...
Use mathematical induction to prove that 12+22+32+42+52+...+(n-1)2+n2= n(n+1)(2n+1)/6. (First state which of the 3 versions of induction: WOP, Ordinary or Strong, you plan to use.) proof: Answer goes here.
Please note n's are superscripted. (a) Use mathematical induction to prove that 2n+1 + 3n+1 ≤...
Please note n's are superscripted. (a) Use mathematical induction to prove that 2n+1 + 3n+1 ≤ 2 · 4n for all integers n ≥ 3. (b) Let f(n) = 2n+1 + 3n+1 and g(n) = 4n. Using the inequality from part (a) prove that f(n) = O(g(n)). You need to give a rigorous proof derived directly from the definition of O-notation, without using any theorems from class. (First, give a complete statement of the definition. Next, show how f(n) =...
Show by induction that 1+3+5+...+(2n-1) = n^2 for all n in the set of Natural Numbers
Show by induction that 1+3+5+...+(2n-1) = n^2 for all n in the set of Natural Numbers