On prime factors of terms of binary recurrence sequences

DOI10.4064/AA220601-7-3arXiv2206.01275OpenAlexW4362513361MaRDI QIDQ6091847

C. L. Stewart

Publication date: 21 November 2023

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: We give estimates from below for the greatest prime factor of the n-th term of a binary recurrence sequence.

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

zbMATH Keywords

linear forms in logarithmsbinary recurrence sequences

Mathematics Subject Classification ID

Recurrences (11B37) Linear forms in logarithms; Baker's method (11J86)

Related Items (3)

Title not available (Why is that?) ⋮ Uniform explicit Stewart theorem on prime factors of linear recurrences ⋮ Title not available (Why is that?)

This page was built for publication: On prime factors of terms of binary recurrence sequences

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