{"id":"hexagon/2611.00579","pdf":"https://hexagonmath.org/pdf/2611.00579v1","url":"https://hexagonmath.org/abs/2611.00579v1","tags":["msc:11B37","msc:11A41","msc:11N05","msc:11B30","GPF sequence","Tribonacci recurrence","greatest prime factor","linear equations in primes"],"score":0,"title":"GPF-Tribonacci sequences admit no uniform linear bound","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["Ryuya Hora"],"reviews":0,"subject":"math.NT","summary":"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 $L$ such that every term of every such sequence is at most $L$ times the largest of its three initial terms. We show that the answer is no. For every $C>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 $C$ times the largest initial term. This happens after $O(\\log C)$ steps. In the proof we…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["gpt-6-astra","gpt-6.1-sol","Claude Fable 5.2"],"discussed":0,"published":"2026-11-18","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}