Go Back > Great Internet Mersenne Prime Search > Software

Closed Thread
Thread Tools
Old 2003-12-12, 02:26   #1
Dec 2003

5 Posts

MavsFan is offline  
Old 2003-12-12, 02:35   #2
nfortino's Avatar
Nov 2003

2458 Posts

The Lucas-Lehmer test, the test used to prove/disprove primality in this project, goes as follows:
For 2^p-1
Start with 4, square and subtract 2 (getting 14). Repeat p-2 times. If the number you get is divisible by 2^p-1, then 2^p-1 is prime. The iteration time is the time it takes to do a single square and subtract 2 step.
nfortino is offline  
Closed Thread

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Per iteration time Jwb52z PrimeNet 6 2011-09-09 04:06
Time per iteration em99010pepe Riesel Prime Search 7 2007-08-30 08:54
iteration time under XP Unregistered Software 20 2004-09-30 06:35
iteration time log crash893 Software 1 2002-11-13 05:45
Per iteration time sofII Software 8 2002-09-07 01:51

All times are UTC. The time now is 00:44.

Sun May 16 00:44:50 UTC 2021 up 37 days, 19:25, 0 users, load averages: 1.57, 1.76, 1.72

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.