1. The problem statement, all variables and given/known data Find an integer x that is a solution (only need one solution, not all solutions). If no solution exists, prove that no solution can exist. 13x = 13 mod 50032 , with x > 1. Note that 5003 is prime. Here, = means "congruent to" 2. Relevant equations Not sure. I can solve linear congruences without too much trouble, but I haven't seen a congruence of this form before, and the book that I'm using is pretty low on good examples. 3. The attempt at a solution I don't have one. Looking for a bump in the right direction.