Prove P is prime
If $P$ divides $(P-1)!+1$, prove that $P$ is a prime.
Every logical solution to a problem has its own beauty.
(Important: Please make sure that you have read about the Rules, Posting Permissions and Forum Language)
(Important: Please make sure that you have read about the Rules, Posting Permissions and Forum Language)
Re: Prove P is prime
nice problem to face.
A man is not finished when he's defeated, he's finished when he quits.
- Tahmid Hasan
- Posts:665
- Joined:Thu Dec 09, 2010 5:34 pm
- Location:Khulna,Bangladesh.
Re: Prove P is prime
i solved it once so i'll not post the soln,but here' a hint.
what are the properties of prime ad odd numbers?
what are the properties of prime ad odd numbers?
বড় ভালবাসি তোমায়,মা
Re: Prove P is prime
suppose P isn't prime.P has some divisors.these divisors must be be lesser than P-1.
then P divides (P-1)!.but P divides (P-1)!+1.
so P cannot be non-prime.
P is prime.
then P divides (P-1)!.but P divides (P-1)!+1.
so P cannot be non-prime.
P is prime.
Try not to become a man of success but rather to become a man of value.-Albert Einstein
Re: Prove P is prime
its reverse once is also true. If p is a prime, then p divides (p-1)!+1 the wilson theorem
A man is not finished when he's defeated, he's finished when he quits.
Re: Prove P is prime
Certainly this is wilson's Theorem; however, what Zzzz wanted to indicate is that the reverse of this theorem is also true.
"Inspiration is needed in geometry, just as much as in poetry." -- Aleksandr Pushkin
Please install LaTeX fonts in your PC for better looking equations,
learn how to write equations, and don't forget to read Forum Guide and Rules.
Please install LaTeX fonts in your PC for better looking equations,
learn how to write equations, and don't forget to read Forum Guide and Rules.
Re: Prove P is prime
Well, if $n|(n-1)!+1$ with $n=ab,a,b>1$ then $a<n-1$ and so $a|(n-1)!$ and also $a|n|(n-1)!+1$ implying that $a|1$, a clear contradiction!Zzzz wrote:If $P$ divides $(P-1)!+1$, prove that $P$ is a prime.
One one thing is neutral in the universe, that is $0$.
Re: Prove P is prime
well,we know,if $p$ is not a prime,then it will have a prime divisor between $1$ and \[\sqrt{p}\] so, it will share a common factor with $(p-1)$ but not with $1$. so,$p$ cannot be a composite number.Hence,since it has to be a number(the question states that it does divide) so,it will be a prime number.
Also,check wilson's theorem,In mathematics, Wilson's theorem states that a natural number n > 1 is a prime number if and only if \[(n-1)!\equiv -1(mod n)\]
Also,check wilson's theorem,In mathematics, Wilson's theorem states that a natural number n > 1 is a prime number if and only if \[(n-1)!\equiv -1(mod n)\]