a) Let p be an odd prime and let a = (2j-1) = (1)(3)(5)....(p-2) Prove that = mod p (Product is from j=1 to (p-1)/2) b) Let p be a prime. Prove that = 2 mod p is 2p choose p, as in statistics. so
Follow Math Help Forum on Facebook and Google+
Hint for a: Wilson theorem.
Originally Posted by Also sprach Zarathustra Hint for a: Wilson theorem. Wilson's crossed my mind but I don't see how to work (p-1)! into the proof
Another hint(or solution)... , so ...
View Tag Cloud