## anonymous 4 years ago Could anyone help out on Number theory? A proof of the following:

1. anonymous

$\binom{pa}{pb}\equiv\binom{a}{b}\mod p^3$Where p is prime and$p>2$

2. anonymous

what class?

3. anonymous

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.

4. anonymous

haha well idk anything have you tried looking up similar problems or proofs like this http://f2.org/maths/nthproof.html

5. anonymous

Eeyup, haven't found anything.

6. anonymous

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.

7. anonymous

It's fine, thanks. Yeah, I haven't been able to solve this problem since quite the time.

8. anonymous

and you could try posting this on Yahoo! answers.

9. anonymous

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.)

10. anonymous

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...

Find more explanations on OpenStudy