20171105, 20:35  #1 
Mar 2016
5^{2}·13 Posts 
a primesieve?
A peaceful evening for all,
Is it possible to find a prime generating sieving algorithm for the following described function: http://devalco.de/poly_xy.php Have a lot of fun Bernhard 
20171105, 22:40  #2  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
Quote:
Quote:


20171108, 15:27  #3  
Mar 2016
5^{2}·13 Posts 
A peaceful day for all,
Quote:
Hint 1: Fix either u or v for the function f(u,v) and examine the prime distribution. There is a pattern, you could find. http://devalco.de/poly_xy.php Have a lot of fun by examing the prime distribution Bernhard 

20171111, 18:54  #4  
Mar 2016
5^{2}·13 Posts 
Quote:
You can use this primesieve for a better primesieve concerning http://devalco.de/poly_xy.php There will be a third hint in some few days, and concerning the participation a suggestion for a first solution. There might be several solution, you have the first choice Greeting from the primes Bernhard 

20171111, 20:12  #5  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Quote:


20171111, 20:30  #6 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}×7×337 Posts 
This looks like Misc.Math.
(it is obviously not a puzzle, just a bunch of fluff plus shameless selfpromotion to boot.) 
20171114, 18:51  #7 
Mar 2016
5^{2}×13 Posts 
"Anyone who has "discovered" a pattern or found order in disorder,ie. feigenbaum constants, are justified in feeling
a sense of pride and accomplishment for this personal insight. " from jwaltos (http://www.mersenneforum.org/showpos...9&postcount=25) I am very thankful for these words. An explication for the proposed pattern for the function f(u,v)=u^2 + 2uv  v2 : You can simplify by fixing either u or v and you get a quadratic function with one variable. You could use this "slices" horizontal and vertikal. for every p with p  f(n)=an^2+bn+c (a<5; a,b,c element N) follows that p  f(n+p) and p  f(nb/a) The primes p with p  f(u,v) appears double periodically horizantal and vertikal. In order to understand this i have tried to give an "amazing" applet http://devalco.de/poly_xy.php you can click on the primes 7, 17, 23, 31 and so on The primes p of the function f(u,v)=u^2 + 2uv  v2 build corally a pattern. The remaining question is: in which order you can make a sieving (dividing by the primes) As the pattern is clear, the solution for the algorithm will come in 3 days. Bernhard @Batalov I support Gimps, LLD test place 164 
20171117, 21:09  #10 
Mar 2016
5^{2}·13 Posts 
A peaceful evening for all,
a proposition for a primesieve concerning f(u, v)=u² + 2uv v² : 1. Make a primesieve concerning the function f(u, u1) = 2u²1 from u=2 to u_max (there is a detailled description under http://devalco.de/quadr_Sieb_2x%5E21.php Safe all sieved out primes p with p < u_max, these primes appear in all quadratic functions with f(u, v) where u goes from 2 to u_max. (This should be the amount Q) 2. Make a sieving (vertikal) for f(u, 1)= u²+2u1 by using the presieved primes Q 3. Make a sieving (vertikal) for f(u, 2)= u²+4u4 by using the presieved primes Q 4. Make a sieving (vertikal) for f(u, 3)= u²+6u9 by using the presieved primes Q .... u2. Make a sieving (vertikal) for f(u, u2)= u²+2(u1)(u2)² by using the presieved primes Q The sieving is made by dividing the function f(u,v) by the primes Q. Do you have any idea why this prime sieve could be better than the prime generator for the function f(n)=2n²1 ? @Batalov It looks like Misc. Math is a cold, dark and windy place, do you have a more decent place for the thread ? Or please give a mathematical reason. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
a primesieve of the kind f=1 or f=7 mod 8 with the function f(u,v)=u²+2uvv²  bhelmes  Math  13  20180417 20:14 
A primesieve for f(u,v)=u²+v²  bhelmes  Number Theory Discussion Group  28  20180211 00:28 