# Solve the following systems of congruences. xequiv 4(mod 7) Question
Congruence Solve the following systems of congruences.
$$x\equiv 4(mod\ 7)$$ 2021-03-07
Formula used:
1) Theorem: System of congruences:
Let m and n be relatively prime and a and b integers. There exists an integer x that satisfies the system of congruences
$$x \equiv a(mod\ m)$$
$$x \equiv b(mod\ n)$$
Furthermore, any two solutions x and y are congruent modulo mn.
2) Theorem: Addition and Multiplication Properties:
If $$a = b(mod\ n)$$ and x is any integer, then $$a + x \equiv b +.x(mod\ n)\ and\ ax \equiv bx (mod\ n)$$.
3) Theorem: Cancellation Law:
If $$ax \equiv ay (mod\ n)\ and\ (a, n) = 1,\ then\ x = y(mod\ n)$$.
Explanation:
Consider $$3x + 2 \equiv 3 (mod\ 8)$$
$$3x +2 + (-2) \equiv 3 + (—2) (mod\ 8)$$
$$\Rightarrow 3x \equiv 1 (mod\ 8)$$
By using multiplication property,
$$\Rightarrow 3*3x=1*3(mod\ 8)$$
$$Rightarrow\ 9x \equiv 3 (mod\ 8)$$
Since $$9 \equiv 1 (mod\ 8)$$,
$$\Rightarrow x \equiv 3(mod\ 8)$$
Therefore, the system of congruences is
$$x \equiv 4 (mod\ 7)$$
$$x \equiv 3(mod\ 8)$$
Since 7 and 8 are relatively prime then $$(7, 8) = 1$$.
Then, by using theorem there exists an integer x that satisfies the system of congruences.
From the first congruence $$x = 4 + 7k$$ for some integer k and substitute this expression for x into the second congruence.
$$4+ 7k \equiv 3 (mod\ 8)$$
$$4+7k + (—4) \equiv 3+ (—4) (mod\ 8)$$
$$\Rightarrow 7k \equiv —1(mod\ 8)$$
Since $$— 1 \equiv 7(mod\ 8)$$,
$$\Rightarrow 7k \equiv 7 (mod\ 8)$$
Since (7, 8) = I then by using cancellation law,
$$\Rightarrow k \equiv 1 (mod\ 8)$$
Thus, $$x = 4 + 7(1) = 11$$ satisfies the system and $$x = 11 (mod\ 7 * 8)\ or\ x \equiv 11 (mod\ 56)$$ gives all solutions to the given system of congruences.

### Relevant Questions Solve the following systems of congruences.
$$x\equiv 4(mod\ 5)$$
$$x\equiv 3(mod\ 8)$$
$$x\equiv 2(mod\ 3)$$ Solve the following systems of congruences.
$$x\equiv 2(mod\ 5)$$ Solve the system of congruence's $$x\equiv1(mod\ 3), x\equiv 4(mod\ 5), x\equiv6(mod\ 7)$$ Solve the following systems of congruences.
$$2x\equiv 5(mod\ 3)$$
$$3x+2\equiv 3(mod\ 8)$$
$$5x+4\equiv 5(mod\ 7)$$ Solve the system of congruence's
$$\displaystyle{x}\equiv{1}{\left(\text{mod}{3}\right)},{x}\equiv{4}{\left(\text{mod}{5}\right)},{x}\equiv{6}{\left(\text{mod}{7}\right)}$$ Find all solutions to the following system of linear congruences: $$\displaystyle{x}\equiv{1}\text{mod}{2},{x}\equiv{2}\text{mod}{3},{x}\equiv{3}\text{mod}{5},{x}\equiv{4}\text{mod}{7},{x}\equiv{5}\text{mod}{11}$$. Solve the following linear congruences using Diophantine equations: $$\displaystyle{25}{x}\equiv{7}{\left(\text{mod}{17}\right)}{\quad\text{and}\quad}{26}{x}\equiv{8}{\left(\text{mod}{6}\right)}$$ Consider the system of linear congruences below:
$$\displaystyle{x}\equiv{2}{\left(\text{mod}{5}\right)}$$
$$\displaystyle{2}{x}\equiv{22}{\left(\text{mod}{8}\right)}$$
$$\displaystyle{3}{x}\equiv{12}{\left(\text{mod}{21}\right)}$$
(i)Determine two different systems of linear congruences for which the Chinese Remainder Theorem can be used and which will give at least two of these solutions. $$\displaystyle{2}{x}\equiv{1}{\left(\text{mod}{5}\right)}$$
$$\displaystyle{x}\equiv{3}{\left(\text{mod}{4}\right)}$$ $$x\equiv 17(mod\ 35)$$
$$x\equiv 8(mod\ 43)$$