Let . is a prime number > 2 . Prove that is divisible by . If , Prove that is divisible by .

I've done the first bit, I can't seem to get ideas for the 2nd part of the problem. Please help! :)

Printable View

- Apr 16th 2010, 12:50 AMsashikanthDivisibility by prime
Let . is a prime number > 2 . Prove that is divisible by . If , Prove that is divisible by .

I've done the first bit, I can't seem to get ideas for the 2nd part of the problem. Please help! :) - Apr 16th 2010, 04:16 AMtonio

Check the following:

http://people.brandeis.edu/~gessel/h...pers/wolst.pdf

http://math.uci.edu/~tchoi/notes/wolstenholme.pdf

Wolstenholme's theorem - Wikipedia, the free encyclopedia

This is a very interesting, non-trivial, result.

Tonio - Apr 16th 2010, 05:43 AMsashikanth
Thanks a lot! I was trying to solve the 2nd bit in a manner I solved the first bit, which is a bit different from what was given on the website and I made no headway. Thank you, this is a beautiful solution. :)

- Apr 16th 2010, 06:26 AMaman_cc
- Apr 16th 2010, 07:53 AMchiph588@
- Apr 16th 2010, 10:57 AMsashikanth
The above post outlines my method for the 1st bit. :)