- #1
erok81
- 464
- 0
Homework Statement
Solve the congruence 2x≡7 (mod 17)
Homework Equations
None.
The Attempt at a Solution
I think my main problem with this is I am still confused on what modulo actually means. But I'll save that for some other time.
So here is what I have done so far.
I found the gcd using the Euclidean Algorithm which was 1 and therefore also has an inverse.
gcd(7,17,)=1
Next working backwards I obtained the inverse which was 5.
This is where I am stuck. I've tried looking at examples, but I am still not getting it. The texts starts with multiplying both sides by by the inverse which gives me 5·2x ≡ 5·7 (mod 17)
Any idea where to go next?