Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/27943
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bašić Bojan | - |
dc.date.accessioned | 2020-12-13T22:38:01Z | - |
dc.date.available | 2020-12-13T22:38:01Z | - |
dc.date.issued | 2012 | - |
dc.identifier.issn | 1793-0421 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/27943 | - |
dc.description.abstract | 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$. | en |
dc.language.iso | en | - |
dc.relation.ispartof | International Journal of Number Theory | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.subject | Palindrome; number base | en |
dc.title | On $d$-digit palindromes in different bases: The number of bases is unbounded | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=81609&source=BEOPEN&language=en | en |
dc.relation.lastpage | 1390 | - |
dc.relation.firstpage | 1387 | - |
dc.relation.issue | 6 | - |
dc.relation.volume | 8 | - |
dc.identifier.externalcrisreference | (BISIS)81609 | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-1607-7139 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.