Talk About Network

Google


Register and Login
Nick
Password
Register create new account Sign up is FREE and you can post replies, new topics, bookmark posts and more!
Recover lost password


Education > Math Recreational > A simple puzzle...
Latest [ Topics | Posts ] Archive Post A New Topic Post a Reply
<< Topic < Post Post 1 of 2 Topic 2815 of 2848
Post > Topic >>

A simple puzzle in number theory or combinatorics

by "Larry Hammick" <larryhammick@[EMAIL PROTECTED] > Jul 1, 2008 at 01:09 AM

Let's denote the binomial coefficient
x! / [ (x-y)! y! ]
by C(x,y). Let p be a prime number, n an integer >0, and m an integer >=
0. 
Prove that
C( p^n, mp ) - C( p^(n-1), m )
is divisible by p^n.
 




 2 Posts in Topic:
A simple puzzle in number theory or combinatorics
"Larry Hammick"  2008-07-01 01:09:15 
Re: A simple puzzle in number theory or combinatorics
"Larry Hammick"  2008-07-01 19:24:23 

Post A Reply:
  Go here to Signup

AddThis Feed Button


About - Advertising - Contact - Frequently Asked Questions - Privacy Policy - Terms of Use - Signup

Contact
tan12V112 Thu Aug 28 10:31:06 CDT 2008.