ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a natural number written in base 22, and let K2,2(n)K_{2,2}(n) be obtained by subtracting the second-smallest digit arrangement from the second-largest digit arrangement, retaining leading zeros. For m≥3m\geq 3, consider the iterates K2,2t(n)K_{2,2}^t(n).

Binary Kaprekar sequence conjecture. (i)(i) When the digit length is 2m2m, the sequence

{K2,2t(n):t=1,2,… }\{K_{2,2}^t(n):t=1,2,\dots\}

reaches the fixed point 22m−3×2m+12^{2m}-3\times 2^m+1. (ii)(ii) When the digit length is 2m+12m+1, the sequence enters a loop consisting of

{22m+1−7×2m+2m−2+1, 22m+1−7×2m+10×2m−2+1}.\{2^{2m+1}-7\times 2^m+2^{m-2}+1,\,2^{2m+1}-7\times 2^m+10\times 2^{m-2}+1\}.

This describes the eventual behavior of the specified binary variant of Kaprekar's routine for all digit lengths covered by the parameter range. The parser provides no evidence that the claim has been proved or disproved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.