Question

Problem 1. Prove that for all positive integers n, we have 1 + 3 + ....

Problem 1. Prove that for all positive integers n, we have 1 + 3 + . . . + (2n − 1) = n ^2 .

Homework Answers

Answer #1

P(n): 1 + 3 + 5 + ...+(2n-1)=n 2
For n=1
P(1) = 2n-1<
= 2(1) -1
= 2 -1 =1
n 2 = (1) 2
∴ P(1) is true. ----(equation 1)
Assume that P(k) is true.
So P(k): 1 + 3 + 5 +....(2k -1) = k 2 is true. ----(equation 2)
Now we have to prove that P(k+1) is true.
P(k+1) : 1 + 3 + 5 +....+(2k-1) + [2(k+1)-1]
= k 2 + (2k + 1)
= (k+1) 2
∴ P(k+1) is true whenever p(k) is true.
Hence by equation (1), (2) and by principle of mathematical induction P(n) is true for all natural number 'n'.

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
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
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, ....
prove that n^3+2n=0(mod3) for all integers n.
prove that n^3+2n=0(mod3) for all integers n.
Prove that n − 1 and 2n − 1 are relatively prime, for all integers n...
Prove that n − 1 and 2n − 1 are relatively prime, for all integers n > 1.
For which positive integers n ≥ 1 does 2n > n2 hold? Prove your claim by...
For which positive integers n ≥ 1 does 2n > n2 hold? Prove your claim by induction.
Prove that for fixed positive integers k and n, the number of partitions of n is...
Prove that for fixed positive integers k and n, the number of partitions of n is equal to the number of partitions of 2n + k into n + k parts. show by using bijection
Using induction prove that for all positive integers n, n^2−n is even.
Using induction prove that for all positive integers n, n^2−n is even.
Prove the following using induction: (a) For all natural numbers n>2, 2n>2n+1 (b) For all positive...
Prove the following using induction: (a) For all natural numbers n>2, 2n>2n+1 (b) For all positive integersn, 1^3+3^3+5^3+···+(2^n−1)^3=n^2(2n^2−1) (c) For all positive natural numbers n,5/4·8^n+3^(3n−1) is divisible by 19
Prove that 1−2+ 2^2 −2^3 +···+(−1)^n 2^n =2^n+1(−1)^n+1 for all nonnegative integers n.
Prove that 1−2+ 2^2 −2^3 +···+(−1)^n 2^n =2^n+1(−1)^n+1 for all nonnegative integers n.
1. Prove that 21 divides 3n7 + 7n3 + 11n for all integers n. 2. Prove...
1. Prove that 21 divides 3n7 + 7n3 + 11n for all integers n. 2. Prove that n91 ≡ n7 (mod 91) for all integers n. Is n91 ≡ n (mod 91) for all integers n ?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT