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 and put
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 for at least one of the listed primes. All terminating decimals denote exact rationals.
| Position identity | Prime order | Exponents | Seed difference |
|---|---|---|---|
Every row is valid for
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
If , the products
have a nonzero constant difference of magnitude at most . The quadratic-product Padé estimate gives the stated four-way alternative. It excludes the previous profile
at positions . 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.