World!Of
Numbers  WON plate
197 |

[ December 6, 2015 ]
Adding 1's, 3's, 7's and 9's to n
so that n becomes a record delayed prime.
and more derived challenges along the way.
Let me coin these numbers FEP's or First Encountered Primes. Last update : [ December 29, 2016 ]

Let me start with a simple example to illustrate things
in order to get familiar with intention and notation.

Suppose the number 5 is our next number to investigate
let me append 1's as long as it stays composite and stop if
the extension of 5 becomes prime.

 =  = 51 = 3 x 17 = composite
 =  = 511 = 7 x 73 = composite
 =  = 5111 = 19 x 269 = composite
 =  = 51111 = 3 x 3 x 3 x 3 x 631 = composite
 =  = 511111 = prime!

So if this is our next record delayed prime
than  will be added to the table.
(Note : it is indeed a record number by the way).

There are cases whereby appending any number of 1's, 3's, 7's or 9's
always produce composites ad infinitum. Of course, these cases
are discarded. E.g. [3n] divisible by 3.
Also for instance [1n] and [1n] but are more complicated.

For the sake of this wonplate it is not about enlisting all factors
of the composite. Though it might be useful to detect infinite patterns.
Also when numbers get larger I will accept PRP (PRobable Prime)
as valid entries.

Already number  set a milestone as it needed 136 1's
appended before the number got prime! (Source)
So the next record number must have at least 137 1's.

(a few days later...) Yet with  things becomes very hard.
But there are three more columns left for you to fill in.
Maybe that the slope of increase of appended digits to reach
a prime will be less steep than in the first column.

 For starters on PRP'ing here are a few links that will be helpfull. Download the latest version at SourceForge: http://sourceforge.net/projects/openpfgw/files/?source=navbar Introduction into the world of OpenPFGW (or PrimeForm): https://primes.utm.edu/bios/page.php?id=432 How to determine whether a large number is prime What is the fastest deterministic primality test?

 Prime byappending 1's Prime byappending 3's Prime byappending 7's Prime byappending 9's                  [3 > 50000]         [1 > 300000]       [9 > 1690000] Found byPDG Found byGary Barnes Upto  byJeff HeleenFrom  byGary Barnes** Upto  byJeff HeleenFrom  byGary Barnes*** *** Message from Gary Barnes [ December 14, 2016 ]In the column "Prime by appending 9's" this problemis the same as CRUS's Riesel base 10 problem as shown athttp://www.noprimeleftbehind.net/crus/Riesel-conjectures.htm.Due to the substantial searching done by project CRUSmany additional terms can be added to the right column. is still being searched with no prime yet found.Because the appending of 9's after a [k]-value can bereduced to the form (k+1)*10^n-1 all of these are proven primes. ** Message from Gary Barnes [ December 28, 2016 ]In the column "Prime by appending 7's" I havefound the following PRP's:1. (7666*10^28895-7)/92. (16936*10^47927-7)/9These convert to:1. 851*10^28895+(10^28895-1)*7/92. 1881*10^47927+(10^47927-1)*7/9All k's in between these were searched for append 7.k=891 has a covering set and so is always composite. See below. I have not searched k > 1881. Cases that produce only infinite composites Classification (a.k.a. covering sets)c1_1 = permutation of factors (11, 3, 11, 13, 3, 7)c1_2 = permutation of factors (11, 3, 11, 37, 3, 7)c1_3 = permutation of factors (7, 3, 37, 13, 3, 37)c1_4 = infinite pattern of semiprimesc3_1 = permutation of factors (13, 11, 37, 11, 7, 11)c7_1 = permutation of factors (37, 11, 3, 11, 13, 11)c9_1 = permutation of factors (7, 11, 37, 11, 13, 11) [1n] = c1_3 [1n] = c1_4 [1n] = c1_1 [1n] = c1_1 [1n] = c1_3 [1n] = c1_4 [1n] = c1_2 [1n] = c1_2 [1n] = c1_2 [1n] = c1_1 [1n] = c1_1 [1n] = c1_1 [1n] = c1_1 [1n] = c1_2 [1n] = c1_1 [1n] = c1_1 [1n] = c1_1 [3 x n][3n][3n] = c3_1 [7 x n][7n][7n] = c7_1 [3 x n][9n][9n] = c9_1 [3n] and [7n] likely found byhttps://www.rose-hulman.edu/~rickert/Compositeseq/[9n] found byhttp://www.noprimeleftbehind.net/crus/Riesel-conjectures.htm Sequence [k] in order of increasing added digitsEach value < n in [k][1n] must be composite                Continued here Narcissistic cases [p][1q] whereby p equals q    Palindromic cases [p][1q] whereby p and q are palindromic      Crossreferenced cases [p][1q] whereby p != q [p][1q] & [q][1p]None found sofar Here is an elaborated example of how factorizations of
([1n]) allows to detect infinite composite patterns.

The first 21 factorizations produce the next list

```
(1_1) = 3 x 127
(1_2) = 37 x 103
(1_3) = 23 x 1657
(1_4) = 3 x 127037
(1_5) = 17 x 37 x 73 x 83
(1_6) = 233 x 163567
(1_7) = 3 ^ 2 x 42345679
(1_8) = 37 x 113 x 613 x 1487
(1_9) = 31 x 2333 x 526957
(1_10) = 3 x 2399 x 52954163
(1_11) = 37 x 103003003003
(1_12) = 23333 x 1633356667
(1_13) = 3 x 73 x 1740233384069
(1_14) = 37 x 2287 x 45038479669
(1_15) = 353 x 661 x 163333566667
(1_16) = 3 ^ 2 x 131 x 323249458109509
(1_17) = 37 x 114346289 x 900798827
(1_18) = 19 x 227 x 541 x 2857 x 5716953331
(1_19) = 3 x 879449 x 1140233 x 126685261
(1_20) = 37 x 393380951 x 261840342653
(1_21) = 17 x 73 x 1372549 x 22374429543379
```
One sees immediately that the first, the fourth, the seventh, etc.
or {1 +3} for short are all divisible by 3, so these can be put aside.
Idem dito for {2, +3} where all numbers can be divided by 37.

If I shift these to be ignored cases you see what is left over.

```
(1_1) = 3 x 127
(1_2) = 37 x 103
(1_3) = 23 x 1657
(1_4) = 3 x 127037
(1_5) = 17 x 37 x 73 x 83
(1_6) = 233 x 163567
(1_7) = 3 ^ 2 x 42345679
(1_8) = 37 x 113 x 613 x 1487
(1_9) = 31 x 2333 x 526957
(1_10) = 3 x 2399 x 52954163
(1_11) = 37 x 103003003003
(1_12) = 23333 x 1633356667
(1_13) = 3 x 73 x 1740233384069
(1_14) = 37 x 2287 x 45038479669
(1_15) = 353 x 661 x 163333566667
(1_16) = 3 ^ 2 x 131 x 323249458109509
(1_17) = 37 x 114346289 x 900798827
(1_18) = 19 x 227 x 541 x 2857 x 5716953331
(1_19) = 3 x 879449 x 1140233 x 126685261
(1_20) = 37 x 393380951 x 261840342653
(1_21) = 17 x 73 x 1372549 x 22374429543379
```

Spotting , ,  one sees that we are
dealing with semiprimes or numbers with two primefactors.
When more factors are given, these can always be brought back
to two factors (be it composite for one or both).

Take e.g.  = 17 x 73 x 1372549 x 22374429543379
which is in fact (17 x 1372549) x (73 x 22374429543379)
or ( 23333333 ) x ( 1633333356666667 )

The general formula for {3 +3} becomes
[3m] x [3m-1][6m-1]
So the whole range of numbers is covered and
no primes can arise from [1n] !

Here is the extracted list of genuine semiprimes for {3 +3}

```
(1_3) ➜ m = 1 ➜ 23 x 1657
(1_6) ➜ m = 2 ➜ 233 x 163567
(1_12) ➜ m = 4 ➜ 23333 x 1633356667
(1_66) ➜ m = 22 ➜ ( 2_322 ) x ( 16_321_5_621_7 ) or
23333333333333333333333 x
1633333333333333333333356666666666666666666667
```

Can you find more of these semiprimes ?

Note : a preliminary search revealed that the next semiprime
is greater than (1_300000) !
Source http://stdkmd.com/nrr/2/23333.htm  A000197 Prime Curios! Prime Puzzle  Wikipedia 197 Le nombre 197 ```

```

[ TOP OF PAGE]

Patrick De Geest - Belgium - Short Bio - Some Pictures