by Wilson's theorem.
It's the first time I am posting and I think it is a worth mentioning problem.
Here it is:
Prove that the central binomial coefficient of a prime number when divised by the prime's second power gives as remainder two. In other (more mathematical) words:
I can't find the solution yet... Thanks for trying... That was one of the questions of a pregraduate Discrete Mathematics exam and I thought it was easy enough to solve it. But now, I suppose it is NOT!
If I expand the factorial I'm getting this:
Should I search for a connection between and equivalent ? and prove something like