Conjecture on binary Kaprekar sequences with second digits
Statement
Let be a natural number written in base , and let be obtained by subtracting the second-smallest digit arrangement from the second-largest digit arrangement, retaining leading zeros. For , consider the iterates .
Binary Kaprekar sequence conjecture. When the digit length is , the sequence
reaches the fixed point . When the digit length is , the sequence enters a loop consisting of
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.