Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


Jonathan
Posts:
3
From:
georgia
Registered:
10/14/08


congruence help
Posted:
Oct 14, 2008 12:41 PM


I've been working my butt off and now I've hit a wall with this problem; for the congruence equation a*x = b(mod n), determine conditions for a, b, and n for there to be at least one solution.
i think it has something to do with the greatest common divisors. help, please?



