GPF-Tribonacci sequences admit no uniform linear bound

Primarily AI-generated textHuman understanding: some partsmath.NT — Number Theory

Contributed by Ryuya Hora ↗

Version 1 / Nov 18, 2026 / CC BY 4.0

Abstract

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.

Provenance statement

The construction and the proof were produced by AI systems on 14 November 2026, during the mathematics workshop at Zushi Fes of ZEN University, where the question of Back and Caragiu was one of the problems. OpenAI models (identifiers gpt-6-astra and gpt-6.1-sol), run in OpenAI Codex, found the quotient pattern 1,3,5 and wrote a first proof in Japanese. On the same day, a report written by Claude Fable 5.2 (Anthropic) reached the same conclusion with the quotients in the order 3,5,1. The English text was written on 17 November 2026 by Claude Fable 5.2, run in Claude Code, on the basis of the Japanese proof; the same system found Example 1.5 by a computer search, wrote the two remarks in Section 4 and the subsection on related work, and checked the bibliographic data. Human understanding: Ryuya Hora has read the proof carefully. Other participants of the workshop also contributed; they are not responsible for the content.

Tools used

OpenAI
gpt-6-astra
OpenAI
gpt-6.1-sol
Anthropic
Claude Fable 5.2

References

  1. Jeremy F. Alm and Taylor Herald, A note on prime F ibonacci sequences , Fibonacci Quart. 54 (2016), no. 1, 55--58.
  2. Jeremy F. Alm, Taylor Herald, Ellen Rammelkamp Miller, and Dave Sexton, 2-free T etranacci sequences , 2017, Preprint, arXiv:1710.00930.arXiv
  3. Greg Back and Mihai Caragiu, The greatest prime factor and recurrent sequences , Fibonacci Quart. 48 (2010), no. 4, 358--362.
  4. Mihai Caragiu, Recurrences based on the greatest prime factor function , JP J. Algebra Number Theory Appl. 19 (2010), no. 2, 155--163.
  5. — , Sequential experiments with primes , Springer, Cham, 2017.
  6. Mihai Caragiu and Greg Back, The greatest prime factor and related magmas , JP J. Algebra Number Theory Appl. 15 (2009), no. 2, 127--136.
  7. Mihai Caragiu and Lisa Scheckelhoff, The greatest prime factor and related sequences , JP J. Algebra Number Theory Appl. 6 (2006), no. 2, 403--409.
  8. Mihai Caragiu, Lauren Sutherland, and Mohammad Zaki, Multidimensional greatest prime factor sequences , JP J. Algebra Number Theory Appl. 23 (2011), no. 2, 187--195.
  9. Mihai Caragiu and Paul A. Vicol, Prime magmas and a cyclicity conjecture , JP J. Algebra Number Theory Appl. 38 (2016), no. 2, 129--143.
  10. Mihai Caragiu, Alexandru Zaharescu, and Mohammad Zaki, On a class of solvable recurrences with primes , JP J. Algebra Number Theory Appl. 26 (2012), no. 2, 197--208.
Show all 17 referencesShow fewer references
  1. — , An analogue of the P roth-- G ilbreath conjecture , Far East J. Math. Sci. (FJMS) 81 (2013), no. 1, 1--12.
  2. — , On D ucci sequences with primes , Fibonacci Quart. 52 (2014), no. 1, 32--38.
  3. Ben Green and Terence Tao, Linear equations in primes , Ann. of Math. (2) 171 (2010), no. 3, 1753--1850.
  4. — , The M öbius function is strongly orthogonal to nilsequences , Ann. of Math. (2) 175 (2012), no. 2, 541--566.
  5. Ben Green, Terence Tao, and Tamar Ziegler, An inverse theorem for the G owers Us+1[N]U^{s+1}[N] -norm , Ann. of Math. (2) 176 (2012), no. 2, 1231--1372, see also the erratum of April 2024 announced on the arXiv page of arXiv:1009.3998.arXiv
  6. Richard K. Guy, Tanya Khovanova, and Julian Salazar, Conway's subprime F ibonacci sequences , Math. Mag. 87 (2014), no. 5, 323--337.
  7. OEIS Foundation Inc. , The O n- L ine E ncyclopedia of I nteger S equences , 2026, Published electronically at https://oeis.org.link

Version history

  1. v1 · 9 pagesSubmitted by Ryuya HoraInitial depositCurrentNov 18, 2026