Prove that if p is a prime and c is not congruent 0 (mod p), then cx is congruent b (mod p) has a unique solutin modulo p. That is, a solution exists, and any two solutions are congruent modulo p.
Printable View
Prove that if p is a prime and c is not congruent 0 (mod p), then cx is congruent b (mod p) has a unique solutin modulo p. That is, a solution exists, and any two solutions are congruent modulo p.
If there existsQuote:
Originally Posted by rainyice
such that
then this means that
, by definition of congruence. So,
. As
then
. Thus,
.
Quote:
Originally Posted by SwlabrIf there exists
you are very helpful ~ thank you ^_^