+0

# hi help please number theory question

0
432
1
+22

If $n>1$ is an integer, the notation $a\equiv b\pmod{n}$ means that $(a-b)$ is a multiple of $n$. Find the sum of all possible values of $n$ such that both of the following are true: $171\equiv80\pmod{n}$ and $468\equiv13\pmod{n}$.

Aug 14, 2020