1

I have the following congruence $320 \equiv 1 (\text{mod }x)$

And the question is : find all the modulos $x$ that make this congruence true.

Gregory Grant
  • 14,874
lopata
  • 319

3 Answers3

3

Well basically the definition of $$a \equiv b (\text{mod }n)$$ is that n should divide $(a-b)$ So according to your question $x$ should divide $320-1$ that is $319$. It would be $11$ and $29$

Since you want all the $x$'s then it would be $11$, $29$ and $319$

wythagoras
  • 25,026
0

$320 \equiv 1 (\text{mod }x) \rightarrow 320-1 \equiv 0 (\text{mod }x) \rightarrow 319 \equiv 0 (\text{mod }x) \rightarrow x=11$ or $29$, since that only works for the divisors.

Atvin
  • 3,392
0

$320 \equiv 1 \pmod{x} \implies x \mid 320 -1 =319$ and hence there exists an integer $k$ such that $$xk = 319$$

Now should find all pairs $x,k$ that when you multiply them together you get $319$

$1 \times 319$

$29 \times 11$

$-1 \times -319$

$-29 \times -11$

any one of these 8 numbers can work for $x$

Basically you get the prime factorization for $319$ and then you add to your list the negatives of these numbers plus the number itself plus 1, that will give you a complete list for the divisors of $319$ or generally any number.

alkabary
  • 6,214