Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/27943
Nаziv: | On $d$-digit palindromes in different bases: The number of bases is unbounded | Аutоri: | Bašić Bojan | Ključnе rеči: | Palindrome; number base | Dаtum izdаvаnjа: | 2012 | Čаsоpis: | International Journal of Number Theory | Sažetak: | The following problem was posed in [E. H. Goins, Palindromes in Different Bases: A Conjecture of J. Ernest Wilkins, \emph{Integers} \textbf{9} (2009), 725--734]: ``What is the largest list of bases $b$ for which an integer $N\geqslant 10$ is a $d$-digit palindrome base $b$ for every base in the list?" We show that it is possible to construct such a list as large as we please. Furthermore, we show that it is possible to construct such arbitrarily large list for \emph{any} given $d$. | URI: | https://open.uns.ac.rs/handle/123456789/27943 | ISSN: | 1793-0421 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
Prеglеd/i stаnicа
32
Prоtеklа nеdеljа
7
7
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.