Prev: Reverse Look and Say Sequence
Next: När världen vill tala, så talar den Unicode Yiddish אײראָפּע: פּראָגראַמװאַ ~ MeAmI 11/07/2009 08:31:27 När världen vill tala, så talar den Unicode ~ MeAmI 11/07/2009 08:30:44 UnicodeIUC10 Languages This page contains text in many languages, adver
From: Richard L. Peterson on 6 Nov 2009 09:20
I'm sure it's well known but still: Let p be
prime and C(n,k) be the usual binomial coefficient.
Then C(np,kp) is congruent to C(n,k) mod p.
From: Richard L. Peterson on 29 Nov 2009 14:50
> I'm sure it's well known but still: Let p be
> prime and C(n,k) be the usual binomial coefficient.
> Then C(np,kp) is congruent to C(n,k) mod p.

This turns out to be a weakened statemant
of Wolstenholme's theorem, with "mod p"
where [mod p^3] could have been correctly
placed.
 | 
Pages: 1
Prev: Reverse Look and Say Sequence
Next: När världen vill tala, så talar den Unicode Yiddish אײראָפּע: פּראָגראַמװאַ ~ MeAmI 11/07/2009 08:31:27 När världen vill tala, så talar den Unicode ~ MeAmI 11/07/2009 08:30:44 UnicodeIUC10 Languages This page contains text in many languages, adver