- #1
jreis
- 24
- 0
Homework Statement
Determine whether there is a positive integer k so that the congruence is satisfied.
2k ≡ 1 (mod 11)
Homework Equations
gcd(2k,11) = 1
The Attempt at a Solution
Well, I know the answer is false. Because of Fermat's Little Theorem, 2k ≡ 2 (mod 11)
But I'm not satisfied with this answer. How could I show the answer to #1?