1*2*3...r is congruent to 0modr!(adsbygoogle = window.adsbygoogle || []).push({});

2*3*4...(r+1) is congruent to 0modr!

3*4*5...(r+1)(r+2) is congruent to 0modr! because the last 2 factors must contain 2.

So if I carry on in this fashion is this sufficient to prove that the product of r consecutive numbers is divisible by r!?

It seems like circular argument to me and so I'm not sure if it's justified.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Product of r consecutive numbers divisible by r!

**Physics Forums | Science Articles, Homework Help, Discussion**