$v$-Palindromes: An Analogy to the Palindromes
Chris Bispels, Muhammet Boran, Steven J. Miller, Eliel Sosis, Daniel, Tsai

TL;DR
This paper introduces the concept of v-palindromes, explores their existence across infinitely many bases, and provides infinite families of such numbers in specific bases, along with conjectures and open problems.
Contribution
It defines v-palindromes in base b, proves their infinite existence, and constructs infinite families in bases p+1 and p^2+1 for odd primes p.
Findings
Existence of v-palindromes in infinitely many bases
Construction of infinite families in bases p+1 and p^2+1
Collection of conjectures and open problems
Abstract
Around the year 2007, one of the authors, Tsai, accidentally discovered a property of the number he saw on the license plate of a car. Namely, if we take and its reversal , which have prime factorizations and respectively, and sum the numbers appearing in each factorization getting and , both sums are . Such numbers were later named -palindromes because they can be viewed as an analogy to the usual palindromes. In this article, we introduce the concept of a -palindrome in base and prove their existence for infinitely many bases. We also exhibit infinite families of -palindromes in bases and , for each odd prime . Finally, we collect some conjectures and problems involving -palindromes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algorithms and Data Compression · Advanced Mathematical Identities
