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 - The Fusion of Science and Community**

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!

Loading...

Similar Threads - Product consecutive numbers | Date |
---|---|

I Can you reduce a vector triple product? i.e. (A x (uB x C)) | Jan 19, 2018 |

B Complex products: perpendicular vectors and rotation effects | Dec 17, 2017 |

I Demo of cosine direction with curvilinear coordinates | Dec 6, 2017 |

A Product of 3rd rank tensor with squared vector | Oct 11, 2017 |

B Consecutive integers, each relatively prime to some k | Apr 8, 2016 |

**Physics Forums - The Fusion of Science and Community**