Asked by waqaszahid
: prove by mathematical induction
ā š(š + 1)
šā1
š=0 =
š(šā1)(š+1)
3
for all integers n ā„ 2
ā š(š + 1)
šā1
š=0 =
š(šā1)(š+1)
3
for all integers n ā„ 2
Answers
Answered by
oobleck
geez - learn to type fractions.
case i=0
0*1 = 0
0(-1)(1)/3 = 0
so, P(0) is true
so, assume true for i=0..n-1
The next term is (with i=n)
n(n+1)
add that to both sides and you now just need to show that
ā(0)(1) ... (n-1)(n) + n(n+1) = (n-1)(n)(n+1)/3 + n(n+1)
(n-1)(n)(n+1)/3 + n(n+1) = ((n-1)(n)(n+1) + 3n(n+1))/3
= (n^3 - n + 3n^2 + 3n)/3
= (n^3 + 3n^2 + 2n)/3
= n(n^2+3n+2)/3
= n(n+1)(n+2)/3
= ((n+1)-1)(n+1)((n+1)+1)/3
= P(n)
so, P(n-1) ==> P(n)
case i=0
0*1 = 0
0(-1)(1)/3 = 0
so, P(0) is true
so, assume true for i=0..n-1
The next term is (with i=n)
n(n+1)
add that to both sides and you now just need to show that
ā(0)(1) ... (n-1)(n) + n(n+1) = (n-1)(n)(n+1)/3 + n(n+1)
(n-1)(n)(n+1)/3 + n(n+1) = ((n-1)(n)(n+1) + 3n(n+1))/3
= (n^3 - n + 3n^2 + 3n)/3
= (n^3 + 3n^2 + 2n)/3
= n(n^2+3n+2)/3
= n(n+1)(n+2)/3
= ((n+1)-1)(n+1)((n+1)+1)/3
= P(n)
so, P(n-1) ==> P(n)
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.