The problem is as stated in the title. I've tried factorization, but it doesn't seem to yield anything. Any help is greatly appreciated. Also please don't use modular arithmetic, thank you.
2026-04-03 22:30:42.1775255442
On
Using the fact that $n^3 + 5n$ is divisible by $6$, infer that $n^4 - 2n^3 + 11n^2 + 14n$ is always divisible by $24$
139 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
4
There are 4 best solutions below
0
On
We have $$P(n)=n^4-2n^3+11n^2+14n=n(n+1)(n^2-3n+14)$$
►Reducing modulo $3$ $$P(n)\equiv n(n+1)(n^2-1)=(n-1)(n-1)n(n+1)\equiv 0\pmod 3$$ because has a factor which is product of three consecutive integers.
►Reducing modulo $8$ $$P(n)\equiv n(n+1)(n^2+5n+6)=n(n+1)(n+2)(n+3)\equiv 0\pmod 8$$ because is a product of four consecutive integers.
Thus $P(n)$ is divisible by $24$ for all $n$.
NOTE.- By the way, $n^3+5n$ is always divisible by $6$ (reduce modulo 3).
Hint: Note that \begin{align} n(n-1)(n-2)(n-3)&=n^4-6n^3+11n^2-6n=\color{red}{[n^4-2n^3+11n^2+14n]}-4\color{blue}{[n^3+5n]}. \end{align}