Question

In: Advanced Math

By induction: 1. Prove that Σni=1(2i − 1) = n2 2. Prove thatΣni=1 i2 = n(n+1)(2n+1)...

By induction:

1. Prove that Σni=1(2i − 1) = n2

2. Prove thatΣni=1 i2 = n(n+1)(2n+1) / 6 .

Solutions

Expert Solution

i think u want this proof. your question 1 is not clear. Also 2nd is not clear

but i tried my best
1 2 + 2 2 + 3 2 + ... + n 2 = n (n + 1) (2n + 1)/ 26
STEP 1: We first show that p (1) is true.
Left Side = 1 2 = 1
Right Side = 1 (1 + 1) (2*1 + 1)/ 6 = 1
Both sides of the statement are equal hence p (1) is true.
STEP 2: We now assume that p (k) is true
1 2 + 2 2 + 3 2 + ... + k 2 = k (k + 1) (2k + 1)/ 6
and show that p (k + 1) is true by adding (k + 1) 2 to both sides of the above statement
1 2 + 2 2 + 3 2 + ... + k 2 + (k + 1) 2 = k (k + 1) (2k + 1)/ 6 + (k + 1) 2
Set common denominator and factor k + 1 on the right side
= (k + 1) [ k (2k + 1)+ 6 (k + 1) ] /6
Expand k (2k + 1)+ 6 (k + 1)
= (k + 1) [ 2k 2 + 7k + 6 ] /6
Now factor 2k 2 + 7k + 6.
= (k + 1) [ (k + 2) (2k + 3) ] /6
We have started from the statement P(k) and have shown that
1 2 + 2 2 + 3 2 + ... + k 2 + (k + 1) 2 = (k + 1) [ (k + 2) (2k + 3) ] /6
Which is the statement P(k + 1).


Related Solutions

Prove these scenarios by mathematical induction: (1) Prove n2 < 2n for all integers n>4 (2)...
Prove these scenarios by mathematical induction: (1) Prove n2 < 2n for all integers n>4 (2) Prove that a finite set with n elements has 2n subsets (3) Prove that every amount of postage of 12 cents or more can be formed using just 4-cent and 5-cent stamps
Prove the following by induction: 2 + 4 + 6 + …+ 2n = n(n+1) for...
Prove the following by induction: 2 + 4 + 6 + …+ 2n = n(n+1) for all integers n Show all work
2. [6 marks] (Induction) Prove that 21 divides 4n+1 + 5 2n−1 whenever n is a...
2. [6 marks] (Induction) Prove that 21 divides 4n+1 + 5 2n−1 whenever n is a positive integer. HINT: 25 ≡ 4(mod 21)
Use a mathematical induction for Prove a^(2n-1) + b^(2n-1) is divisible by a + b, for...
Use a mathematical induction for Prove a^(2n-1) + b^(2n-1) is divisible by a + b, for n is a positive integer
Using an induction proof technique, prove that the sum from i=1 to n of (2i-1) equals...
Using an induction proof technique, prove that the sum from i=1 to n of (2i-1) equals n*n
5. Without using the method of mathematical induction, prove that 5^n − 3^n + 2n is...
5. Without using the method of mathematical induction, prove that 5^n − 3^n + 2n is divisible by 4 for all natural n.
Show that the number of labelled simple graphs with n vertices is 2n(n-1)/2. (By induction way!)
Show that the number of labelled simple graphs with n vertices is 2n(n-1)/2. (By induction way!)
Let n be a positive integer. Prove that two numbers n2+3n+6 and n2+2n+7 cannot be prime...
Let n be a positive integer. Prove that two numbers n2+3n+6 and n2+2n+7 cannot be prime at the same time.
(1)Prove 6^(2n)-4^(2n) must be a mutiple of 20 (2)Prove 6^(2n)+4^(2n)-2 must be a multiple of 50
(1)Prove 6^(2n)-4^(2n) must be a mutiple of 20 (2)Prove 6^(2n)+4^(2n)-2 must be a multiple of 50
1a. Proof by induction: For every positive integer n, 1•3•5...(2n-1)=(2n)!/(2n•n!). Please explain what the exclamation mark...
1a. Proof by induction: For every positive integer n, 1•3•5...(2n-1)=(2n)!/(2n•n!). Please explain what the exclamation mark means. Thank you for your help! 1b. Proof by induction: For each integer n>=8, there are nonnegative integers a and b such that n=3a+5b
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT