Menu Close

prove-by-mathematical-induction-1-1-3-1-2-5-1-3-7-1-2n-1-2n-1-n-2n-1-




Question Number 9470 by tawakalitu last updated on 09/Dec/16
prove by mathematical induction.  (1/(1.3)) + (1/(2.5)) + (1/(3.7)) + ... + (1/((2n − 1)(2n + 1))) = (n/(2n + 1))
provebymathematicalinduction.11.3+12.5+13.7++1(2n1)(2n+1)=n2n+1
Commented by mrW last updated on 10/Dec/16
please check the question!  should it be following?  (1/(1∙3))+(1/(3∙5))+(1/(5∙7)) + ... + (1/((2n − 1)(2n + 1))) = (n/(2n + 1))
pleasecheckthequestion!shoulditbefollowing?113+135+157++1(2n1)(2n+1)=n2n+1
Commented by tawakalitu last updated on 10/Dec/16
 it should be like this
itshouldbelikethis
Answered by mrW last updated on 10/Dec/16
it is to prove  S(n)=Σ_(k=1) ^n  (1/((2k−1)(2k+1)))=(n/(2n+1))    for n=1:  S(1)=(1/(1×3))=(1/3)=^! (1/(2×1+1))=(1/3)  ⇒it′s true    suppose it′s true for n, we have for n+1  S(n+1)=S(n)+(1/([2(n+1)−1][2(n+1)+1]))  =S(n)+(1/((2n+1)[2(n+1)+1]))  =(n/(2n+1))+(1/((2n+1)[2(n+1)+1]))  =((n[2(n+1)+1]+1)/((2n+1)[2(n+1)+1]))  =((2n^2 +3n+1)/((2n+1)[2(n+1)+1]))  =(((2n+1)(n+1))/((2n+1)[2(n+1)+1]))  =(((n+1))/(2(n+1)+1))  that means it′s also true for n+1.  ⇒it′s true for all n≥1.
itistoproveS(n)=nk=11(2k1)(2k+1)=n2n+1forn=1:S(1)=11×3=13=!12×1+1=13itstruesupposeitstrueforn,wehaveforn+1S(n+1)=S(n)+1[2(n+1)1][2(n+1)+1]=S(n)+1(2n+1)[2(n+1)+1]=n2n+1+1(2n+1)[2(n+1)+1]=n[2(n+1)+1]+1(2n+1)[2(n+1)+1]=2n2+3n+1(2n+1)[2(n+1)+1]=(2n+1)(n+1)(2n+1)[2(n+1)+1]=(n+1)2(n+1)+1thatmeansitsalsotrueforn+1.itstrueforalln1.
Commented by tawakalitu last updated on 10/Dec/16
God bless you sir. i really appreciate your   effort.
Godblessyousir.ireallyappreciateyoureffort.

Leave a Reply

Your email address will not be published. Required fields are marked *