Recent content by sgnagni

Thanks again all. I did finish up that proof (even wrote it up in Maple!) and sent it off. All best, sgnagni

Thanks OK, thanks much to all. I think this gives me enough to proceed. All best, Steve

P.S. I do know how Pascal's triangle is constructed and how it is used in binomial expansions, but wasn't sure how to write this up in a proof. Steven

No problem. I am in a graduate program for secondary mathematics education in New York City. I'm in a "computers for mathematics teachers" course--we're learning to use Maple--and this is part of the first week's assignment. Thanks for your input. Steven

Would I do it as some sort of a matrix? Steve

So, the initial conditions would be n=0, r=0? And then what would I take as my induction hypothesis? Steve

Proof: nCr I am using the definition that nCr = n! / r! (n-r)! Steve P.S. Thank you for your help...

I'm not sure I know how to prove that...

Hello all, 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...