Linear Prime Chains

On Thursday, June 10th of 2019, I posted about Generalised Cunningham Chains while linking to earlier posts that discussed the topic of Cunningham chains. Today I was reminded of these chains because the number associated with my diurnal age has the following property:

A124017

Numbers \(n\) for which \(2n-1\), \(4n-1\), \(8n-1\), \(16n-1\) and \(32n-1\) are primes.

The initial members of the sequence are:

45, 90, 26820, 26925, 30705, 31710, 33375, 63420, 63570, 71805, 83865, 93075, 103185, 127140, 134025, 148050, 170460, 202635, 211035, 223305, 269505, 297225, 303660, 329175, 335625, 362505, 387975, 405270, 405405, 406425, 409755, 463335

In the case of 26925, the sequence of primes generated is 53849, 107699, 215399, 430799 and 861599. At first I thought the sequence was a Cunningham chain of the second kind with a length of 5. This type of chain has the property that  \(p_{i+1} = 2p_{i} − 1\) for all \(1 \leq i \leq 5 \) but, as can be seen, it is the new number that is doubled and not the original one. In other words, a Cunningham chain of the second kind with a length of 6 and a starting prime of \(p\) would give a sequence of \(p, 2p-1, 4p-3, 8p-7, 16p-15, 32p-31\). Not the same sequence at all.

I was interested in pushing the number of primes further and test for \(64n-1\). Up to one million this yields the following sequence of numbers with their prime chains attached:

45 --> 89 179 359 719 1439 2879 

31710 --> 63419 126839 253679 507359 1014719 2029439 

63570 --> 127139 254279 508559 1017119 2034239 4068479 

202635 --> 405269 810539 1621079 3242159 6484319 12968639 

405405 --> 810809 1621619 3243239 6486479 12972959 25945919 

534600 --> 1069199 2138399 4276799 8553599 17107199 34214399 

561330 --> 1122659 2245319 4490639 8981279 17962559 35925119 

589305 --> 1178609 2357219 4714439 9428879 18857759 37715519 

666945 --> 1333889 2667779 5335559 10671119 21342239 42684479 

799350 --> 1598699 3197399 6394799 12789599 25579199 51158399 

903045 --> 1806089 3612179 7224359 14448719 28897439 57794879 

979125 --> 1958249 3916499 7832999 15665999 31331999 62663999 

How many numbers up to one million will generate primes up to \(128n-1\)? Well as it turns out, only one number. Beyond \(128n-1\), there are no chains in the range up to one million.

561330 --> 1122659 2245319 4490639 8981279 17962559 35925119 71850239 

Just as with generalised Cunningham chains, we can also generalise this particular prime chain sequence by changing the value of the subtrahend. Let's change it to 3 and look for prime chains starting with \(2n-3\) and ending with \(128n-3\). Here's the result and there are seven numbers instead of just one in the range up to one million:

3025 --> 6047 12097 24197 48397 96797 193597 387197 

238865 --> 477727 955457 1910917 3821837 7643677 15287357 30574717 

253880 --> 507757 1015517 2031037 4062077 8124157 16248317 32496637 

477730 --> 955457 1910917 3821837 7643677 15287357 30574717 61149437 

507760 --> 1015517 2031037 4062077 8124157 16248317 32496637 64993277 

680185 --> 1360367 2720737 5441477 10882957 21765917 43531837 87063677 

883180 --> 1766357 3532717 7065437 14130877 28261757 56523517 113047037 

We even get 2 numbers that generate a chain that goes up to \(256n-3\). They are:

238865 --> 477727 955457 1910917 3821837 7643677 15287357 30574717 61149437 

253880 --> 507757 1015517 2031037 4062077 8124157 16248317 32496637 64993277  

There are no numbers in the range that generate primes up to \(512n-1\). Let's try a subtrahend of 5 and see what numbers generate primes in the range from \(2n-5\) up to \(128n-5\). The results are:

 273 --> 541 1087 2179 4363 8731 17467 34939 

 933 --> 1861 3727 7459 14923 29851 59707 119419 

 54558 --> 109111 218227 436459 872923 1745851 3491707 6983419 

 59553 --> 119101 238207 476419 952843 1905691 3811387 7622779 

 65811 --> 131617 263239 526483 1052971 2105947 4211899 8423803 

447678 --> 895351 1790707 3581419 7162843 14325691 28651387 57302779 

887226 --> 1774447 3548899 7097803 14195611 28391227 56782459 113564923 

There are no numbers up to one million that generate primes up to \(256n-5\). What about a subtrahend of 7 and a range from \(2n-7\) to \(128n-7\)? The results are:

27360 --> 54713 109433 218873 437753 875513 1751033 3502073 

517875 --> 1035743 2071493 4142993 8285993 16571993 33143993 66287993 

524805 --> 1049603 2099213 4198433 8396873 16793753 33587513 67175033 

549915 --> 1099823 2199653 4399313 8798633 17597273 35194553 70389113 

749580 --> 1499153 2998313 5996633 11993273 23986553 47973113 95946233 

There are no numbers that generate chains up to \(256n-7\). I think that's enough for the subtrahends but what about the coefficients? We could generalise further by looking at even coefficients larger than 2. If we choose odd coefficients, then every odd number will produce an even number when an odd subtrahend is subtracted. Let's try \(4n-11\) in the range up to \(256n-11\). The results are:

187123 --> 748481 2993957 11975861 47903477 191613941 766455797 3065823221 12263292917 

363375 --> 1453489 5813989 23255989 93023989 372095989 1488383989 5953535989 23814143989 

426040 --> 1704149 6816629 27266549 109066229 436264949 1745059829 6980239349 27920957429 

723330 --> 2893309 11573269 46293109 185172469 740689909 2962759669 11851038709 47404154869 

The reason that 187123 is marked in red is that it is the only starting number that is prime. This of course is rather interesting. All the other long chains are generated by composite numbers. Here is a permalink that allows for experimentation with prime chains generated by a number \(n\) using the linear mapping of \(a \cdot n-b\) where \(a\) and \(b\) are integers.

For a post that has relevance to the content of this post, visit Prime Producing Linear Polynomials. After all, what I've been investigating in this post is simply a variety of prime producing linear polynomials of the general from \(y=ax+b\) where \(a,b\) and \(x\) are restricted to integer values.