Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Section 4.9, physical pp. 17–18 of the selected author version.

The first seventeen inputs

Work in the deleted class 11(mod24)11\pmod {24}. The first sixteen ordered packages are

H1,…,H16=(2,4,8,16↑,3⋅1,3⋅2,3⋅4,3⋅8,3⋅16↑,9↑(1,2),9↑(4,8),5↑(1,2,4,8),5↑(16↑,3⋅1,3⋅2,3⋅4),5↑(3⋅8,3⋅16↑,9↑(1,2),9↑(4,8)),7↑(1,2,4,8,16↑,3⋅1),7↑(3⋅2,3⋅4,3⋅8,3⋅16↑,5↑(1,2,4,8),5↑(16↑,3⋅1,3⋅2,3⋅4))).(1)\begin{aligned} H_1,\ldots,H_{16}=\bigl(&2,4,8,16^\uparrow, 3\cdot1,3\cdot2,3\cdot4,3\cdot8,3\cdot16^\uparrow,\\ &9^\uparrow(1,2),9^\uparrow(4,8), 5^\uparrow(1,2,4,8),\\ &5^\uparrow(16^\uparrow,3\cdot1,3\cdot2,3\cdot4),\\ &5^\uparrow(3\cdot8,3\cdot16^\uparrow, 9^\uparrow(1,2),9^\uparrow(4,8)),\\ &7^\uparrow(1,2,4,8,16^\uparrow,3\cdot1),\\ &7^\uparrow(3\cdot2,3\cdot4,3\cdot8,3\cdot16^\uparrow, 5^\uparrow(1,2,4,8), 5^\uparrow(16^\uparrow,3\cdot1,3\cdot2,3\cdot4))\bigr). \tag{1} \end{aligned}

The prime-power package 9↑(16↑,_)9^\uparrow(16^\uparrow,\_) was kept in reserve. Put

H17=9↑(16↑,_)+7↑(9↑(x,1),9↑(x,2),9↑(x,4),9↑(x,8),9↑(x,16↑),5↑(9↑(x,1),9↑(x,2),9↑(x,4),9↑(x,8))).(2)\begin{aligned} H_{17}={}&9^\uparrow(16^\uparrow,\_)\\ &+7^\uparrow\bigl(9^\uparrow(x,1),9^\uparrow(x,2), 9^\uparrow(x,4),9^\uparrow(x,8),9^\uparrow(x,16^\uparrow),\\ &\hspace{28mm}5^\uparrow(9^\uparrow(x,1),9^\uparrow(x,2), 9^\uparrow(x,4),9^\uparrow(x,8))\bigr). \tag{2} \end{aligned}

The reserve supplies the one previously missing 99-child and the six 77-inputs in (2) fill its remaining descendants.

The last five inputs

The source permits any suitable earlier packages, adding the atomic package 11 if needed. Fix the ordered pool

(K1,…,K18)=(1,H1,H2,…,H17)(3)(K_1,\ldots,K_{18})=(1,H_1,H_2,\ldots,H_{17}) \tag{3}

and the reproducible selections

H18=13↑(K1,…,K12),H19=17↑(K1,…,K16),H20=19↑(K1,…,K18).(4)\begin{aligned} H_{18}&=13^\uparrow(K_1,\ldots,K_{12}),\\ H_{19}&=17^\uparrow(K_1,\ldots,K_{16}),\\ H_{20}&=19^\uparrow(K_1,\ldots,K_{18}). \tag{4} \end{aligned}

These have exactly the required 12,16,1812,16,18 regular inputs. They are new complete arrow packages on the present branch; they do not assert that the earlier partial prime-1717 or prime-1919 target packages have become complete in their original contexts.

None of H1,…,H20H_1,\ldots,H_{20} has a regular factor 1111. Partition these twenty ordered packages into the first ten and last ten, and use the two blocks to fill two copies of 11↑11^\uparrow. Call the results H21H_{21} and H22H_{22}.

The complete prime-2323 package is

T23=23↑(H1,…,H22).(5)\boxed{\mathcal T_{23}=23^\uparrow(H_1,\ldots,H_{22}).} \tag{5}

Complete proof

Each of the first fourteen packages in (1) is complete by the initial 2,3,52,3,5 construction. The last two are complete 77-packages with six displayed inputs. Formula (2) closes the one reserved 99-branch. The ordinary arrow rule and the exact prefixes in (4) then give H18,H19,H20H_{18},H_{19},H_{20} on the stated restricted branch. Their new primes 13,17,1913,17,19 distinguish them from the earlier pool and from one another. The absence of 1111 makes the final two ten-package blocks valid inputs for two new 1111 arrows.

The exact region partition on the signature-certificate page shows that H1,…,H17H_1,\ldots,H_{17} are disjoint. The next three acquire, respectively, new 13,17,1913,17,19 factors, and the last two attach 1111 to disjoint exact ten-package blocks. None has prime 2323 before being placed in (5). Thus (5) covers every child of the modulus-2424 hole without repeating a regular modulus. The separate finite-arrow lemma closes every marked tail.

Used by. Later Nielsen templates and Owens's construction.

Bears on. Problem 2.