On binary palindromes of the form \(10^n\pm 1\)

DOI10.1016/J.CRMA.2008.03.015zbMath1165.11011OpenAlexW1577451328MaRDI QIDQ927097

Florian Luca, Alain S. Togbé

Publication date: 22 May 2008

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2008.03.015

zbMATH Keywords

binary palindromelower bounds for linear forms in logarithms of rational numbers

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Linear forms in logarithms; Baker's method (11J86)

Related Items (4)

Exponential Diophantine Equations ⋮ Every positive integer is a sum of three palindromes ⋮ Palindromes in linear recurrence sequences ⋮ Additive number theory via automata theory

Cites Work

• Palindromes in Lucas sequences
• Almost all palindromes are composite.
• Linear forms in two logarithms and interpolation determinants
• Prime divisors of palindromes
• Unnamed Item
• Unnamed Item

This page was built for publication: On binary palindromes of the form \(10^n\pm 1\)