Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2002-11-23, 20:07   #1

3·2,593 Posts
Default S(0)=3

Mp is prime if it divides S(p-2) with S(0)=4

Some Mp is prime if it divides S(p-2) with S(0)=3
Marcel Martin has checked this up to L(2^4499)

So, is Mp prime if it divides the remainder R of :
[S(p-2) with S(0)=4] = R (mod [S(p-2) with S(0)=3] ) ?

It seems so, and it much smaller than either S(p-2).
There are probably various algorithms to speed up this integer relationship.

Please, comments or disproofs welcome!
  Reply With Quote
Old 2002-11-24, 06:55   #2
wpolly's Avatar
Sep 2002
Vienna, Austria

21910 Posts

When S[0]=3, Mp divides S[p-2] iff Mp is prime and p=3(mod4)
wpolly is offline   Reply With Quote

Thread Tools

All times are UTC. The time now is 11:20.

Thu Dec 9 11:20:13 UTC 2021 up 139 days, 5:49, 0 users, load averages: 1.00, 1.09, 1.21

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.