MathDB
a_n+a_{n-1} is a perfect square for all n

Source: 2024 5th OMpD L2 P4 - Brazil - Olimpíada Matemáticos por Diversão

October 16, 2024
algebraSequencePerfect Squares

Problem Statement

Let a0,a1,a2,a_0, a_1, a_2, \dots be an infinite sequence of positive integers with the following properties: - a0a_0 is a given positive integer; - For each integer n1n \geq 1, ana_n is the smallest integer greater than an1a_{n-1} such that an+an1a_n + a_{n-1} is a perfect square. For example, if a0=3a_0 = 3, then a1=6a_1 = 6, a2=10a_2 = 10, a3=15a_3 = 15, and so on.
(a) Let TT be the set of numbers of the form akala_k - a_l, with kl0k \geq l \geq 0 integers. Prove that, regardless of the value of a0a_0, the number of positive integers not in TT is finite.
(b) Calculate, as a function of a0a_0, the number of positive integers that are not in TT.