Wiki
Wiki

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

Updated

Erdős 699: additional product constraints at index fourteen


This is a retained earlier research note. The current reading guide gives the latest status and distinguishes completed proofs from remaining cases.

P699 research · Numerical product thresholds · Forced boundary divisors

The retained index-fourteen interpolation profiles can be strengthened by constant-gap identities involving the primes 11 and 13. This note records nine additional, fully numerical sources. They do not establish effectivity for the whole index: the alternatives still require complete geometric coverage, and some profiles remain compatible with these inequalities.

Choose the maximal small-prime positions rp∈{0,…,13}r_p\in\{0,\ldots,13\} and put

up=(n−rp)/pvp(n−rp),h=n−13.u_p=(n-r_p)/p^{v_p(n-r_p)},\qquad h=n-13.

A row in the following table applies when its two position sums are equal and its two unordered position pairs are different. The conclusion is the disjunction up>hepu_p>h^{e_p} for at least one of the listed primes. All terminating decimals denote exact rationals.

Position identityPrime orderExponents (ep)(e_p)Seed difference
r2+r5=r3+r13r_2+r_5=r_3+r_{13}2,3,5,132,3,5,13.3139,.6365,.4685,.1542.3139,.6365,.4685,.154240−39=140-39=1
r2+r11=r3+r13r_2+r_{11}=r_3+r_{13}2,3,11,132,3,11,13.3325,.3651,.5376,.5055.3325,.3651,.5376,.5055352−351=1352-351=1
r3+r13=r7+r11r_3+r_{13}=r_7+r_{11}3,7,11,133,7,11,13.6399,.3638,.2165,.1621.6399,.3638,.2165,.16212⋅39−77=12\cdot39-77=1
r2+r11=r5+r13r_2+r_{11}=r_5+r_{13}2,5,11,132,5,11,13.2989,.4569,.5949,.1356.2989,.4569,.5949,.13564225−6⋅704=14225-6\cdot704=1
r2+r13=r5+r7r_2+r_{13}=r_5+r_72,5,7,132,5,7,13.2982,.4564,.3431,.1348.2982,.4564,.3431,.13483⋅35−104=13\cdot35-104=1
r2+r13=r3+r5r_2+r_{13}=r_3+r_52,3,5,132,3,5,13.7611,.4349,.4481,.1216.7611,.4349,.4481,.1216676−675=1676-675=1
r2+r11=r7+r13r_2+r_{11}=r_7+r_{13}2,7,11,132,7,11,13.2998,.3447,.1929,.1369.2998,.3447,.1929,.136991−88=391-88=3
r3+r11=r5+r13r_3+r_{11}=r_5+r_{13}3,5,11,133,5,11,13.6172,.4402,.167,.1091.6172,.4402,.167,.10912⋅33−65=12\cdot33-65=1
r2+r11=r5+r7r_2+r_{11}=r_5+r_72,5,7,112,5,7,11.3841,.2853,.5671,.4671.3841,.2853,.5671,.4671176−175=1176-175=1

Every row is valid for

h≥103 297 191 195.h\ge10^{3\,297\,191\,195}.

The individual thresholds are smaller and are retained in the directed interval certificate. The checker reconstructs the seed components, certifies their coefficient-gcd estimates, and applies the general numerical product bound. Its only dependency beyond the Python standard library is the retained mpmath requirement.

For example, the third row uses

2(3⋅13)−7⋅11=1,s=16/11.2(3\cdot13)-7\cdot11=1,\qquad s=16/11.

If r3+r13=r7+r11r_3+r_{13}=r_7+r_{11}, the products

(n−r3)(n−r13),(n−r7)(n−r11)(n-r_3)(n-r_{13}),\qquad(n-r_7)(n-r_{11})

have a nonzero constant difference of magnitude at most 13213^2. The quadratic-product Padé estimate gives the stated four-way alternative. It excludes the previous profile

(e2,e3,e5,e7,e11,e13)=(.1399,.3453,.2711,.3218,0,.0729)(e_2,e_3,e_5,e_7,e_{11},e_{13}) =(.1399,.3453,.2711,.3218,0,.0729)

at positions (r2,r3,r5,r7,r11,r13)=(2,5,3,4,1,0)(r_2,r_3,r_5,r_7,r_{11},r_{13})=(2,5,3,4,1,0). This is an exclusion of that limiting cofactor profile. Each resulting larger-cofactor branch still needs its own polynomial inequality before a whole-index conclusion can be drawn.

A broader exploratory catalog found many more possible sources, but is not being promoted as a proof of index fourteen. In particular, simply counting old profile vectors that violate a new alternative is insufficient: new componentwise minimal vectors must be recomputed after adding the alternative. The finite position assignments are also prime-labeled; a sorted capacity comparison cannot transfer a position identity to another assignment of primes.