http://www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eisA.cgi?An

um=A068194

Let p be prime such that M_p=2^p-1.

Then M_p is prime iff M_p+...+x = T(M_p)

where x>M_p, and the sum is over the consecutive integers between M_p and x.

T(n)=n(n+1)/2.

Jon Perry

perry@...

http://www.users.globalnet.co.uk/~perry/maths/

http://www.users.globalnet.co.uk/~perry/DIVMenu/

BrainBench MVP for HTML and JavaScript

http://www.brainbench.com