Hint : Since you probably missed some degrees in the expression (8n−14n+27) , I can only complete part of the task.
Using mathematical induction, we prove that (n3+11n) is divisible by 6 for n∈Z+ .
1 STEP: Induction basis
n=1→13+11⋅1=12=2⋅6⋮6
2 STEP : Inductive guess
For allk≤n(k3+11k)⋮6
3 STEP : Inductive transition, it is necessary to prove that
Fork=n+1→((n+1)3+11(n+1))⋮6
(n+1)3+11(n+1)=n3+3n2+3n+1+11n+11==(n3+11n)+(3n2+3n)+12==divided into 6 hypothesis(n3+11n)+3n(n+1)+6⋅2
It remains to understand why 3n(n+1)⋮6 .
1 case : n=2k
3n(n+1)=3⋅(2k)⋅(2k+1)=6⋅(k(2k+1))⋮6
2 case : n=2k+1
3n(n+1)=3⋅(2k+1)⋅(2k+1+1)=6⋅((k+1)(2k+1))⋮6
Conclusion,
(n+1)3+11(n+1)=(n3+11n)+3n(n+1)+6⋅2⋮6Hint : Since you probably missed some degrees in the expression
(8n−14n+27) , I can only complete part of the task.
Using mathematical induction, we prove that (n3+11n) is divisible by 6 for n∈Z+ .
1 STEP: Induction basis
n=1→13+11⋅1=12=2⋅6⋮6
2 STEP : Inductive guess
For allk≤n(k3+11k)⋮6
3 STEP : Inductive transition, it is necessary to prove that
Fork=n+1→((n+1)3+11(n+1))⋮6
(n+1)3+11(n+1)=n3+3n2+3n+1+11n+11==(n3+11n)+(3n2+3n)+12==divided into 6 hypothesis(n3+11n)+3n(n+1)+6⋅2
It remains to understand why 3n(n+1)⋮6 .
1 case : n=2k
3n(n+1)=3⋅(2k)⋅(2k+1)=6⋅(k(2k+1))⋮6
2 case : n=2k+1
3n(n+1)=3⋅(2k+1)⋅(2k+1+1)=6⋅((k+1)(2k+1))⋮6
Conclusion,
(n+1)3+11(n+1)=(n3+11n)+3n(n+1)+6⋅2⋮6Hint : Since you probably missed some degrees in the expression
(8n−14n+27) , I can only complete part of the task.
Using mathematical induction, we prove that (n3+11n) is divisible by 6 for n∈Z+ .
1 STEP: Induction basis
n=1→13+11⋅1=12=2⋅6⋮6
2 STEP : Inductive guess
For allk≤n(k3+11k)⋮6
3 STEP : Inductive transition, it is necessary to prove that
Fork=n+1→((n+1)3+11(n+1))⋮6
(n+1)3+11(n+1)=n3+3n2+3n+1+11n+11==(n3+11n)+(3n2+3n)+12==divided into 6 hypothesis(n3+11n)+3n(n+1)+6⋅2
It remains to understand why 3n(n+1)⋮6 .
1 case : n=2k
3n(n+1)=3⋅(2k)⋅(2k+1)=6⋅(k(2k+1))⋮6
2 case : n=2k+1
3n(n+1)=3⋅(2k+1)⋅(2k+1+1)=6⋅((k+1)(2k+1))⋮6
Conclusion,
(n+1)3+11(n+1)=(n3+11n)+3n(n+1)+6⋅2⋮6