Submitted works

Advanced search

math.NT — Number Theory

GPF-Tribonacci sequences admit no uniform linear bound

Contributed by Ryuya Hora

A GPF-Tribonacci sequence is a sequence of primes in which every term is the greatest prime factor of the sum of the three preceding terms. Back and Caragiu asked whether there is a constant LL such that every term of every such sequence is at most LL times the largest of its three initial terms. We show that the answer is no. For every C>0C>0 we show that there are GPF-Tribonacci sequences, starting from three distinct and arbitrarily large primes, in which three consecutive terms are all larger than CC times the largest initial term. This happens after O(log⁡C)O(\log C) steps. In the proof we prescribe the quotient of the sum of three consecutive terms by the next term. These quotients follow the periodic pattern 1,3,51,3,5. Then we apply the theorem of Green, Tao and Ziegler on linear equations in primes. The conjecture of Back and Caragiu that every GPF-Tribonacci sequence is ultimately periodic remains open.

Primarily AI-generated textHuman understanding: some partsGPF sequenceTribonacci recurrencegreatest prime factorlinear equations in primes
Nov 18, 20269 pages
PDFView work