OFFSET
1,1
COMMENTS
Such primes cannot divide solutions to 2^m == 3 (mod m) (see A050259).
LINKS
J. K. Crump, Number Theory Web.
PROG
(Magma) lst:=[3]; for p in [5..911 by 2] do if IsPrime(p) then t:=0; e:=Ceiling(Log(2, p+1)); for x in [e..p-2] do if 2^x mod p eq 3 then t:=1; break; end if; end for; if t eq 0 then Append(~lst, p); end if; end if; end for; lst; // Arkadiusz Wesolowski, Jan 12 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Artur Jasinski, Nov 23 2006
EXTENSIONS
Edited by Max Alekseyev, Jan 14 2007
Corrected by Max Alekseyev, Jun 08 2011
Corrected by Arkadiusz Wesolowski, Jan 12 2021
STATUS
approved