Power multiples in binary recurrence sequences: an approach by congruences
From MaRDI portal
Publication:5200215
zbMath1278.11015arXiv1009.5092MaRDI QIDQ5200215
Publication date: 1 August 2011
Full work available at URL: https://arxiv.org/abs/1009.5092
Computer solution of Diophantine equations (11Y50) Higher degree equations; Fermat's equation (11D41) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50) Calculation of integer sequences (11Y55)
This page was built for publication: Power multiples in binary recurrence sequences: an approach by congruences