GPF-Tribonacci sequences admit no uniform linear bound
Source: hexagonmath.org/abs/2611.00579v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00579
curl -X POST /api/v1/records/hexagon/2611.00579/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00579/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'