Search arXivSearch

arXiv · 2608.22564

There and back again with Kaprekar 2-cycles

Abstract

A curious property of integers, first observed by D.~R. Kaprekar in 1949, is as follows: write the digits of a 4-digit number in both descending and ascending order, and then find the positive difference between these integers. Iterating this process on any 4-digit number - except for multiples of 1111 - eventually produces the number 6174. The process ends here, since 6174 is a fixed point of the procedure. In general, if we start with any integer and iterate this process, it either ends at a fixed point (as with 4 digits) or enters a cycle of numbers, called a Kaprekar cycle. In 2011, Dolan classified all fixed points of this process. We study Kaprekar cycles of length 2. We find general properties of numbers in a Kaprekar 2-cycle, and we classify all 2-cycles such that the two integers have the same smallest digit.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rebekah Mayne, Quinn Shapiro, Cornelia A. Van Cott. 2026-08-23. There and back again with Kaprekar 2-cycles. https://arxiv.org/abs/2608.22564

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

KEEP EXPLORING

Related papers

On single-variable Witten zeta functions of rank two and three

By introducing a novel integration kernel for the Mellin transform, we uncover many previously unknown and intriguing properties of the Witten zeta functions of rank two and three. Detailed results concerning their pole locations, residues, and special values are obtained. We propose a non-trivial conjecture regarding their derivatives at the origin, which seems to encode deep information about the root system. We also discuss their behavior at negative integers, highlighting a connection with Eisenstein series and a $p$-adic observation.

math.NT

On graded Lie algebras associated to once-punctured elliptic curves with complex multiplication

We study a graded Lie algebra arising from the Galois action on the pro-$p$ fundamental group of a once-punctured elliptic curve with complex multiplication. Among other things, we provide a minimal generating set of the rationalized Lie algebra under suitable assumptions. The proof is based on a slight variant of the theory of weighted completion of profinite groups developed by Hain and Matsumoto.

math.NT

Burgess-type volume dependent bounds for character sums over $\mathbb{F}_{p^n}$

We establish a Burgess-type bound for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$. Let \[ B=\left\{\sum_{i=1}^{n}x_iω_i: N_i+1\le x_i\le N_i+H_i,1\le i\le n\right\}\subseteq\mathbb{F}_{p^n}, \] where $1\le H_i\le p$ for all $1\le i\le n$, and the side lengths satisfy $H_1\le H_2\le\cdots\le H_n.$ We prove that if the side lengths satisfy certain lower bounds in terms of the two largest side lengths, then a nontrivial cancellation occurs in the character sum over the boxes. This generalizes the work of Gabdullin \cite{GB} in dimensions $n=2,3$ to arbitrary dimension. This also generalizes the character sum estimate of Konyagin \cite{Kon} where each of the side lengths of the boxes are greater than $p^{1/4}$. The proof combines techniques from the geometry of numbers, multiplicative energy estimates, and Katz's bounds for multiplicative character sums.

math.NT