what happens if we drop the as- sumption that ged(e,p-11 in Proposition 3.2. So let p be a prime, let c 0 (mod p), rc(mod p) (a) Prove that if equation (1) has one solution, then it has exactly ged(e,p- 1) distinct let e 2 1, and consider the congruence solutions. (Hint. Use the primitive root theorem (Theorem 1.30), combined with the extended Euclidean algorithm (Theorem 1.11) or Exercise 1.27.) b) For how many non-zero values of c (mod p) does congruence (1) have a solution?