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.8, physical pp. 16–17 of the selected author version.

The first sixteen inputs

Work in the deleted class 5(mod12)5\pmod {12}, which lies on its 1(mod4)1\pmod4 branch. Begin with the ten ordered packages

F1,…,F10=(4,8↑,3⋅1,3⋅2,3⋅4,3⋅8↑,9↑(1,2),9↑(4,8↑),5↑(1,2,4,8↑),5↑(3⋅1,3⋅2,3⋅4,3⋅8↑)).(1)\begin{aligned} F_1,\ldots,F_{10}={}&\bigl(4,8^\uparrow,3\cdot1,3\cdot2, 3\cdot4,3\cdot8^\uparrow,9^\uparrow(1,2),\\ &9^\uparrow(4,8^\uparrow),5^\uparrow(1,2,4,8^\uparrow),\\ &5^\uparrow(3\cdot1,3\cdot2,3\cdot4, 3\cdot8^\uparrow)\bigr). \tag{1} \end{aligned}

Put

(B1,…,B12)=(1,2,F1,F2,…,F10).(2)(B_1,\ldots,B_{12})=(1,2,F_1,F_2,\ldots,F_{10}). \tag{2}

Use the first and last blocks of six, in that order, to define

F11=7↑(B1,…,B6),F12=7↑(B7,…,B12).(3)F_{11}=7^\uparrow(B_1,\ldots,B_6),\qquad F_{12}=7^\uparrow(B_7,\ldots,B_{12}). \tag{3}

Thus F1,…,F12F_1,\ldots,F_{12}, rather than the temporary atomic inputs 1,21,2, are the first twelve inputs of the outer 1919-arrow.

The prime-1111 stage already partially covers this branch. Define

F13=11↑(x,x,1,2,3⋅1,5↑(x,x,1,x),5↑(x,2,3⋅1,3⋅2),3⋅2,7↑(x,x,1,2,x,x),9↑(1,2)).(4)\begin{aligned} F_{13}=11^\uparrow\bigl(&x,x,1,2,3\cdot1, 5^\uparrow(x,x,1,x),\\ &5^\uparrow(x,2,3\cdot1,3\cdot2),3\cdot2, 7^\uparrow(x,x,1,2,x,x),9^\uparrow(1,2)\bigr). \tag{4} \end{aligned}

Let F14F_{14} be the same package after replacing every atomic 11 by 44 and every atomic 22 by 8↑8^\uparrow. These two substitutions fill the two complementary remaining prime-1111 profiles.

The source allows the earlier packages to be selected in any compatible order. Fix the reproducible choices

F15=13↑(1,2,F1,…,F8,F11,F12),F16=17↑(1,2,F1,…,F14).(5)\begin{aligned} F_{15}&=13^\uparrow(1,2,F_1,\ldots,F_8,F_{11},F_{12}),\\ F_{16}&=17^\uparrow(1,2,F_1,\ldots,F_{14}). \tag{5} \end{aligned}

The first list has twelve entries and excludes F9,F10F_9,F_{10}, which begin with 5↑5^\uparrow, and F13,F14F_{13},F_{14}, which begin with 11↑11^\uparrow, exactly as the source requires. The second list has sixteen entries. Neither list contains its new outer prime, and each is drawn without repetition from a signature-disjoint ordered pool.

The seventeenth input

It is the union of four packages. Put

G1=5↑(_,9↑(1,2),9↑(4,8↑),_),(6)G_1=5^\uparrow(\_,9^\uparrow(1,2), 9^\uparrow(4,8^\uparrow),\_), \tag{6} G2=7↑(_,_,_,5↑(9↑(1,2),x,x,9↑(4,8↑)),_,_),(7)G_2=7^\uparrow(\_,\_,\_, 5^\uparrow(9^\uparrow(1,2),x,x,9^\uparrow(4,8^\uparrow)), \_,\_), \tag{7}

and

G3=11↑(x,x,5↑(9↑(1,2),x,x,9↑(4,8↑)),7↑(3⋅1,3⋅2,3⋅4,x,3⋅8↑,9↑(1,2)),7↑(9↑(4,8↑),5↑(1,x,x,2),5↑(4,x,x,8↑),x,5↑(3⋅1,x,x,3⋅2),5↑(3⋅4,x,x,3⋅8↑)),x,_,_,7↑(x,x,5↑(9↑(1,2),x,x,9↑(4,8↑)),x,x,x),_).(8)\begin{aligned} G_3=11^\uparrow\bigl(&x,x, 5^\uparrow(9^\uparrow(1,2),x,x,9^\uparrow(4,8^\uparrow)),\\ &7^\uparrow(3\cdot1,3\cdot2,3\cdot4,x, 3\cdot8^\uparrow,9^\uparrow(1,2)),\\ &7^\uparrow(9^\uparrow(4,8^\uparrow), 5^\uparrow(1,x,x,2),5^\uparrow(4,x,x,8^\uparrow),x,\\ &\hspace{24mm}5^\uparrow(3\cdot1,x,x,3\cdot2), 5^\uparrow(3\cdot4,x,x,3\cdot8^\uparrow)),\\ &x,\_,\_, 7^\uparrow(x,x, 5^\uparrow(9^\uparrow(1,2),x,x,9^\uparrow(4,8^\uparrow)), x,x,x),\_\bigr). \tag{8} \end{aligned}

The source abbreviates several 11↑11^\uparrow packages below to three displayed entries. Precisely, write

J(u,v,w)=11↑(x,x,x,x,x,x,5↑(x,x,x,u),v,x,w).(9)J(u,v,w)=11^\uparrow \bigl(x,x,x,x,x,x,5^\uparrow(x,x,x,u),v,x,w\bigr). \tag{9}

The earlier prime-1111 package together with G1,G2,G3G_1,G_2,G_3 covers prime-1111 inputs 1,…,6,91,\ldots,6,9. In input 77, the first three regular inputs of the displayed 5↑5^\uparrow are covered, so uu occupies its fourth input; v,wv,w occupy prime-1111 inputs 8,108,10. Every compressed expression 11↑(5↑ ⁣⋅u,v,w)11^\uparrow(5^\uparrow\!\cdot u,v,w) below means this full J(u,v,w)J(u,v,w). With that exact expansion, the fourth package is

G4=13↑(5↑(1,x,x,2),5↑(4,x,x,8↑),5↑(3⋅1,x,x,3⋅2),5↑(3⋅4,x,x,3⋅8↑),5↑(9↑(1,2),x,x,9↑(4,8↑)),J(1,1,2),J(2,4,8↑),J(4,3⋅1,3⋅2),J(8↑,3⋅4,3⋅8↑),J(3⋅1,9↑(1,2),9↑(4,8↑)),J(3⋅2,5↑(3⋅4,x,x,3⋅8↑),7↑(1,2,4,x,8↑,3⋅1)),J(9↑(1,2),7↑(3⋅2,3⋅4,3⋅8↑,x,9↑(1,2),9↑(4,8↑)),7↑(5↑(1,x,x,2),5↑(4,x,x,8↑),5↑(3⋅1,x,x,3⋅2),x,5↑(3⋅4,x,x,3⋅8↑),5↑(9↑(1,2),x,x,9↑(4,8↑))))).(10)\begin{aligned} G_4=13^\uparrow\bigl(& 5^\uparrow(1,x,x,2), 5^\uparrow(4,x,x,8^\uparrow),\\ &5^\uparrow(3\cdot1,x,x,3\cdot2), 5^\uparrow(3\cdot4,x,x,3\cdot8^\uparrow),\\ &5^\uparrow(9^\uparrow(1,2),x,x,9^\uparrow(4,8^\uparrow)),\\ &J(1,1,2), J(2,4,8^\uparrow),\\ &J(4,3\cdot1,3\cdot2),\\ &J(8^\uparrow,3\cdot4,3\cdot8^\uparrow),\\ &J(3\cdot1,9^\uparrow(1,2),9^\uparrow(4,8^\uparrow)),\\ &J(3\cdot2, 5^\uparrow(3\cdot4,x,x,3\cdot8^\uparrow), 7^\uparrow(1,2,4,x,8^\uparrow,3\cdot1)),\\ &J(9^\uparrow(1,2),\\ &\qquad7^\uparrow(3\cdot2,3\cdot4,3\cdot8^\uparrow,x, 9^\uparrow(1,2),9^\uparrow(4,8^\uparrow)),\\ &\qquad7^\uparrow(5^\uparrow(1,x,x,2), 5^\uparrow(4,x,x,8^\uparrow), 5^\uparrow(3\cdot1,x,x,3\cdot2),x,\\ &\hspace{39mm}5^\uparrow(3\cdot4,x,x,3\cdot8^\uparrow), 5^\uparrow(9^\uparrow(1,2),x,x,9^\uparrow(4,8^\uparrow)))\bigr)\bigr). \tag{10} \end{aligned}

Set

F17=G1+G2+G3+G4.(11)F_{17}=G_1+G_2+G_3+G_4. \tag{11}

The unfilled input, its shifted tail, and proof

The construction leaves the eighteenth regular input of the outer 19↑19^\uparrow empty at its first level. This is the hole completed at prime 4747. Its copies at all higher prime-1919 levels are covered by the contextually selected input tail

(192)↑ ⁣⋅1.(12)(19^2)^\uparrow\!\cdot1. \tag{12}

For (1), every package is complete on the target branch by the initial prime-33 and prime-55 coverage. The two six-package blocks therefore fill the two 77 arrows. In (4), the black and gray children supplied by the earlier 1111 template are exactly the xx positions; the remaining displayed inputs fill every white child. The substitution defining F14F_{14} switches to the other unused 22-profiles. The source's exclusions in F15F_{15} prevent reuse of a 55- or 1111-signature.

For (6)–(11), G1G_1 supplies the sixth child of the partially filled 11↑11^\uparrow, and G2G_2 supplies the fourth child of the needed 7↑7^\uparrow. Together with prior coverage, G3G_3 leaves exactly prime-1111 positions 7,8,107,8,10 unresolved. Each full J(u,v,w)J(u,v,w) in G4G_4 fills those three positions with the stated fourth prime-55 input and the two complete packages v,wv,w. The twelve resulting JJ-based and direct packages fill the children of the outer 13↑13^\uparrow. Reading the displayed inputs in order leaves no blank except an explicitly precovered xx. Hence F17F_{17} is complete. Formula (12) covers the eighteenth input's copies at levels k≥2k\ge2; it does not fill that input at level k=1k=1, and it is not the outer arrow's marked spine.

The exact exponent-region calculation on the signature-certificate page proves that the seventeen inner signature sets are disjoint. It also checks the selected-input tail against their full unbounded 1919-exponent ranges. None contains 1919 before being placed in the outer arrow. Thus

19↑(F1,…,F17,_)+(192)↑ ⁣⋅1(13)19^\uparrow(F_1,\ldots,F_{17},\_) +(19^2)^\uparrow\!\cdot1 \tag{13}

is a regular-pattern-injective partial package for the modulus-1212 hole. It retains all repeated copies of F1,…,F17F_1,\ldots,F_{17} and the outer marked spine. After (12), exactly the first-level eighteenth child remains unresolved among the regular input targets. Prime 4747 fills that class and thereby completes the hole; the outer marked spine is later terminated by the general finite-arrow lemma.

Used by. The prime-23 template, later Nielsen stages, and Owens's construction.

Bears on. Problem 2.