If $(p-1)! \equiv -1 \text{ or } 0 \pmod{p}$ is false,
Find the values of $p$
Solve it
-
- Posts:8
- Joined:Sun Mar 17, 2013 3:07 pm
- Location:Dinajpur Zilla School, Dinajpur, Bangladesh
- Contact:
Re: Solve it
প্রশ্নটা ঠিকভাবে লিখলে ভাল হয়। বোঝা যাচ্ছে না।
-
- Posts:22
- Joined:Sat Dec 14, 2013 3:28 pm
Re: Solve it
How can it be congruent to $0$!!! How can there exist such primes either!!!
Why so SERIOUS?!??!
Re: Solve it
Read the question carefully. There is no mention of $p$ being prime.
Please read Forum Guide and Rules before you post.
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
- asif e elahi
- Posts:185
- Joined:Mon Aug 05, 2013 12:36 pm
- Location:Sylhet,Bangladesh
Re: Solve it
$p=4$ is the only solution. If $p$ is a prime,then by Wilson's theorem $(p-1)!\equiv -1(mod p)$. If $p$ is composite,we can write $p=ab$ where $a,b>1$.If $a=b$ and $a>2$,then $a<2a<a^{2}-1=p-1$.So $a\times 2a=2p\mid (p-1)!$.This implies $(p-1)!\equiv 0(mod p)$.If $a>b$,then $a>b>p-1$. So $p=ab$ divides $(p-1)!$ or $(p-1)!\equiv 0(mod p)$. So $p=4$ is the only solution.Rabeeb wrote:If $(p-1)! \equiv -1 \text{ or } 0 \pmod{p}$ is false,
Find the values of $p$