Hey everyone. I have a question about a congruence problem. I guess I'm just unsure about how to approach it:
If p is a prime number and if a is not congruent to 0 (mod p), then Fermat's Little Theorem tells us that a^(p-1)≡ 1 (mod p).
The congruence 7^1734250 ≡ 1660565 (mod 1734251) is true. Can you conclude that 1734251 is a composite number?