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: a three-cofactor alternative from 49−48


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

P699 research · Unequal Padé blocks

Fix D≥1D\ge1. Suppose 0≤r2,r3,r7≤D0\le r_2,r_3,r_7\le D satisfy

r2+r3=2r7,r2≠r3,r_2+r_3=2r_7,\qquad r_2\ne r_3,

and write n−rp=papupn-r_p=p^{a_p}u_p for p=2,3,7p=2,3,7. There is an effectively computable H(D)H(D) such that, for h=n−D>H(D)h=n-D>H(D),

u2>h.36oru3>h.19oru7>h.15.(1)\boxed{u_2>h^{.36}\quad\text{or}\quad u_3>h^{.19}\quad\text{or}\quad u_7>h^{.15}.} \tag{1}

The starting height has not been numerically evaluated. This is a conditional cofactor estimate, not a whole-index assertion.

Unequal blocks at the AP identity

The two products

X=(n−r7)2,Y=(n−r2)(n−r3)X=(n-r_7)^2,\qquad Y=(n-r_2)(n-r_3)

satisfy 0<X−Y=(r2−r7)2≤D20<X-Y=(r_2-r_7)^2\le D^2. Use the seed

P=49=72,Q=48=24⋅3,P−Q=1,P=49=7^2,\quad Q=48=2^4\cdot3,\quad P-Q=1,

with Padé directions (A,B,C)=(49,12,20)(A,B,C)=(49,12,20). Its two block lengths are A+B=61A+B=61 and B+C=32B+C=32. The finite coefficient-gcd sum through t=200t=200 is greater than 5.54965.5496. Thus the strictly smaller logarithmic gcd rate ℓ=5\ell=5 has an effective starting index.

The directed growth calculation gives

C0>9.9872414455,K0>285.7745674357.C_0>9.9872414455,\qquad K_0>285.7745674357.

Set τ=29/4000\tau=29/4000. For the cofactor box complementary to (1), the denominator loss is

Δ=(122τlog⁡7−2(1−.15))++(128τlog⁡2−(1−.36))++(32τlog⁡3−(1−.19))+.\Delta=\bigl(122\tau\log7-2(1-.15)\bigr)_+ +\bigl(128\tau\log2-(1-.36)\bigr)_+ +\bigl(32\tau\log3-(1-.19)\bigr)_+.

The retained interval calculation certifies

τC0−Δ>.04800,τK0−Δ−2>.04746.\tau C_0-\Delta>.04800,\qquad \tau K_0-\Delta-2>.04746.

Choose the Padé index proportional to τlog⁡h\tau\log h. The nonzero integer from the unequal-block lemma is then bounded by two terms tending effectively to zero, with the displayed positive powers. This is a contradiction for effectively large hh, proving (1).

The integer and interval checker and certificate record the exact finite gcd sum, strict gcd margin, rational block parameter, and directed bounds. No binomial rows are enumerated.

At the labeled positions (r2,r3,r5,r7)=(2,0,3,1)(r_2,r_3,r_5,r_7)=(2,0,3,1), the required AP is present. In particular (1) excludes the cofactor box containing (.355407,.174272,.463949,.141301)(.355407,.174272,.463949,.141301) in prime order 2,3,5,72,3,5,7; the cofactor u5u_5 is unrestricted by this source.