Papers › Antipalindromic numbers
Antipalindromic numbers
Lubomira Dvorakova, Stanislav Kruml, David Ryzak
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For instance kayak, radar, or rotor. Mathematicians are interested in palindromic numbers: positive integers whose expansion in a certain integer base is a palindrome. The following problems are studied: palindromic primes, palindromic squares and higher powers, multibased palindromic numbers, etc. In this paper, we define and study antipalindromic numbers: positive integers whose expansion in a certain integer base is an antipalindrome. We present new results concerning divisibility and antipalindromic primes, antipalindromic squares and higher powers, and multibased antipalindromic numbers. We provide a user-friendly application for all studied questions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections