Maths Olympiad Prep

Library / /36 of 80

Number theory Difficulty 4.8 AIME Prove it North Macedonia

Prove that if nn is an odd natural number, then n3+3n2n3n^3 + 3n^2 - n - 3 is divisible by 48.

Solutions — 2

Solution 1

We have that
n3+3n2n3=n2(n+3)(n+3)=(n+3)(n21)=(n1)(n+1)(n+3). n^3 + 3n^2 - n - 3 = n^2(n+3) - (n+3) = (n+3)(n^2 - 1) = (n-1)(n+1)(n+3).
The numbers n1n-1, n+1n+1, n+3n+3 are even and one from n1n-1, n+1n+1 is divisible by 4. Therefore the given number is divisible by 16. If nn is divisible by 3, then n+3n+3 is divisible by 3. If nn is not divisible by 3, then the remainder is 1 or -1, from where we obtain that one of the numbers n1n-1 and n+1n+1 is divisible by 3. Because of this, the given number is divisible by 316=483 \cdot 16 = 48.

Solution 2

The number nn is odd, so n=2k1n = 2k-1, for kNk \in \mathbb{N}.
(2k1)3+3(2k1)2(2k1)3=8k38k=8k(k21)=8k(k1)(k+1). (2k-1)^3 + 3(2k-1)^2 - (2k-1) - 3 = 8k^3 - 8k = 8k(k^2-1) = 8k(k-1)(k+1).
One of the numbers k1k-1, kk, k+1k+1 is divisible by 3 and at least one of them is even. Because of that 8k(k1)(k+1)8k(k-1)(k+1) is divisible by 832=488 \cdot 3 \cdot 2 = 48.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.