When do I know if the number is prime?

2003-05-17, 15:37

Does the program tell you whether a factor as been found?

Or does it not reveal this information until the end.

Also, my iteration times range between .678 (slowest) to .288 fastest How does this compare to other Pentium III machines. I feel I am running a little slow.

Thanks.

ANDY

S80780 · 2003-05-17, 16:57

Hi, ANDY!

Yes, the program does tell you, whether a factor was found or if the mersenne you tested is prime. You can look up the meaning of program outputs in readme.txt and in the Online Help.
In case of P-1ing, First Time Tests or DCs, you have to wait till the end of the test.
In case of Trial Factoring, the program might look for factors smaller than the current one to determine the smallest one. But it won't start a new bit depth. So again you have to wait "nearly" till the end.

To compare your timings to others, you can take a look at the benchmarks-page on http://www.mersenne.org/bench.htm.

Cheers,

Benjamin

2003-05-17, 15:37	#1
uniqueidlondon 1110101000010₂ Posts	When do I know if the number is prime? Does the program tell you whether a factor as been found? Or does it not reveal this information until the end. Also, my iteration times range between .678 (slowest) to .288 fastest How does this compare to other Pentium III machines. I feel I am running a little slow. Thanks. ANDY

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED!	dabaichi	News	571	2020-10-26 11:02
Number of distinct prime factors of a Double Mersenne number	aketilander	Operazione Doppi Mersennes	1	2012-11-09 21:16
Estimating the number of prime factors a number has	henryzz	Math	7	2012-05-23 01:13
new prime number?	Artifex	Information & Answers	2	2008-12-31 07:58
New prime number?	inthevoid2	Information & Answers	3	2008-09-29 23:27

2003-05-17, 16:57	#2
S80780 Jan 2003 far from M40 5³ Posts	Hi, ANDY! Yes, the program does tell you, whether a factor was found or if the mersenne you tested is prime. You can look up the meaning of program outputs in readme.txt and in the Online Help. In case of P-1ing, First Time Tests or DCs, you have to wait till the end of the test. In case of Trial Factoring, the program might look for factors smaller than the current one to determine the smallest one. But it won't start a new bit depth. So again you have to wait "nearly" till the end. To compare your timings to others, you can take a look at the benchmarks-page on http://www.mersenne.org/bench.htm. Cheers, Benjamin