Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2410.21427

Cryptarithmically unique terms in integer sequences

Dmytro S. Inosov·Emil Vlasák
View original source ↗Read source document ↗Export metadata ↓

Abstract

A cryptarithm (or alphametic) is a mathematical puzzle in which numbers are represented with words in such a way that identical letters stand for equal digits and distinct letters for unequal digits. An alphametic puzzle is usually given in the form of an equation that needs to be solved, such as SEND + MORE = MONEY. Alternatively, here we will consider cryptarithms constrained not by an equation but by a particular subsequence of natural numbers, for example perfect squares or primes. Such a cryptarithm has a unique solution if there is exactly one term in the sequence that has the corresponding pattern of digits. We will call such terms cryptarithmically unique. Here we estimate the density of such terms in an arbitrary sequence for which the overall density of terms among integers is known. In particular, among all perfect squares below 10^12, slightly less than one half are cryptarithmically unique, their density increasing toward larger numbers. Cryptarithmically unique prime numbers, however, are initially very scarce. Combinatorial estimates suggest that their density should drop below 10^-300 for decimal lengths of approximately 1829 digits, but then it recovers and is asymptotic to unity for very large primes. Finally, we introduce and discuss primonumerophobic digit patterns that no prime number happens to have.

Explore related subjects

math.NTmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dmytro S. Inosov, Emil Vlasák. 2025-08-28. Cryptarithmically unique terms in integer sequences. https://arxiv.org/abs/2410.21427

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the factorisation of the $p$-adic Rankin-Selberg $L$-function in the supersingular case

Given a cusp form $f$ which is supersingular at a fixed prime $p$ away from the level, and a Coleman family $F$ through one of its $p$-stabilisations, we construct a $2$-variable meromorphic $p$-adic $L$-function for the symmetric square of $F$. We prove that this new $p$-adic $L$-function interpolates values of complex imprimitive symmetric square $L$-functions, for the various specialisations of the family $F$. We use this $p$-adic $L$-function to prove a $p$-adic factorisation formula, expressing the geometric $p$-adic $L$-function attached to the Rankin--Selberg convolution of $f$ with itself as a the product of the $p$-adic symmetric square $L$-function of $f$ and a Kubota-Leopoldt $L$-function. This extends a result of Dasgupta in the ordinary case.

math.NT↗
arXiv2026

Exceptional poles of archimedean Rankin-Selberg L-functions for irreducible generic representations of GL(n,R)

For irreducible generic representations $π_1$ and $π_2$ of $\operatorname{GL}_n(\mathbb R)$, we prove that the notions of exceptional pole of type $1$ and type $2$ coincide at every level. When both representations are in general position, we use this identification to express the Rankin--Selberg $L$-function $L(s,π_1\timesπ_2)$ in terms of the exceptional $L$-factors attached to the irreducible constituents of their derivatives.

math.NT↗