1
$\begingroup$

Hi I was solving a question and now I'm stuck at this part .

$-6x\equiv 16 \pmod p $

$2x\equiv 1 \pmod p $

where $p$ is a prime number.

I need to find all prime numbers that satisfy these congruences.

I think that Chinese remainder theorem might help somehow but I don't see it.

  • 0
    Generally the Chinese remainder theorem would be applicable when you have multiple bases. Here you only have base $p$. – 2017-01-20
  • 1
    @Joffan Modulus, not base, is far more common in elementary number theory. – 2017-01-20
  • 0
    @Joffan Our of curiosity, where did you learn the term "base" for the modulus? – 2017-01-20
  • 0
    @BillDubuque No idea really - I guess I was just wrong. – 2017-01-20
  • 0
    @Joffan It might be due to a language translation error, or some other mistake that has been propagated on the web. The only mention I saw in the first few pages of a Google search was on a [Tutors in China site](http://www.tutorsinchina.com/dictionary%20/congruence-modulo-n/) which defines "congruence modulo n" as "Arithmetics where 2 quantities differing by a multiple of the chosen base n are considered the same..." I don't recall ever seeing "base" used before. – 2017-01-20
  • 0
    @Joffan Another possibility is that some authors have borrowed ideal language, where generators of an ideal are referred to as bases (a generalization of vector space terminology to modules). – 2017-01-20

2 Answers 2

2

$16+6x = k_1p$

$2x = 1 + k_2p$ =>

$16 = -3 + (k_1 - 3k_2)p$

=> $p|19$

  • 1
    Thank you but please , give a hint next time :C – 2017-01-19
2

Eliminate $\,x,\ $ e.g. $\ {\rm mod}\ p\!:\,\ 16 \equiv -3(\color{#c00}{2x})\equiv -3(\color{#c00}{\bf 1})\,\Rightarrow\, 16\!+\!3\equiv 0\,\Rightarrow\,p\mid 19$