OFFSET
2,2
COMMENTS
M(p_n) = 2^p_n - 1 = (2*p_n)*j + 1 = [(2*p_n)*k_1 + 1] ... [(2*p_n)*k_i + 1], n >= 2 (i.e., odd prime p_n), i >= 1. Then k = Min(k_1, ..., k_i).
LINKS
Chris K. Caldwell, Modular restrictions on Mersenne divisors
FORMULA
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Definition edited, comment added by Daniel Forgues, Oct 06 2009
STATUS
approved