The Student Room Group
Competition - post a photo you've taken of nature >>
Competition - post a photo you've taken of nature >>
Competition - post a photo you've taken of nature >>

Proving n is prime.

Hi,

I'm struggling with this proof, I've tried induction but realised that might not be the correct approach. Any pointers appreciated. Thanks.

image.jpg
Original post by Substitution
Hi,

I'm struggling with this proof, I've tried induction but realised that might not be the correct approach. Any pointers appreciated. Thanks.

image.jpg


Try euclidean algorithm and see what you get to!
Although I have bot tried it I am just trying it in my head.



Posted from TSR Mobile
Original post by Substitution
Hi,

I'm struggling with this proof, I've tried induction but realised that might not be the correct approach. Any pointers appreciated. Thanks.

image.jpg


This is one half of Wilson's theorem. Prove it by contradiction: first assume that n is composite. Then n has a divisor among 2,3,4,...,(n-1). So what can we now say about the relationship between (n-1)! and n?
Original post by Gregorius
This is one half of Wilson's theorem. Prove it by contradiction: first assume that n is composite. Then n has a divisor among 2,3,4,...,(n-1). So what can we now say about the relationship between (n-1)! and n?

Spoiler




Posted from TSR Mobile

Quick Reply

Related discussions

Latest

Trending

Trending

Articles for you