mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 4 of 4
Search took 0.00 seconds.
Search: Posts Made By: R. Gerbicz
Forum: And now for something completely different 2019-04-20, 22:31
Replies: 48
Views: 28,142
Posted By R. Gerbicz
In general we use primorials for small numbers,...

In general we use primorials for small numbers, say when you're searching 18 primes in ap, then the sieve bound is also smaller, and it is better to use primorials. In our case with primorials you'd...
Forum: And now for something completely different 2019-04-20, 21:40
Replies: 48
Views: 28,142
Posted By R. Gerbicz
Here it is: $ ./polysieve Sieve...

Here it is:

$ ./polysieve
Sieve P(s)+a*Q(s)+c for multiple c values, with fixed s=k*b^n+d; P,Q is polynom.
Give k: 1
Give b: 2
Give n: 34350
Give d: 0
Give the degree of the P polynom: 1...
Forum: And now for something completely different 2019-04-20, 21:23
Replies: 48
Views: 28,142
Posted By R. Gerbicz
That is just wrong assumption, if you'd be...

That is just wrong assumption, if you'd be correct we would search only on the form say k*p#+1 and not Mersenne.

And for sieve why not use my ancient polysieve:...
Forum: And now for something completely different 2019-04-20, 07:51
Replies: 48
Views: 28,142
Posted By R. Gerbicz
You can do it even much denser: Let r=k*2^n+1 ~...

You can do it even much denser:
Let r=k*2^n+1 ~ sqrt(N) Proth prime, then search p in the form:


p=c*r*2^n+6*r-5 where c=1,2,3,.. is running.


Then p-1 is divisible by 2^n, and p+5 is...
Showing results 1 to 4 of 4

 
All times are UTC. The time now is 03:33.


Sun Nov 28 03:33:31 UTC 2021 up 127 days, 22:02, 0 users, load averages: 1.30, 1.19, 1.06

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.