Skip to main content
3 of 3
changed to non-capital n to make title less confusing; added requirement n>1
YCor
  • 63.9k
  • 5
  • 187
  • 286

Range of $2^n$ mod $n$

Is there any integer $n\ge 2$ such that $2^n\equiv 3 \bmod n$? I understand that $n$ must be an odd non-prime. I checked up to a million with no success (but $2^n\equiv 5 \bmod n$ and $2^n\equiv 7 \bmod n$ have solutions).

bobuhito
  • 1.5k
  • 11
  • 19