20201216, 02:28  #1 
Mar 2016
355_{10} Posts 
a prime sieve for f(n)=n⁴+1
A peaceful night,
the sieve algorithm for the function f(n)=2n²1 was too slow, even with some improvements. The function f(n)=n^p1 increase too fast for practical use. Does it make more sense to use a function like f(n)=n⁴+1 for a presieve for Mersenne numbers ? The actual used presieve reduces 1/p primes for Mp, as far as I can see. Two questions: Is there an algorithm known for a prime sieve for the function f(n)=n⁴+1, (from whom) Does the t with t  f(n) grows faster and how fast. Thanks in advance if you spend me some lines. Greetings from corona time, Bernhard 
20201216, 02:43  #2 
"Curtis"
Feb 2005
Riverside, CA
2×11×227 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Fast multithreaded Prime Sieve  jzakiya  Miscellaneous Math  3  20200822 21:55 
How do you efficiently sieve for prime 3/4tuples?  PuzzlePeter  Software  156  20190603 20:19 
GPU Prime Sieve  tapion64  GPU Computing  7  20140410 06:15 
Sieve depth vs. prime probability  Unregistered  Information & Answers  2  20100525 20:51 
Prime in Riesel Sieve Project  Sloth  Prime Sierpinski Project  1  20060510 02:02 