20200802, 01:28  #45 
"Rashid Naimi"
Oct 2015
Remote to Here/There
2^{3}·11·23 Posts 
Won't be anytime soon. I am only hoping it will be in my lifetime.
I have to retool my setup for the next iteration. I intend to try a better sieving method so it will be some time before it's ready. But thanks for the compliment. Last fiddled with by a1call on 20200802 at 01:29 
20200802, 05:48  #46  
Jun 2003
1,579 Posts 
Quote:
x_next=f(x) where f(x)=x^2x+1 2>3>7>43> For sieve: Factors would be of format factor==1 (mod 6) Also given the recurrent nature you can easily calculate which depth level a prime p will divide. Last fiddled with by Citrix on 20200802 at 05:55 Reason: typo 

20200803, 00:31  #47  
"Rashid Naimi"
Oct 2015
Remote to Here/There
2^{3}·11·23 Posts 
Quote:
Your definition seems to relate to N1 flavour with k=1. The oeis sequence is the N+1 flavour. There are two primary iterationflavours and infinite combinations of the 2 are possible. The kalwaysequal1 is problematic since any (large) nonprime iteration will render the later iterations nonprovable. The modular logic you point out is very helpful and should speed things up. Thank you very much. I am lost in your last sentence, but I assume regardless that, the necessary depth will be beyond what can be executed for a 400k dd integer so perhaps we can leave it at that. Again thanks for the insight. Last fiddled with by a1call on 20200803 at 00:55 
