|
Search: id:A072936
|
|
|
| A072936 |
|
Primes p that do not divide 2^x+1 for any x>=1. |
|
+0
3
|
|
| 2, 7, 23, 31, 47, 71, 73, 79, 89, 103, 127, 151, 167, 191, 199, 223, 233, 239, 263, 271, 311, 337, 359, 367, 383, 431, 439, 463, 479, 487, 503, 599, 601, 607, 631, 647, 719, 727, 743, 751, 823, 839, 863, 881, 887, 911, 919, 937, 967, 983, 991, 1031, 1039, 1063
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Also, primes p such that p^2 does not divide 2^x+1 for any x>=1.
A prime p cannot divide 2^x+1 if the multiplicative order of 2 (mod p) is odd. - T. D. Noe (noe(AT)sspectra.com), Aug 22 2004
Differs from A049564 first at p=6529, which is the 250th entry in A049564 related to 279^32 =2 mod 6529, but absent here because 6529 divides 2^51+1. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 25 2008]
|
|
REFERENCES
|
A. K. Devaraj, "Euler's Generalization of Fermat's Theorem-A Further Generalization", in ISSN #1550-3747, Proceedings of Hawaii Intl Conference on Statistics, Mathematics & Related Fields, 2004.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
CROSSREFS
|
Cf. A040098, A049096, A014664 (multiplicative order of 2 mod n-th prime).
Sequence in context: A045315 A072935 A049564 this_sequence A049584 A045382 A049560
Adjacent sequences: A072933 A072934 A072935 this_sequence A072937 A072938 A072939
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 20 2002
|
|
EXTENSIONS
|
Edited by T. D. Noe (noe(AT)sspectra.com), Aug 22 2004
|
|
|
Search completed in 0.002 seconds
|
