OFFSET
2,1
COMMENTS
Payam numbers are good candidates for looking for Proth primes, i.e. primes of the form k*2^n+1
LINKS
EXAMPLE
E_{+}(3) = 9 because 9 is the smallest odd integer k such that for every nonnegative integer n, k*2^n+1 is not divisible by 3 or 7, the only primes p for which the multiplicative order of 2 mod p is less than or equal to 3.
CROSSREFS
KEYWORD
hard,nonn
AUTHOR
David Terr, Jun 10 2003
STATUS
approved