Congruence modulo is a fundamental concept in number theory, with numerous applications in cryptography, computer science, and physics. It involves the relationship between the remainder of a division and the modulus. Understanding congruence modulo examples can greatly enhance your grasp of this powerful mathematical tool.

The congruence modulo n can be defined as 'a ≡ b (mod n)' where 'a' and 'b' are integers, and 'n' is a natural number. This implies that 'a' and 'b' leave the same remainder when divided by 'n'. Let's dive into some examples and solutions to illustrate this.

Congruence Modulo Examples
Before we delve into specific examples, let's recap the concept. Two numbers are congruent modulo 'n' if and only if their difference is divisible by 'n'.

For instance, consider 17 and 25. The difference between 25 and 17 is 8, which is divisible by the modulus 'n' (1). Therefore, 17 ≡ 25 (mod 1).
Examples Involving Addition and Subtraction

Let's examine how addition and subtraction work with congruence modulo.
Given a ≡ b (mod n), then a + c ≡ b + c (mod n) and a - c ≡ b - c (mod n). For example, if 8 ≡ 3 (mod 5), then 8 + 7 ≡ 3 + 7 ≡ 2 ≡ 2 (mod 5) and 8 - 3 ≡ 3 - 3 ≡ 0 ≡ 0 (mod 5).
Examples Involving Multiplication

Multiplication rules are slightly different. Given a ≡ b (mod n) and c ≡ d (mod n), then ac ≡ bd (mod n). For instance, if 2 ≡ 5 (mod 7) and 4 ≡ 3 (mod 7), then 2*4 ≡ 5*3 ≡ 2 ≡ 2 (mod 7).
Solving Linear Congruences
Now that we understand basic congruence operations, let's solve some linear congruences.

Linear congruences follow the form 'ax ≡ c (mod n)', where 'a', 'c', and 'n' are given integers, and 'x' is the variable to be found. If 'a' and 'n' are coprime, a solution always exists.
Using the Extended Euclidean Algorithm









The extended Euclidean algorithm can help find the inverse of 'a' modulo 'n', which is essential for solving these linear congruences. The inverse of 'a' is a number 'b' such that ab ≡ 1 (mod n).
For example, to find the modular inverse of 7 modulo 13, we use the extended Euclidean algorithm and find that the inverse is 12. Thus, 7 * 12 ≡ 84 ≡ 1 (mod 13).
Solving the Linear Congruence
Now that we have the inverse, we can solve the linear congruence. For 'ax ≡ c (mod n)', we want to find 'x' such that 'x ≡ a^(-1) * c (mod n)'. For instance, for 7x ≡ 3 (mod 13), we find 'x' as follows:
x ≡ 12 * 3 ≡ 36 ≡ 10 (mod 13).
Understanding congruence modulo examples and solving linear congruences can open up a world of interesting applications. Whether you're exploring cryptography, computer science, or physics, this knowledge can prove invaluable. Happy learning!