For k ≥ 2, let (P(k)n)n≥2−k be the k-generalized Pell sequence which starts with 0, · · · , 0, 1 (k terms) and each term afterwards is given by the linear recurrence P(k)n = 2P(k)n-1 + P(k)n-2 + · · · + P(k)n-k, for all n ≥ 2.
An integer n is said to be close to a positive integer m if n satisfies |n−m| < √m. In this paper, we solve the Diophantine inequality |P(k)n - 2m| < 2m/2, in positive unknowns k, n, and m.
© 2008-2026 Fundación Dialnet · Todos los derechos reservados