Additive Diophantine equations with binary recurrences, \(\mathcal{S}\)-units and several factorials

DOI10.1007/s00025-023-01871-0OpenAlexW4362609727MaRDI QIDQ2701319

Florian Luca, Lajos Hajdu, István Pink, Attila Bérczes

Publication date: 28 April 2023

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00025-023-01871-0

zbMATH Keywords

greatest prime factorBaker's methodbinary recurrence sequence

Mathematics Subject Classification ID

Recurrences (11B37) Exponential Diophantine equations (11D61)

Cites Work

• Factoring polynomials with rational coefficients
• Sums of factorials in binary recurrence sequences
• Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
• Approximate formulas for some functions of prime numbers
• Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation
• p-adic logarithmic forms and group varieties II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Additive Diophantine equations with binary recurrences, \(\mathcal{S}\)-units and several factorials