Theorem
A product of consecutive integers is divisible by
Arithmetic • Number System • Divisibility
Formula
For every integer and every natural number , the product of consecutive integers is divisible by . In particular two consecutive integers have an even product, three have a product divisible by , four by , and five by .
How to use it
- 1Factorise the expression until it is a product of consecutive integers, for example .
- 2Count how many consecutive factors there are; that count is the in .
- 3To check by hand: among consecutive integers one is a multiple of , one of , and so on, and the factors of pile up because every second one is even.
Worked example
Show that is divisible by for every integer .
Step-by-step
- 1
Why: Taking out and grouping turns the polynomial into four consecutive integers.
- 2divides a product of consecutive integers
Why: There are four consecutive factors, so the product is a multiple of .
Answer
It is divisible by for every integer .
Watch out
The factors must be consecutive with no gap: is not always divisible by , for gives . The theorem gives , not more; any larger divisor needs its own argument.
Builds on
Also known as
product of consecutive integers, n^3 - n divisible by 6, product of three consecutive numbers divisible by 6, k consecutive integers divisible by k factorial, n(n+1)(n+2) divisible by 6