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
there are infinitely many positive integers for which the -term progression consists of -full integers with . In the four-term squarefull case the construction makes the terms pairwise coprime, so this case resolves Problem 937 unconditionally.
Dependency for . Proposition 5.2.
Proof. For , the identities
give a family of solutions whenever and have opposite parity. Taking and any sufficiently large even gives infinitely many positive triples with . They are pairwise coprime: a common odd prime of any two of would, from the displayed formulas, divide both and , while is excluded because all three values are odd. Then
gives the progression .
For , start from
and iterate
Direct expansion shows that every triple still satisfies , while
so the triples are distinct. Coprimality is preserved: if a prime divided both new and new , it cannot divide either old or old ; it must therefore divide both and . Their linear combinations force the prime to be , but and make those factors nonzero modulo . The defining equation then also makes coprime to and .
There are infinitely many all-positive triples in this orbit. Swapping 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 , , , and . Put
If , the formulas in (1) make the next have the same sign. Otherwise ; after one recurrence step and the permitted swap and sign normalization, the new ratio is
It satisfies
because and on this interval. If the signs never agree, iterating (2) eventually forces , a contradiction. Thus every starting index is followed by a later same-sign pair. Applying this argument after each such index, while strictly increases, supplies infinitely many positive triples.
For any positive triple, order so that the smaller is first. The identity says that is their average, so these three positive cubefull integers form a progression. They are pairwise coprime: neither nor is divisible by , and any prime common to and one of them would divide the other through the defining equation.
Finally, Proposition 5.2 proves the 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.