Discussion
Wed Oct 10
01:12
G. C. Greubel: Spent the day waiting on machine to get terms up to n<30000, added them hit enter to realize I was minutes too late. Darn!
01:13
G. C. Greubel: Terms for n<=31000 have been verified.
01:25
Thomas Ordowski: Thank you very much!
04:23
Thomas Ordowski: Conjecture: k = n[2^n/n]+1 is prime iff 3^(k-1) == 1 (mod k).
04:29
Thomas Ordowski: For n > 1.
Thu Oct 11
05:22
Thomas Ordowski: Problem: Are there composite numbers n such that 2^n - (2^(n-1) mod n) is prime?
05:30
Thomas Ordowski: The equivalent form of these primes is 2^(n-1) + n[2^n-1)/n]. Are, for n > 2, they all the Mersenne primes?
05:37
Thomas Ordowski: Correction. Above should be: 2^(n-1) + n[2^(n-1)/n].
