Do inequations exist with congruences? Gauss introduced the $\equiv$ symbol because congruences modulo $n$ were very similar to equality.
But, by curiosity I would like to know if it was possible to write inequations such as:
$$3x + 2y \leq 5 [7]$$.
 A: It doesn't make sense to have such inequalities. Equality modulo is not an equality in the usual sense. 
$a \equiv b \pmod n$ only means that $a - b$ is divisible by $n$. What would an inequality mean? $a-b$ is less than something that is divisible by $n$? It certainly is. 
If you want to deal with congruences as if they are equations in the usual sense, then any number is less than any number and any number is greater than any number, etc. Modulo $5$, $10$ is "greater" than $100$ in the sense that $10 = 1000$, and $100$ is "greater" than $10$ in the usual sense.
A: When we write "$x \leq y$" with $x$ and $y$ numbers, the "expected" properties include:


*

*Totality: For all $x$ and $y$, at least one of "$x \leq y$" and $y \leq x$" holds;

*Antisymmetry: If $x \leq y$ and $y \leq x$, then $x = y$;

*Transitivity: If $x \leq y$ and $y \leq z$, then $x \leq z$.

*Translation invariance: If $x \leq y$, then $x + a \leq y + a$ for all $a$".
Let $n > 1$ be an integer. It's easy to see not all of these properties can be satisfied in the set $\mathbf{Z}/n\mathbf{Z}$ of residue classes modulo $n$. Take $x = [0]$ and $y = [1]$. Which inequality should hold, "$[0] \leq [1]$" or "$[1] \leq [0]$"? No matter which you try, you run into trouble because
$$
\underbrace{[1] + \dots + [1]}_{\text{$(n-1)$ times}} = [n-1] = [-1].
\tag{1}
$$
If $[0] \leq [1]$, then by (1) and transitivity, $[0] \leq [-1]$. Adding $[1]$ to both sides gives $[1] \leq [0]$. This violates antisymmetry because $[0] \neq [1]$.
Similarly, if $[1] \leq [0]$, then by (1) and transitivity, $[-1] \leq [0]$. Adding $[1]$ to both sides gives $[0] \leq [1]$, again violating antisymmetry.
