Exercise.

Solve the following congruence equations:

1) 2𝑥 + 1 ≡ 3 𝑚𝑜𝑑 10

If 𝑥=0; 2(0) +1 ≡ 3 𝑚𝑜𝑑 10

2(0) +1 ≡ 3 𝑚𝑜𝑑 10
1 ≡ 3 𝑚𝑜𝑑 10 →
1-3/10

2) 4𝑥 + 1 ≡ 5 𝑚𝑜𝑑 12
3) 6𝑥 + 1 ≡ 7 𝑚𝑜𝑑 14
4) 8𝑥 + 1 ≡ 9 𝑚𝑜𝑑 16
5) 5𝑥 + 1 ≡ 3 𝑚𝑜𝑑 5

 { } ∈

Square or Box Brackets [ ]

We want to solve the congruence:
2x + 1 ≡ 3 (mod 10)
To do this, we can start by subtracting 1 from both sides:
2x ≡ 2 (mod 10)
Now we need to find the multiplicative inverse of 2 modulo 10, i.e., an integer y such that:
2y ≡ 1 (mod 10)
We can find y by trial and error, or we can use the extended Euclidean algorithm. In this
case, we can see that 3 is the multiplicative inverse of 2 modulo 10, since:
2 * 3 ≡ 6 ≡ -4 (mod 10) (-4) * (-3) ≡ 12 ≡ 2 (mod 10)
So we have:
y ≡ 3 (mod 10)
Multiplying both sides of the congruence by y, we get:
2xy ≡ 2y (mod 10)
Substituting 3 for y, we get:
2x * 3 ≡ 6 (mod 10)
Simplifying:
6x ≡ 6 (mod 10)
Dividing both sides by 6, we get:
x ≡ 1 (mod 10/6)
Simplifying:
x ≡ 1 (mod 5/3)
Multiplying both sides by 3, we get:
3x ≡ 3 (mod 5)
Simplifying:
x ≡ 4 (mod 5)
Therefore, the solutions to the congruence 2x + 1 ≡ 3 (mod 10) are of the form:
x ≡ 4 (mod 5)
In other words, x is of the form x = 4 + 5k, where k is an integer.