Hello there,
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:
![]()


LinkBack URL
About LinkBacks
