Power multiples in binary recurrence sequences: an approach by congruences

MaRDI QIDQ5200215zbMATH OpenFDO

Authors Teresa Boggio, Andrea Mori

Publication date 1 August 2011

Full work available at URL https://arxiv.org/abs/1009.5092

zbMATH Keywords

congruencespowerscomputational number theoryhigher degree Diophantine equationpower multiples

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50) Higher degree equations; Fermat's equation (11D41) Computer solution of Diophantine equations (11Y50) Calculation of integer sequences (11Y55)

Abstract: We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.

Recommendations

• scientific article; zbMATH DE number 1305305
• Perfect powers in polynomial power sums
• scientific article; zbMATH DE number 1355191
• Pure powers in recurrence sequences and some related diophantine equations
• The multiplicity of binary recurrences

Cited in

(2)

• scientific article; zbMATH DE number 1305305 (Why is no real title available?)
• Shifted powers in binary recurrence sequences

This page was built for publication: Power multiples in binary recurrence sequences: an approach by congruences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200215)