On prime factors of terms of binary recurrence sequences

DOI10.4064/AA220601-7-3MaRDI QIDQ6091847zbMATH OpenOpenAlexFDO

Authors C. L. Stewart

Publication date 21 November 2023

Published in Acta Arithmetica (Search for Journal in Brave)

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

zbMATH Keywords

binary recurrence sequenceslinear forms in logarithms

Mathematics Subject Classification ID

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

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

Recommendations

• On prime factors of terms of linear recurrence sequences
• scientific article; zbMATH DE number 4202357
• On the greatest prime factor of terms of a linear recurrence sequence
• On binary recurrence sequences
• Divisibility properties of binary recurrent sequences

Cited in

(5)

• scientific article; zbMATH DE number 1759165 (Why is no real title available?)
• Uniform explicit Stewart theorem on prime factors of linear recurrences
• scientific article; zbMATH DE number 5679656 (Why is no real title available?)
• Terms of Lucas sequences having a large smooth divisor
• Integers represented by binary recursive sequences

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)