The density-one conjecture for numbers never reaching a v-palindromic number
Statement
Let denote the reversal of the decimal digits of , and define
Let be the least number of repetitions of the decimal digits of needed to reach a -palindromic number, with when no such repetition reaches one, and define
Density-one conjecture. The asymptotic density of in is . The paper proves that an explicitly described infinite family has , and asks for a simple way to determine whether is finite. The stronger assertion that almost every element of belongs to remains open.
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.