Post Reply 
 
Thread Rating:
  • 0 Votes - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
A problem of congruence equation
05-03-2010, 08:57 AM
Post: #1
A problem of congruence equation
Let $p$ be a prime and $0<a<p$. Prove that
$x \equiv b (-1)^{a-1} \displaystyle{\frac{(p-1)\cdots (p-a+1)}{a!}} \pmod{p}$
is a solution of $ax \equiv b \pmod{p}$
Find all posts by this user
Quote this message in a reply
Post Reply 


Forum Jump:


Contact Us | Software Frontier | Return to Top | Return to Content | Lite (Archive) Mode | RSS Syndication