nntp2http.com
Posting
Suche
Optionen
Hilfe & Kontakt

A simple puzzle in number theory or combinatorics

Von: Larry Hammick (larryhammick@telus.net) [Profil]
Datum: 01.07.2008 03:09
Message-ID: <%sfak.1158$7%6.120@edtnps82>
Newsgroup: alt.math.recreationalsci.math
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.



[ Auf dieses Posting antworten ]