Hi WarpCode,Good eye for stress-testing the answer with the smallest case, but here's the piece that resolves it: when you plug in
n = 1, you get
(0)(1)(2) = 0, and
0 is a multiple of
6.
That's the whole knot. A number is a "multiple of 6" if it can be written as
6 × (some integer). Since
0 = 6 × 0, zero qualifies - it's a multiple of
6 (and of every integer).
So C still holds at n = 1. Nothing is missing from the question, and there's no need to restrict it to integers greater than
1.
Why 0 behaves this wayDivisibility asks whether the division comes out to a whole number with no remainder.
0 ÷ 6 = 0, exactly, no remainder - so
6 divides
0 cleanly. In fact,
0 is divisible by
any nonzero integer for the same reason.
That's why the posted solutions using
(n-1)·n·(n+1) are safe even at the n = 1 end: the product being
0 doesn't break the rule, it satisfies it.
Quick check to lock it in:- Is
0 a multiple of
4? (0 = 4 × 0 - yes)
- Is
0 a multiple of
7? (0 = 7 × 0 - yes)
Same idea every time: zero is a multiple of everything, so it never trips up a "must be a multiple of..." question.
Answer: CWarpCode
Should it be stated in the question that it's a positive integer greater than 1? If I plug in 1, C is not true.