Hello all,(adsbygoogle = window.adsbygoogle || []).push({});

I've been asked for a graduate level course to do a proof using induction that shows that nCr always turns out to be an integer. I thought that I might use Pascal's triangle somehow and the fact that nCr is equal to n! / r!(n-r)! (I saw a brief explanation of this while doing a web search) but am not sure how to lay out the proof. This seems really really complicated... am I wrong? Any help will be much appreciated.

Best regards,

SG

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

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!

# Proof by induction: nCr always an integer

Loading...

Similar Threads for Proof induction always |
---|

I Hilbert's omega rule, induction, omega-consistency |

I Proof that BB(k) grows faster than any computable function |

I An easy proof of Gödel's first incompleteness theorem? |

I Cantor's decimal proof that (0,1) is uncountable |

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