A problem of congruence equation

05032010, 08:57 AM
(This post was last modified: 05032010 08:59 AM by elim.)
Post: #1




A problem of congruence equation
Let $p$ be a prime and $0<a<p$. Prove that
$x \equiv b (1)^{a1} \displaystyle{\frac{(p1)\cdots (pa+1)}{a!}} \pmod{p}$ is a solution of $ax \equiv b \pmod{p}$ 

« Next Oldest  Next Newest »
