- **Miscellaneous Math**
(*https://www.mersenneforum.org/forumdisplay.php?f=56*)

- - **Fulsorials**
(*https://www.mersenneforum.org/showthread.php?t=22061*)

Won't be anytime soon. I am only hoping it will be in my lifetime.:smile:
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.:smile: |

[QUOTE=a1call;511699]
There is currently no established way of showing the integer in a reduced form, but it would be quite easy to invent one.:smile:[/QUOTE] I am not sure if you are aware or not - your sequence is a recursive quadratic polynomial. You can just specify the seed and the depth level. x_next=f(x) where f(x)=x^2-x+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. |

[QUOTE=Citrix;552266]I am not sure if you are aware or not - your sequence is a recursive quadratic polynomial. You can just specify the seed and the depth level.
x_next=f(x) where f(x)=x^2-x+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.[/QUOTE] This is a very old thread and the concept has evolved since the OP. Your definition seems to relate to N-1 flavour with k=1. The oeis sequence is the N+1 flavour. There are two primary iteration-flavours and infinite combinations of the 2 are possible. The k-always-equal-1 is problematic since any (large) non-prime iteration will render the later iterations non-provable. The modular logic you point out is very helpful and should speed things up. Thank you very much.:smile: 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.:smile: |

All times are UTC. The time now is 16:40. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.