Solution of Linear Congruence/Examples/325 n = 11 mod 3

From ProofWiki
Jump to navigation Jump to search

Example of Solution of Linear Congruence

Let $325 n = 11 \pmod 3$.

Then:

$x = 2 + 3 t$

where $t \in \Z$.


Proof

We have that:

$325 \equiv 1 \pmod 3$

and:

$11 \equiv 2 \pmod 3$


Thus the congruence can be expressed as:

$n \equiv 2 \pmod 3$

and the solution is found by inspection.

$\blacksquare$


Sources