Solving
$2x \equiv 1 \pmod{p}$
where
$p$
is an odd prime
2
$\begingroup$
Solve
$2x \equiv 1 \pmod{p}$
where
$p$
is an odd prime.
I'm really stuck on this one.
prime-numbers
asked
2010-10-27
user id:2868
41
3
3bronze badges
5
In congruences, you can replace either side with that same thing plus a multiple of p. So you can replace 1 with, say, p+1...
–
2010-10-27
3
When p=3, x=2. p=5,x=3. p=11,x=6. p=17,x=9. Do you see any pattern?
–
2010-10-27
2 Answers
2
Related Posts
No Related Post Found