Menu Close

Show-that-1n-3-2n-3n-2-is-divisible-by-2-and-3-for-all-positive-integers-n-




Question Number 67501 by TawaTawa last updated on 28/Aug/19
Show that  1n^3  + 2n + 3n^2   is divisible by 2 and 3 for all positive integers n.
Showthat1n3+2n+3n2isdivisibleby2and3forallpositiveintegersn.
Commented by Prithwish sen last updated on 28/Aug/19
Another approch  We know that  (1+x)^n =1+nx+ ((n(n−1))/(2!))x^2  + ((n(n−1)(n−2))/(3!))x^(3 +)   ........+((n(n−1)(n−2).......(n−r+1))/(r!)) x^r +.....+x^n   Now as far n∈N the coefficients of the expression  are integers  ∴           n(n−1)     must be divisible by 2! = 2  n(n−1)(n−2)        ′′         ′′        ′′             ′′   3! = 6  ...............................  n(n−1)(n−2)....(n−r+1)  must be divisible by r!  Now by putting n = n+2 at n(n−1)(n−2) we get ,  n(n+1)(n+2) must be divisible by 3! = 6 proved.
AnotherapprochWeknowthat(1+x)n=1+nx+n(n1)2!x2+n(n1)(n2)3!x3+..+n(n1)(n2).(nr+1)r!xr+..+xnNowasfarnNthecoefficientsoftheexpressionareintegersn(n1)mustbedivisibleby2!=2n(n1)(n2)3!=6.n(n1)(n2).(nr+1)mustbedivisiblebyr!Nowbyputtingn=n+2atn(n1)(n2)weget,n(n+1)(n+2)mustbedivisibleby3!=6proved.
Commented by TawaTawa last updated on 28/Aug/19
God bless you sir
Godblessyousir
Answered by Rasheed.Sindhi last updated on 28/Aug/19
n^3 +3n^2 +2n=n(n+1)(n+3)  For 2:n∈E ∨ n∈O   n ∈E⇒  2 ∣ n⇒2 ∣ n(n+1)(n+2)          ⇒2 ∣ n^3 +3n^2 +2n  n∈O⇒n+1∈E⇒2 ∣ n+1 ⇒2 ∣ n(n+1)(n+2)          ⇒2 ∣ n^3 +3n^2 +2n  For 3:n=3k or n=3k+1 or n=3k+2     ∀ k∈Z  n=3k⇒3∣n⇒3∣n(n+1)(n+2)                ⇒3∣n^3 +3n^2 +2n  n=3k+1⇒n+2=3k+1+2=3(k+1)                3∣n+2⇒3∣n(n+1)(n+2)                ⇒3∣n^3 +3n^2 +2n  n=3k+2⇒n+1=3k+3=3(k+1)             ⇒3∣n+1⇒3∣n(n+1)(n+2)                ⇒3∣n^3 +3n^2 +2n  Hence 2∣n^3 +3n^2 +2n ∧ 3∣n^3 +3n^2 +2n
n3+3n2+2n=n(n+1)(n+3)For2:nEnOnE2n2n(n+1)(n+2)2n3+3n2+2nnOn+1E2n+12n(n+1)(n+2)2n3+3n2+2nFor3:n=3korn=3k+1orn=3k+2kZn=3k3n3n(n+1)(n+2)3n3+3n2+2nn=3k+1n+2=3k+1+2=3(k+1)3n+23n(n+1)(n+2)3n3+3n2+2nn=3k+2n+1=3k+3=3(k+1)3n+13n(n+1)(n+2)3n3+3n2+2nHence2n3+3n2+2n3n3+3n2+2n
Commented by TawaTawa last updated on 28/Aug/19
God bless you sir
Godblessyousir
Answered by petrochengula last updated on 28/Aug/19
n^3 +2n+3n^2 =n(n+1)(n+2)  let the statement p(n) given as p(n):n^3 +2n+3n^2  is divisible by 2 and 3, ∀nεz^+   we observe that p(1) is true, since 1^2 +2+3=6 is divisible by 2 and 3  assume that p(n) is true for some integer k  p(k):k^3 +2k+3k^(2 )  is divisible by 2 and 3 such that k^3 +2k+3k^2 =2p and k^3 +2k+3k^2 =3q where p,qεZ^+ . Now to prove that p(k+1):(k+1)^3 +2(k+1)+3(k+1)^2   1^(st ) case  we have to show that p(k+1) is divisible by 2  (k+1)^3 +2(k+1)+3(k+1)^2 =k^3 +3k^2 +3k+2k+2+3(k^2 +2k+1)  =k^3 +2k+3k^2 +2(k^2 +3k+2)+(k+1)(k+2)  but k^3 +2k+3k^2 =2p ⇒k(k+1)(k+2)=2p⇒(k+1)(k+2)=((2p)/k)  (k+1)^3 +2(k+1)+3(k+1)^2 =2p+2(k^2 +3k+2)+((2p)/k)  =2(p+k^2 +3k+2+(p/k))=2m  2^(nd ) case  We have to show that p(k+1) is divisible by 3  (k+1)^3 +2(k+1)+3(k+1)^2 =k^3 +2k+3k^2 +3k^2 +9k+6  =3q+3(k^2 +3k+2)  =3(q+k^2 +3k+2)  Thus p(k+1) is true,whenever p(k) is true  Hence by the principle of mathematical induction p(n) is true for all positive integers number n.
n3+2n+3n2=n(n+1)(n+2)letthestatementp(n)givenasp(n):n3+2n+3n2isdivisibleby2and3,nϵz+weobservethatp(1)istrue,since12+2+3=6isdivisibleby2and3assumethatp(n)istrueforsomeintegerkp(k):k3+2k+3k2isdivisibleby2and3suchthatk3+2k+3k2=2pandk3+2k+3k2=3qwherep,qϵZ+.Nowtoprovethatp(k+1):(k+1)3+2(k+1)+3(k+1)21stcasewehavetoshowthatp(k+1)isdivisibleby2(k+1)3+2(k+1)+3(k+1)2=k3+3k2+3k+2k+2+3(k2+2k+1)=k3+2k+3k2+2(k2+3k+2)+(k+1)(k+2)butk3+2k+3k2=2pk(k+1)(k+2)=2p(k+1)(k+2)=2pk(k+1)3+2(k+1)+3(k+1)2=2p+2(k2+3k+2)+2pk=2(p+k2+3k+2+pk)=2m2ndcaseWehavetoshowthatp(k+1)isdivisibleby3(k+1)3+2(k+1)+3(k+1)2=k3+2k+3k2+3k2+9k+6=3q+3(k2+3k+2)=3(q+k2+3k+2)Thusp(k+1)istrue,wheneverp(k)istrueHencebytheprincipleofmathematicalinductionp(n)istrueforallpositiveintegersnumbern.
Commented by TawaTawa last updated on 28/Aug/19
God bless you sir
Godblessyousir

Leave a Reply

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