Hi, How to show that ????
Follow Math Help Forum on Facebook and Google+
I take it are the prime numbers? This is Wilsons theorem. For any there's an with (mod p). Further, iff or . Hence, in , the numbers forming this product can be cancelled in pairs, apart from and . Hence result.
Originally Posted by Deadstar I take it are the prime numbers? This is Wilsons theorem. For any there's an with (mod p). I'm afraid this doesn't work: this presumes you already know p is prime, which is precisly what you're tring to prove! Further, i ff or . Hence, in , the numbers forming this product can be cancelled in pairs, apart from and . Hence result. .
Originally Posted by bhitroofen01 Hi, How to show that ???? Suppose , contradiction! Tonio
Originally Posted by tonio Suppose , contradiction! Tonio Oh yeah! I never noticed the =>. I misread it as prove Wilsons formula with prime numbers...
View Tag Cloud