mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2020-11-29, 20:52   #1
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

55216 Posts
Default low nash base 10 sequence

On Kamada page the is huge number of low nash base 10 sequences ( plus or minus side) Even with very small sieve depth I can remove many candidates, but I would like to do sieve to at least 1e14. And then I have problem since sr2sieve cannot do such depth on sequence like this 5539879179*10^n+1.


So does anyone here have some simpler solution except sieving one by one with srsieve and sr1sieve?


Update: for now srsieve2 is also in game (and since it is MT) it is fast solution :)

Last fiddled with by pepi37 on 2020-11-29 at 21:31
pepi37 is offline   Reply With Quote
Old 2020-11-30, 08:23   #2
sweety439
 
sweety439's Avatar
 
Nov 2016

3·5·132 Posts
Default

Quote:
Originally Posted by pepi37 View Post
On Kamada page the is huge number of low nash base 10 sequences ( plus or minus side) Even with very small sieve depth I can remove many candidates, but I would like to do sieve to at least 1e14. And then I have problem since sr2sieve cannot do such depth on sequence like this 5539879179*10^n+1.


So does anyone here have some simpler solution except sieving one by one with srsieve and sr1sieve?


Update: for now srsieve2 is also in game (and since it is MT) it is fast solution :)
This k is too large (>2^32), thus sr2sieve cannot handle, like that sr2sieve cannot handle the sequence (k*b^n+c)/gcd(k+c,b-1) (k>=1, b>=2, c != 0, gcd(k,c) = 1, gcd(b,c) = 1) such that gcd(k+c,b-1) is even (if gcd(k+c,b-1) is odd, then we still can use sr2sieve to sieve the sequence k*b^n+c for the prime not dividing gcd(k+c,b-1) and remove the n such that there is some prime p dividing gcd(k+c,b-1) which also divides (k*b^n+c)/gcd(k+c,b-1))
sweety439 is online now   Reply With Quote
Old 2020-11-30, 22:40   #3
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

2·3·227 Posts
Default

Quote:
Originally Posted by sweety439 View Post
This k is too large (>2^32), thus sr2sieve cannot handle, like that sr2sieve cannot handle the sequence (k*b^n+c)/gcd(k+c,b-1) (k>=1, b>=2, c != 0, gcd(k,c) = 1, gcd(b,c) = 1) such that gcd(k+c,b-1) is even (if gcd(k+c,b-1) is odd, then we still can use sr2sieve to sieve the sequence k*b^n+c for the prime not dividing gcd(k+c,b-1) and remove the n such that there is some prime p dividing gcd(k+c,b-1) which also divides (k*b^n+c)/gcd(k+c,b-1))

Sweety439, with all due respect , I didnot ask clarification of my problem ( since I also know sr2sieve doesnot working) I ask any "elegant" solution for my problem.
pepi37 is offline   Reply With Quote
Old 2020-12-03, 04:52   #4
Citrix
 
Citrix's Avatar
 
Jun 2003

23·197 Posts
Default

srsieve can handle multiple base 10 sequences at once.

eg)
srsieve.exe --pfgw --nmin 1 --nmax 10000 --pmin 1 --pmax 10000 --factors "3*10^n+1" "2*10^n-1"
Citrix is offline   Reply With Quote
Old 2020-12-03, 08:44   #5
pepi37
 
pepi37's Avatar
 
Dec 2011
After milion nines:)

2×3×227 Posts
Default

Quote:
Originally Posted by Citrix View Post
srsieve can handle multiple base 10 sequences at once.

eg)
srsieve.exe --pfgw --nmin 1 --nmax 10000 --pmin 1 --pmax 10000 --factors "3*10^n+1" "2*10^n-1"
Thanks

At the end srsieve2 was the winner since it can handle multiple bases at time and it is MT.
pepi37 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Nash value of exponent pepi37 Math 2 2018-09-09 04:56
Nash value pepi37 Math 0 2018-03-23 21:27
Nash weight of base 17 pepi37 Riesel Prime Search 18 2014-02-04 23:42
Nash Weights vs. Sievability LiquidNitrogen Information & Answers 7 2011-08-03 03:06
How to calculate Nash/robinson weight? cipher No Prime Left Behind 6 2009-05-09 15:35

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

Sat Dec 5 15:15:55 UTC 2020 up 2 days, 11:27, 0 users, load averages: 2.50, 2.33, 1.94

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.