Power multiples in binary recurrence sequences: an approach by congruences

zbMATH Open1278.11015arXiv1009.5092MaRDI QIDQ5200215FDOQ5200215

Teresa Boggio, Andrea Mori

Publication date: 1 August 2011

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.

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)

Cited In (2)

• Title not available (Why is that?)
• 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)