Go Back > Great Internet Mersenne Prime Search > Software

Thread Tools
Old 2020-04-02, 11:52   #12
pepi37's Avatar
Dec 2011
After milion nines:)

5×257 Posts

Originally Posted by LaurV View Post

Now, thinking about P-1, you must do P-1 effectively to find out a factor (or more) for each candidate, and once you found that factor, there are zero chances that you can use that factor to eliminate other candidates.
First, thanks to answer! And it is much clear to me what I ask .
So I now see sieving is not good idea. Can somebody write a script ( as mentioned before) that will produce primes with such properties.
As I say before, I know it is not perfect, it will not remove all candidates, it cannot be called sieve program. If it is not too complicated to write that script then I would lile to have it, so I can start some home experiment!
LaurV thanks one more time

Last fiddled with by pepi37 on 2020-04-02 at 11:52
pepi37 is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Why are numbers sum(2^(k*c)) smooth? preda Math 11 2018-08-30 17:35
Not smooth enough numbers Sam Kennedy Factoring 5 2012-11-10 07:54
Properties of Mersenne numbers kurtulmehtap Math 31 2011-01-10 00:15
Smooth and rough numbers CRGreathouse Math 3 2009-05-25 05:26
Smooth Numbers Yamato Math 1 2005-12-11 11:09

All times are UTC. The time now is 15:49.

Thu Jul 9 15:49:31 UTC 2020 up 106 days, 13:22, 1 user, load averages: 1.44, 1.67, 1.65

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.