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: two additional prime-power seeds for index 12


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

The rational-block inequality can use coefficients other than one in a Padé seed. Two useful choices are

72−3⋅24=1,13⋅29−5⋅113=1.7^2-3\cdot2^4=1,\qquad13\cdot2^9-5\cdot11^3=1.

Theorem 2.4 of BFT permits arbitrary positive integer coefficients a,ba,b. They need not be powers of either prime. Their contribution is already included in the definitions of Ω3\Omega_3 and Ω4\Omega_4.

Fix a gap bound D≥1D\ge1, and write

∣pku−qlv∣≤D,x=min⁡(pku,qlv),|p^ku-q^lv|\le D,\qquad x=\min(p^ku,q^lv), ep=log⁡ulog⁡x,eq=log⁡vlog⁡x.e_p=\frac{\log u}{\log x},\qquad e_q=\frac{\log v}{\log x}.

For a seed P=pk0,Q=ql0P=p^{k_0},Q=q^{l_0} in either order, put

C=log⁡Ω3s,K=log⁡max⁡(P,Q)+log⁡Ω4s,J=K−C.C=\frac{\log\Omega_3}{s},\qquad K=\log\max(P,Q)+\frac{\log\Omega_4}{s},\qquad J=K-C.

Above an effective threshold, the rational-block inequality requires

(k0log⁡p−J(1−ep))++(l0log⁡q−J(1−eq))+>C−ϵ.(k_0\log p-J(1-e_p))_+ +(l_0\log q-J(1-e_q))_+>C-\epsilon.

The following three choices give strict contradictions throughout the indicated closed boxes. Here ℓ=log⁡L1\ell=\log L_1 is an exact rational number, and the displayed margin is CC minus the sum of the two positive parts at the upper corner of the box. Monotonicity then handles every smaller cofactor exponent.

Seedssℓ\ellUpper boundsCertified margin greater than
49−3⋅16=149-3\cdot16=161/3361/33577/1000577/1000e2≤.2773e_2\le.2773, e7≤.0295e_7\le.0295.24528449.24528449
49−3⋅16=149-3\cdot16=170/3770/37609/1000609/1000e2≤.2773e_2\le.2773, e7≤0e_7\le0.32021006.32021006
13⋅512−5⋅1331=113\cdot512-5\cdot1331=137/1637/16121/200121/200e2≤.14e_2\le.14, e11≤0e_{11}\le0.48191326.48191326

One may take ϵ=.24,.32,.48\epsilon=.24,.32,.48, respectively. The directed interval calculation verifies Ω3,Ω4>1\Omega_3,\Omega_4>1, J>0J>0, 1<s<1/z01<s<1/z_0, and ℓ<log⁡L(s)\ell<\log L(s) in each case. The strict final inequality supplies an effective coefficient-gcd starting point by BFT Theorem 2.2. Thus these are effective restrictions, even though their numerical height thresholds have not been evaluated here.

Ordinary cofactor alternatives

The same two seeds also give the simpler alternatives from the asymmetric matched-block argument. For each prime power pk0p^{k_0} in a seed, its limiting endpoint is

αp=1−k0log⁡pK.\alpha_p=1-\frac{k_0\log p}{K}.

A stronger ordinary alternative comes from the first seed with s=53/31s=53/31 and ℓ=255299/500000=.510598\ell=255299/500000=.510598. Its endpoints are

α2=.37560690082818396…,α7=.12355347987060026….\alpha_2=.37560690082818396\ldots,\qquad \alpha_7=.12355347987060026\ldots.

Thus, above an effective height threshold,

u2>x.375oru7>x.123.\boxed{u_2>x^{.375}\quad\text{or}\quad u_7>x^{.123}.}

The directed interval calculation gives log⁡Ω3>.0007025768\log\Omega_3>.0007025768 and log⁡L(53/31)>.5105995243>ℓ\log L(53/31)>.5105995243>\ell, so all required inequalities remain strict despite the small gap in Ω3>1\Omega_3>1.

For comparison, the first seed with s=61/33s=61/33 and ℓ=.577\ell=.577 gives

α2=.3485929600297605…,α7=.08563462003828685….\alpha_2=.3485929600297605\ldots,\qquad \alpha_7=.08563462003828685\ldots.

Consequently, above an effective height threshold,

u2>x.348oru7>x.085.\boxed{u_2>x^{.348}\quad\text{or}\quad u_7>x^{.085}.}

For the second seed, taking s=80/39s=80/39 and ℓ=347257/500000=.694514\ell=347257/500000=.694514 gives the stronger endpoints

α2=.24848491362569955…,α11=.13339498277126851….\alpha_2=.24848491362569955\ldots,\qquad \alpha_{11}=.13339498277126851\ldots.

Thus one also has the effective alternative

u2>x.248oru11>x.133.\boxed{u_2>x^{.248}\quad\text{or}\quad u_{11}>x^{.133}.}

The checker certifies log⁡Ω3>0\log\Omega_3>0 and ℓ<log⁡L(80/39)\ell<\log L(80/39); the strict rational-block margin at this box exceeds .00000922.00000922.

The earlier parameters s=37/16s=37/16 and ℓ=.605\ell=.605 give

α2=.1935369055356310…,α11=.07003202391529480….\alpha_2=.1935369055356310\ldots,\qquad \alpha_{11}=.07003202391529480\ldots.

It therefore gives the effective alternative

u2>x.193oru11>x.069.\boxed{u_2>x^{.193}\quad\text{or}\quad u_{11}>x^{.069}.}

Here upu_p denotes the positive integer cofactor of the relevant prime power in two positive integers whose difference is bounded by DD; xx is their minimum. The retained checker certifies all exact rational endpoint targets. These ordinary alternatives suffice wherever only an OR condition on individual cofactor exponents is needed.

These boxes arose from the remaining index-12 interpolation profiles, in prime order 2,3,5,7,112,3,5,7,11:

(.2773,.3454,.3941,.0295,0),(.2773,.3641,.3941,0,.0212),(.14,.3454,.2715,.3255,0).(.2773,.3454,.3941,.0295,0),\qquad (.2773,.3641,.3941,0,.0212),\qquad (.14,.3454,.2715,.3255,0).

The calculation in this note excludes those boxes. A proof for a whole index additionally needs complete coverage of all cofactor and position cases and the corresponding interpolation certificates.

The retained checker and interval output contain the exact seeds and parameters. They can be reproduced with

sh
.venv/bin/python wiki/research/erdos_699/computations/erdos_699_twelve_rational_pairs.py