mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > And now for something completely different

Reply
 
Thread Tools
Old 2020-05-13, 10:04   #1
sweety439
 
sweety439's Avatar
 
Nov 2016

43208 Posts
Default Dozenal near- and quasi- repunit primes

Are there any searching for near- and quasi- repunit primes (primes of the form aaa...aaab, abbb...bbb, aaa...aaabc, abbb...bbbc, abccc...ccc, see thread https://mersenneforum.org/showthread.php?t=19717) in dozenal (duodecimal)?

There are a lot of such searching in decimal (https://stdkmd.net/nrr/#factortables_nr and https://stdkmd.net/nrr/prime/primedifficulty.txt), and I finished this searching in dozenal up to n=1000 (decimal 1728)
Attached Files
File Type: txt dozenal near- are quasi- repunit primes.txt (87.3 KB, 16 views)
sweety439 is offline   Reply With Quote
Old 2020-05-13, 10:16   #2
sweety439
 
sweety439's Avatar
 
Nov 2016

8D016 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Are there any searching for near- and quasi- repunit primes (primes of the form aaa...aaab, abbb...bbb, aaa...aaabc, abbb...bbbc, abccc...ccc, see thread https://mersenneforum.org/showthread.php?t=19717) in dozenal (duodecimal)?

There are a lot of such searching in decimal (https://stdkmd.net/nrr/#factortables_nr and https://stdkmd.net/nrr/prime/), and I finished this searching in dozenal up to n=1000 (decimal 1728)
These forms have no known (probable) primes:

Code:
label     expression
{1}55     (10^n+3E7)/E
{2}97     (2*10^n+695)/E
{8}77     (8*10^n-107)/E
{E}9E     10^n-21
20{E}     21*10^n-1
22{E}     23*10^n-1
34{1}     (309*10^n-1)/E
53{E}     54*10^n-1
89{1}     (804*10^n-1)/E
99{1}     (8E4*10^n-1)/E
However, except the first three forms, all other forms cannot contain a prime because:

10^n-21, 21*10^n-1, (309*10^n-1)/E, 54*10^n-1, (804*10^n-1)/E

even n: algebra factors (difference of two squares)
odd n: factor of 11

23*10^n-1

even n: factor of 11
odd n: algebra factors (difference of two squares)

(8E4*10^n-1)/E

covering set {5, 11, 25}

also note that the form 1{5}1, which is (14*10^n-41)/E, can be prime only for n=1 because

even n: algebra factors (difference of two squares)
odd n: factor of 11

(and this number for n=1 is exactly 11)

Can someone found a prime of the form {1}55 (111...11155), {2}97 (222...22297), {8}77 (888...88877) in dozenal?
sweety439 is offline   Reply With Quote
Old 2020-05-13, 18:13   #3
sweety439
 
sweety439's Avatar
 
Nov 2016

43208 Posts
Default

I use srsieve to sieve all {a}b and a{b} forms, and type "srsieve -m 429981696 -n 1729 -N 248832 -p 13 -P 429981696 k.txt" and "srfile -G srsieve.out", however, the result text files are now apply to pfgw, these are the programs and the result text files (unfortunately, the folder is too large (>4 MB), even zipped, so I separate it to 3 zip files), can someone help me how to use srsieve to sieve them and make a file that is apply to pfgw?
Attached Files
File Type: zip dozenal near-repunit programs.zip (1.22 MB, 17 views)
File Type: zip dozenal near-repunit sieve files.zip (3.69 MB, 16 views)
File Type: zip t20_b12.zip (2.78 MB, 16 views)

Last fiddled with by sweety439 on 2020-05-13 at 18:15
sweety439 is offline   Reply With Quote
Old 2020-05-15, 08:06   #4
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

311 Posts
Post

Quote:
Originally Posted by sweety439 View Post
I use srsieve to sieve all {a}b and a{b} forms, and type "srsieve -m 429981696 -n 1729 -N 248832 -p 13 -P 429981696 k.txt" and "srfile -G srsieve.out", however, the result text files are now apply to pfgw, these are the programs and the result text files (unfortunately, the folder is too large (>4 MB), even zipped, so I separate it to 3 zip files), can someone help me how to use srsieve to sieve them and make a file that is apply to pfgw?
You don't want to use -G, or at least it's not the simplest way to accomplish what you're asking. The text files are essentially 'prp' files, I combined them into one abcd file:

srfile -a "t16_b12.txt" "t17_b12.txt" "t19_b12.txt"

which I then ran on pfgw for a few minutes without finding anything. If you need to anything, you could always switch back between g, a, or G switches. Replacing the files with * symbol

srfile -a "t*_b12.txt"

could save you some time.

BTW you should really check PRPtop before sieving sequences.

Last fiddled with by carpetpool on 2020-05-15 at 08:06
carpetpool is offline   Reply With Quote
Old 2020-05-17, 01:05   #5
sweety439
 
sweety439's Avatar
 
Nov 2016

24×3×47 Posts
Default

Quote:
Originally Posted by carpetpool View Post
You don't want to use -G, or at least it's not the simplest way to accomplish what you're asking. The text files are essentially 'prp' files, I combined them into one abcd file:

srfile -a "t16_b12.txt" "t17_b12.txt" "t19_b12.txt"

which I then ran on pfgw for a few minutes without finding anything. If you need to anything, you could always switch back between g, a, or G switches. Replacing the files with * symbol

srfile -a "t*_b12.txt"

could save you some time.

BTW you should really check PRPtop before sieving sequences.
Okay, update the zip file of the abcd file

However, when I do the pfgw.exe for this abcd file, it tested all numbers of the form 1*12^n-11 (numbers of the form {E}1 in dozenal) first, I want to test the numbers sorted by exponent (i.e. test n=1729 of all forms in the sieve file, then n=1730 of all forms in the sieve file, then n=1731 of all forms in the sieve file, etc.), how to do?
Attached Files
File Type: zip sr_12.zip (2.24 MB, 19 views)
sweety439 is offline   Reply With Quote
Old 2020-05-17, 06:55   #6
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

311 Posts
Post

I don't know of any utility that does this but srfile:

Code:
>>> srfile --help
srfile 0.6.17 -- A file utility for srsieve.
Usage: srfile [OPTION ...] <INFILE ...>
 -o --output FILE         Write sieve to FILE instead of srsieve.out.
 -k --known-factors FILE  Remove factors in FILE from the sieve.
 -d --delete SEQ          Delete sequence SEQ from the sieve e.g. -d "254*5^n-1"
 -g --newpgen             Write sieve to NewPGen format files t*_b*_k*.npg.
 -G --prp                 Write sieve to PRP (sorted by n) files t*_b*.prp.
 -w --pfgw                Write sieve to pfgw (sorted by n) file sr_b.pfgw.
 -a --abcd                Write sieve to abcd format file sr_b.abcd.
 -Q --subseqs X           Print base b^Q subsequence stats for all Q dividing X.
 -c --congruence X        Print congruence (mod X) information for sequences.
 -p --pfactor X           Print Prime95 worktodo.ini entries for P-1 factoring.
                          X is number of PRP tests saved by finding a factor.
 -v --verbose             Be verbose.
 -q --quiet               Be quiet.
 -h --help                Print this help.
 INFILE ...               Read sieve from INFILE.
The prp file separates the seqeunces by + or - 1 and + or - c is my understanding. Pfgw's 'abcfileformats.txt' file didn't have much helpful information on converting between ABC type files either. If you have a machine with at least 6 threads, you could try using the 3 prp files you initially had, and test each of them with pfgw simultaneuosly. Last I checked pfgw had a multi threading option, but I don't know how fast it is. You will probably get testing done faster this way.
carpetpool is offline   Reply With Quote
Old 2020-05-17, 10:11   #7
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

2·1,423 Posts
Default

srfile "-w" option sorts by n!
When running pfgw also use an expression like "{number_primes,$a,1}" in the header, see the documentation there.
kar_bon is offline   Reply With Quote
Old 2020-05-17, 15:21   #8
sweety439
 
sweety439's Avatar
 
Nov 2016

8D016 Posts
Default

Do you know what I tell? The cmd.exe prints:

Code:
Recognized ABCD Sieve file:
ABCD File
1*12^1735-11 is composite: RES64: [6BDE769573E9DD87] (0.0390s+0.0017s)
1*12^1741-11 is composite: RES64: [B58118C70216C647] (0.0347s+0.0015s)
1*12^1744-11 is composite: RES64: [142A82E3727A17D2] (0.0367s+0.0012s)
1*12^1746-11 is composite: RES64: [7E35AA5FEEC6F6FD] (0.0380s+0.0014s)
1*12^1749-11 is composite: RES64: [97163264F74252C8] (0.0412s+0.0018s)
1*12^1750-11 is composite: RES64: [E83850812A9BEBC8] (0.0401s+0.0014s)
1*12^1753-11 is composite: RES64: [1DB9B8478E2FA7C6] (0.0399s+0.0016s)
1*12^1758-11 is composite: RES64: [5EAE71FA1429FD5D] (0.0392s+0.0034s)
1*12^1762-11 is composite: RES64: [511A3C0E8959CE0E] (0.0395s+0.0013s)
1*12^1767-11 is composite: RES64: [59E005357B6740DD] (0.0445s+0.0014s)
1*12^1773-11 is composite: RES64: [AE3F4045D68FB340] (0.0692s+0.0014s)
1*12^1775-11 is composite: RES64: [2E6AE6083215A94F] (0.0453s+0.0018s)
1*12^1780-11 is composite: RES64: [98D5BD70E37258CC] (0.0377s+0.0015s)
1*12^1783-11 is composite: RES64: [A3923A1E6AA77841] (0.0427s+0.0013s)
1*12^1785-11 is composite: RES64: [9F1B420E350BFFCC] (0.0430s+0.0013s)
1*12^1793-11 is composite: RES64: [DCCA9D5E4B98EB44] (0.0459s+0.0012s)
1*12^1806-11 is composite: RES64: [EE0AD2158FEEFCDC] (0.0386s+0.0039s)
1*12^1810-11 is composite: RES64: [398A1BC7C63F2956] (0.0475s+0.0014s)
1*12^1813-11 is composite: RES64: [03761C9BFB3ABD46] (0.0486s+0.0014s)
1*12^1835-11 is composite: RES64: [F6E11B4B32134874] (0.0378s+0.0014s)
1*12^1840-11 is composite: RES64: [BCFE8C1BAF1D26B2] (0.0553s+0.0016s)
1*12^1869-11 is composite: RES64: [0569E7AD2978EC5C] (0.0560s+0.0042s)
1*12^1870-11 is composite: RES64: [F41DB45A4575B26D] (0.0551s+0.0010s)
1*12^1873-11 is composite: RES64: [E43D492C726AB3C8] (0.0492s+0.0014s)
1*12^1881-11 is composite: RES64: [EC7DB6D650DCAAA8] (0.0504s+0.0014s)
1*12^1895-11 is composite: RES64: [A1168D47291AFB92] (0.0551s+0.0012s)
1*12^1896-11 is composite: RES64: [A91D2899F9E80912] (0.0500s+0.0015s)
1*12^1901-11 is composite: RES64: [3AE6E7644F645918] (0.0537s+0.0014s)
1*12^1905-11 is composite: RES64: [B883EE2E70080C73] (0.0512s+0.0014s)
1*12^1908-11 is composite: RES64: [60959CD3DBDB153E] (0.0496s+0.0013s)
1*12^1911-11 is composite: RES64: [4B58FDB27213AB3B] (0.0497s+0.0011s)
1*12^1921-11 is composite: RES64: [37CEC4EB70D1574A] (0.0483s+0.0014s)
1*12^1926-11 is composite: RES64: [FCB2F1D40487D934] (0.0581s+0.0013s)
It runs all numbers of the form 1*12^n-11 first, I want that it runs all numbers with n=1729 first, then n=1730, then n=1731, etc. like this: (the numbers in this list is not right, all numbers divisible by 11 should be divided by 11)

Code:
1*12^1729+43
1*12^1729+65
1*12^1729+109
2*12^1729-13
2*12^1729+31
2*12^1729+53
2*12^1729+97
3*12^1729-25
3*12^1729+19
3*12^1729+41
3*12^1729+85
4*12^1729-37
4*12^1729+7
4*12^1729+29
4*12^1729+73
5*12^1729-49
5*12^1729+17
5*12^1729+61
6*12^1729-61
6*12^1729-17
6*12^1729+5
6*12^1729+49
7*12^1729-73
7*12^1729-29
7*12^1729+37
8*12^1729-85
8*12^1729-41
8*12^1729-19
8*12^1729+25
9*12^1729-97
9*12^1729-53
9*12^1729-31
9*12^1729+13
10*12^1729-109
10*12^1729-43
10*12^1729+1
1*12^1729-11
1*12^1729-7
1*12^1729-5
16*12^1729-5
18*12^1729-7
2*12^1729-1
23*12^1729-1
27*12^1729-5
29*12^1729-7
3*12^1729-1
34*12^1729-1
38*12^1729-5
40*12^1729-7
4*12^1729-1
45*12^1729-1
49*12^1729-5
51*12^1729-7
5*12^1729-1
56*12^1729-1
62*12^1729-7
6*12^1729-1
67*12^1729-1
71*12^1729-5
73*12^1729-7
7*12^1729-1
78*12^1729-1
82*12^1729-5
8*12^1729-1
89*12^1729-1
93*12^1729-5
95*12^1729-7
9*12^1729-1
100*12^1729-1
104*12^1729-5
106*12^1729-7
10*12^1729-1
111*12^1729-1
117*12^1729-7
11*12^1729-1
122*12^1729-1
126*12^1729-5
128*12^1729-7
1*12^1730+43
1*12^1730+65
1*12^1730+109
2*12^1730-13
2*12^1730+31
2*12^1730+53
2*12^1730+97
3*12^1730-25
3*12^1730+19
3*12^1730+41
3*12^1730+85
4*12^1730-37
4*12^1730+7
4*12^1730+29
4*12^1730+73
5*12^1730-49
5*12^1730+17
5*12^1730+61
6*12^1730-61
6*12^1730-17
6*12^1730+5
6*12^1730+49
7*12^1730-73
7*12^1730-29
7*12^1730+37
8*12^1730-85
8*12^1730-41
8*12^1730-19
8*12^1730+25
9*12^1730-97
9*12^1730-53
9*12^1730-31
9*12^1730+13
10*12^1730-109
10*12^1730-43
10*12^1730+1
1*12^1730-11
1*12^1730-7
1*12^1730-5
16*12^1730-5
18*12^1730-7
2*12^1730-1
23*12^1730-1
27*12^1730-5
29*12^1730-7
3*12^1730-1
34*12^1730-1
38*12^1730-5
40*12^1730-7
4*12^1730-1
45*12^1730-1
49*12^1730-5
51*12^1730-7
5*12^1730-1
56*12^1730-1
62*12^1730-7
6*12^1730-1
67*12^1730-1
71*12^1730-5
73*12^1730-7
7*12^1730-1
78*12^1730-1
82*12^1730-5
8*12^1730-1
89*12^1730-1
93*12^1730-5
95*12^1730-7
9*12^1730-1
100*12^1730-1
104*12^1730-5
106*12^1730-7
10*12^1730-1
111*12^1730-1
117*12^1730-7
11*12^1730-1
122*12^1730-1
126*12^1730-5
128*12^1730-7
1*12^1731+43
1*12^1731+65
1*12^1731+109
2*12^1731-13
2*12^1731+31
2*12^1731+53
2*12^1731+97
3*12^1731-25
3*12^1731+19
3*12^1731+41
3*12^1731+85
4*12^1731-37
4*12^1731+7
4*12^1731+29
4*12^1731+73
5*12^1731-49
5*12^1731+17
5*12^1731+61
6*12^1731-61
6*12^1731-17
6*12^1731+5
6*12^1731+49
7*12^1731-73
7*12^1731-29
7*12^1731+37
8*12^1731-85
8*12^1731-41
8*12^1731-19
8*12^1731+25
9*12^1731-97
9*12^1731-53
9*12^1731-31
9*12^1731+13
10*12^1731-109
10*12^1731-43
10*12^1731+1
1*12^1731-11
1*12^1731-7
1*12^1731-5
16*12^1731-5
18*12^1731-7
2*12^1731-1
23*12^1731-1
27*12^1731-5
29*12^1731-7
3*12^1731-1
34*12^1731-1
38*12^1731-5
40*12^1731-7
4*12^1731-1
45*12^1731-1
49*12^1731-5
51*12^1731-7
5*12^1731-1
56*12^1731-1
62*12^1731-7
6*12^1731-1
67*12^1731-1
71*12^1731-5
73*12^1731-7
7*12^1731-1
78*12^1731-1
82*12^1731-5
8*12^1731-1
89*12^1731-1
93*12^1731-5
95*12^1731-7
9*12^1731-1
100*12^1731-1
104*12^1731-5
106*12^1731-7
10*12^1731-1
111*12^1731-1
117*12^1731-7
11*12^1731-1
122*12^1731-1
126*12^1731-5
128*12^1731-7
Attached Files
File Type: txt cmd print for dozenal near-repunit.txt (6.7 KB, 19 views)

Last fiddled with by sweety439 on 2020-05-17 at 15:22
sweety439 is offline   Reply With Quote
Old 2020-05-17, 15:30   #9
sweety439
 
sweety439's Avatar
 
Nov 2016

24·3·47 Posts
Default

Also, the abcd file has the number 1*12^n+43, 1*12^65, 1*12^109, etc. instead of (1*12^n+43)/11, (1*12^n+65)/11, (1*12^n+109)/11, etc. however, I want to test the primility for the (1*12^n+43)/11, (1*12^n+65)/11, (1*12^n+109)/11, etc. how to change the numbers in the abcd file? For text file (for the prp file), I know how to do, like my reserving for extended SR46 and SR58: (For every base (b) for the forms (k*b^n+1)/gcd(k+1,b-1) and (k*b^n-1)/gcd(k-1,b-1), there exists a unique value of k for each form that has been conjectured to be the lowest 'Sierpinski value' (+1 form) or 'Riesel value' (-1 form) that is composite for all values of n >= 1. k's make a full covering set with all or partial algebraic factors (e.g. (4*19^n-1)/3, 4*24^n-1, (4*25^n-1)/3, 9*4^n-1, (9*25^n-1)/8, 9*36^n-1) are not considered)
Attached Files
File Type: txt t16_b46.txt (65.6 KB, 18 views)
File Type: txt t17_b46.txt (116.7 KB, 15 views)
File Type: txt t16_b58.txt (892.6 KB, 14 views)
sweety439 is offline   Reply With Quote
Old 2020-05-17, 15:48   #10
sweety439
 
sweety439's Avatar
 
Nov 2016

24·3·47 Posts
Default

Besides, I use srsieve to sieve them, but srsieve can only sieve a*b^n+c with a>=1, b>=2, c != 0, gcd(a,c)=1, gcd(b,c)=1, it cannot sieve the general case (a*b^n+c)/d (like many cases of dozenal near-repunits:

Code:
{1}5 (12^n+43)/11
{1}7 (12^n+65)/11
{1}E (12^n+109)/11
2{1} (23*12^n-1)/11
3{1} (34*12^n-1)/11
4{1} (45*12^n-1)/11
Thus I sieve 12^n+43, 12^n+65, 12^n+109, 23*12^n-1, 34*12^n-1, 45*12^n-1, etc. instead of (12^n+43)/11, (12^n+65)/11, (12^n+109)/11, (23*12^n-1)/11, (34*12^n-1)/11, (45*12^n-1)/11, etc. in srsieve, but since these numbers are all divisible by 11, thus I can only sieve start with the prime 13, or all numbers will be removed from the sieve file, and there are still many dozenal near-repunits that are divisible by 5, 7, or 11 in the sieve file, do you know how to remove them?
Attached Files
File Type: txt cmd print for dozenal near-repunit.txt (3.2 KB, 18 views)
sweety439 is offline   Reply With Quote
Old 2020-05-17, 19:26   #11
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

311 Posts
Post

Quote:
Originally Posted by sweety439 View Post
Besides, I use srsieve to sieve them, but srsieve can only sieve a*b^n+c with a>=1, b>=2, c != 0, gcd(a,c)=1, gcd(b,c)=1, it cannot sieve the general case (a*b^n+c)/d (like many cases of dozenal near-repunits:

Code:
{1}5 (12^n+43)/11
{1}7 (12^n+65)/11
{1}E (12^n+109)/11
2{1} (23*12^n-1)/11
3{1} (34*12^n-1)/11
4{1} (45*12^n-1)/11
Thus I sieve 12^n+43, 12^n+65, 12^n+109, 23*12^n-1, 34*12^n-1, 45*12^n-1, etc. instead of (12^n+43)/11, (12^n+65)/11, (12^n+109)/11, (23*12^n-1)/11, (34*12^n-1)/11, (45*12^n-1)/11, etc. in srsieve, but since these numbers are all divisible by 11, thus I can only sieve start with the prime 13, or all numbers will be removed from the sieve file, and there are still many dozenal near-repunits that are divisible by 5, 7, or 11 in the sieve file, do you know how to remove them?
Srsieve is for numbers of the form k*b^n+-c and sr2sieve requires that k=1 or c=1. Thus, you would have to find a program that sieves your requested forms, or use the -f switch in pfgw instead of a sieve (trial factoring is only slightly slower than actual sieving BTW). Alternatively, you could make a program with GP or some other math library which sieves your specific form. I did this once for other forms that don't have a dedicated sieving program. I could send you an example if you like.
carpetpool is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Quasi-aliquot Sequences? sweety439 Aliquot Sequences 2 2020-06-21 21:45
repunit mod 43 enzocreti enzocreti 3 2020-02-14 12:18
Mersenne numbers in Dozenal base tuckerkao Lounge 7 2020-02-11 04:44
Near- and quasi-repunit PRPs Batalov And now for something completely different 10 2019-09-12 13:31
Generalized Repunit primes Bob Underwood Math 11 2017-01-25 11:19

All times are UTC. The time now is 18:45.

Mon Sep 28 18:45:36 UTC 2020 up 18 days, 15:56, 1 user, load averages: 2.45, 2.17, 2.15

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.