Here's the question you clicked on:
LolWolf
Could anyone help out on Number theory? A proof of the following:
\[\binom{pa}{pb}\equiv\binom{a}{b}\mod p^3\]Where p is prime and\[p>2\]
Well, it'd be a grad level number theory class, but it's a problem I was given in a summer camp as part of a worksheet.
haha well idk anything have you tried looking up similar problems or proofs like this http://f2.org/maths/nthproof.html
Eeyup, haven't found anything.
oh, well i'm sorry i won't be of any help then. I just barged in here due to the fact no one else was trying to help. good luck.
It's fine, thanks. Yeah, I haven't been able to solve this problem since quite the time.
and you could try posting this on Yahoo! answers.
Have you tried: http://math.stackexchange.com/ http://mathoverflow.net/ http://www.mathworld.wolfram.com Wikipedia??? (Actually, if you post your question on the talk page of a user who seems knowledgeable, you can occasionally get an answer.)
I've tried the latter of the three, but I was going to post it on Math Overflow/Stack Exchange, haven't yet... thanks, though...