Section 2 - Radford

ii.) If , then * has exactly g incongruent solutions. To find these g incongruent solutions , we first using the Euclidean Algorithm remainder solution process to find a solution to the equation . Then a complete set of incongruent solutions is given by. Proof: To prove part i, suppose there is a solution to when . ................
................