WHAT IS PER ITERATION TIME?

MavsFan · 2003-12-12, 02:26

.

nfortino · 2003-12-12, 02:35

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.

2003-12-12, 02:26	#1
MavsFan Dec 2003 5 Posts	WHAT IS PER ITERATION TIME? .

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

2003-12-12, 02:35	#2
nfortino Nov 2003 165₁₀ 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.