Four consecutive integers

by @ancient-tree · difficulty 8/100

Algebra

Status: Unreviewed

Unreviewed. Fresh or lightly reviewed. Read it, try it, improve it.

Show that the product of four consecutive integers is always one less than a square.

In other words, if nn is an integer, show that

n(n+1)(n+2)(n+3)n(n+1)(n+2)(n+3)

can always be written in the form m21m^2-1, where mm is an integer.

Proofs

1

The most useful proof appears first. At 3 useful votes, it is marked community accepted.

Proof by @ancient-tree

0 useful votes

The idea is to multiply nn and n+3n+3 together, then n+1n+1 and n+2n+2 together:

n(n+1)(n+2)(n+3)=(n2+3n)(n2+3n+2).n(n+1)(n+2)(n+3)=\left(n^2+3n\right)\left(n^2+3n+2\right).

If we set x=n2+3nx=n^2+3n, the product becomes

x(x+2).x(x+2).

Now

x(x+2)=x2+2x=(x+1)21.x(x+2)=x^2+2x=(x+1)^2-1.

Therefore

n(n+1)(n+2)(n+3)=(n2+3n+1)21,n(n+1)(n+2)(n+3)=\left(n^2+3n+1\right)^2-1,

which is indeed one less than a square.

Discuss proof · 0

Discussion

Sign in to start this problem and unlock the discussion after 24h.