v-palindromes: an analogy to the palindromes
Daniel Tsai

TL;DR
This paper introduces the concept of v-palindromes, numbers related to their reversals through prime factorizations, proves their infinite existence across bases, and discusses related conjectures.
Contribution
It formally defines v-palindromes in various bases, proves their infinite occurrence, and explores conjectures, expanding the understanding of number properties related to reversals and factorizations.
Findings
v-palindromes exist in infinitely many bases
Prime factorization sums of numbers and their reversals are equal for v-palindromes
The paper proposes several conjectures on v-palindromes
Abstract
In the year 2007, the author discovered an intriguing property of the number he saw on the license plate of a car. Namely, if we take and its reversal , prime factorize each number, and sum the numbers appearing in each factorization, both sums are . Such numbers are formally introduced in a short published note in 2018. These numbers are 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. Finally, we collect some conjectures on -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
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Advanced Mathematical Theories and Applications
