mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2020-08-02, 01:28   #45
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

36348 Posts
Default

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 2020-08-02 at 01:29
a1call is online now   Reply With Quote
Old 2020-08-02, 05:48   #46
Citrix
 
Citrix's Avatar
 
Jun 2003

23×197 Posts
Default

Quote:
Originally Posted by a1call View Post
There is currently no established way of showing the integer in a reduced form, but it would be quite easy to invent one.
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.

Last fiddled with by Citrix on 2020-08-02 at 05:55 Reason: typo
Citrix is offline   Reply With Quote
Old 2020-08-03, 00:31   #47
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

22×487 Posts
Default

Quote:
Originally Posted by Citrix View Post
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.
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.
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 2020-08-03 at 00:55
a1call is online now   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 01:01.

Sun Dec 6 01:01:45 UTC 2020 up 2 days, 21:13, 0 users, load averages: 3.21, 2.49, 2.02

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.