On binary palindromes of the form \(10^n\pm 1\)
type: Item
instance of: scholarly article
title: On binary palindromes of the form \(10^n\pm 1\)
zbMATH Open document ID: 1165.11011
author: Florian Luca
author: Alain Togbé
published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris
publication date: 2008-05-22T00:00:00Z
Mathematics Subject Classification ID: 11A63
Mathematics Subject Classification ID: 11J86
zbMATH DE Number: 5277916
zbMATH Keywords: binary palindrome
zbMATH Keywords: lower bounds for linear forms in logarithms of rational numbers
MaRDI profile type: Publication
full work available at URL: j.crma.2008.03.015
OpenAlex ID: W1577451328
cites work: Q3481765
cites work: Almost all palindromes are composite.
cites work: Prime divisors of palindromes
cites work: Q3481763
cites work: Linear forms in two logarithms and interpolation determinants
cites work: Palindromes in Lucas sequences
DOI: 10.1016/J.CRMA.2008.03.015
Recommended article: On the palindromic decomposition of binary words
Recommended article: Q5404348
Recommended article: On generating binary words palindromically
Recommended article: On longest palindromic subwords of finite binary words
Recommended article: Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
Recommended article: ON "VERY PALINDROMIC" SEQUENCES
Recommended article: On \(d\)-digit palindromes in different bases: the number of bases is unbounded
Recommended article: Q4647906
Recommended article: CALCULATION OF THE NUMBER OF PALINDROMS IN A BINARY SYSTEM
description: scientific article; zbMATH DE number 5277916