Wiki
Wiki

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

Updated


Source. Bajpai--Bennett--Chan, accepted author manuscript (June 26, 2023), Theorem 1.2 and Sections 5.1--5.3, pp. 3 and 11--19.

Statement. For each

(m,k)∈{(3,2),(3,3),(4,2)},(m,k)\in\{(3,2),(3,3),(4,2)\},

there are infinitely many positive integers N,dN,d for which the mm-term progression N,N+d,…,N+(m−1)dN,N+d,\ldots,N+(m-1)d consists of kk-full integers with gcd⁡(N,d)=1\gcd(N,d)=1. In the four-term squarefull case the construction makes the terms pairwise coprime, so this case resolves Problem 937 unconditionally.

Dependency for (4,2)(4,2). Proposition 5.2.

Proof. For (m,k)=(3,2)(m,k)=(3,2), the identities

X2+Y2=2Z2X^2+Y^2=2Z^2 X=a2−b2−2ab,Y=a2−b2+2ab,Z=a2+b2,X=a^2-b^2-2ab,\quad Y=a^2-b^2+2ab,\quad Z=a^2+b^2,

give a family of solutions whenever gcd⁡(a,b)=1\gcd(a,b)=1 and a,ba,b have opposite parity. Taking b=1b=1 and any sufficiently large even aa gives infinitely many positive triples with X<YX<Y. They are pairwise coprime: a common odd prime of any two of X,Y,ZX,Y,Z would, from the displayed formulas, divide both aa and bb, while 22 is excluded because all three values are odd. Then

N=X2,d=Z2−X2N=X^2,\qquad d=Z^2-X^2

gives the progression X2,Z2,Y2X^2,Z^2,Y^2.

For (m,k)=(3,3)(m,k)=(3,3), start from

(X0,Y0,Z0)=(37,17,7),X03+Y03=2⋅34Z03,(X_0,Y_0,Z_0)=(37,17,7),\qquad X_0^3+Y_0^3=2\cdot3^4Z_0^3,

and iterate

Xi+1=Xi(Xi3+2Yi3),Yi+1=−Yi(2Xi3+Yi3),Zi+1=Zi(Xi−Yi)(Xi2+XiYi+Yi2).(1)\begin{aligned} X_{i+1}&=X_i(X_i^3+2Y_i^3),\\ Y_{i+1}&=-Y_i(2X_i^3+Y_i^3),\\ Z_{i+1}&=Z_i(X_i-Y_i)(X_i^2+X_iY_i+Y_i^2). \end{aligned} \tag{1}

Direct expansion shows that every triple still satisfies Xi3+Yi3=2⋅34Zi3X_i^3+Y_i^3=2\cdot3^4Z_i^3, while

∣Zi+1∣=∣Xi−Yi∣(Xi2+XiYi+Yi2)∣Zi∣>∣Zi∣,|Z_{i+1}|=|X_i-Y_i|(X_i^2+X_iY_i+Y_i^2)|Z_i|>|Z_i|,

so the triples are distinct. Coprimality is preserved: if a prime divided both new XX and new YY, it cannot divide either old XX or old YY; it must therefore divide both X3+2Y3X^3+2Y^3 and 2X3+Y32X^3+Y^3. Their linear combinations force the prime to be 33, but X≡−Y(mod3)X\equiv-Y\pmod3 and 3∤XY3\nmid XY make those factors nonzero modulo 33. The defining equation then also makes ZZ coprime to XX and YY.

There are infinitely many all-positive triples in this orbit. Swapping X,YX,Y and changing all three signs preserve the equation, coprimality, and the recurrence orbit up to the same symmetries. Thus the only unresolved sign pattern may be arranged as X>0X>0, Y<0Y<0, Z>0Z>0, and X>∣Y∣X>|Y|. Put

R=X∣Y∣>1.R=\frac{X}{|Y|}>1.

If R>21/3R>2^{1/3}, the formulas in (1) make the next X,YX,Y have the same sign. Otherwise 1<R<21/31<R<2^{1/3}; after one recurrence step and the permitted swap and sign normalization, the new ratio is

R′=2R3−1R(2−R3).R'=\frac{2R^3-1}{R(2-R^3)}.

It satisfies

R′−1=(R−1)(R+1)3R(2−R3)>8(R−1),(2)R'-1 =(R-1)\frac{(R+1)^3}{R(2-R^3)} >8(R-1), \tag{2}

because (R+1)3>8(R+1)^3>8 and R(2−R3)<1R(2-R^3)<1 on this interval. If the signs never agree, iterating (2) eventually forces R≥21/3R\geq2^{1/3}, a contradiction. Thus every starting index is followed by a later same-sign pair. Applying this argument after each such index, while ∣Zi∣|Z_i| strictly increases, supplies infinitely many positive triples.

For any positive triple, order X3,Y3X^3,Y^3 so that the smaller is first. The identity says that 34Z33^4Z^3 is their average, so these three positive cubefull integers form a progression. They are pairwise coprime: neither XX nor YY is divisible by 33, and any prime common to ZZ and one of them would divide the other through the defining equation.

Finally, Proposition 5.2 proves the (4,2)(4,2) case and verifies the stronger pairwise-coprime conclusion.

Method. The two three-term cases come from elementary conic and cubic recurrences. The four-term case is the elliptic-curve construction carrying the substantive content for Problem 937.

Bears on. #937.