ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r(n)r(n) denote the reversal of the decimal digits of nn, and define

S={n∈N:10∤n, n<r(n)}.S=\{n\in\mathbb{N}:10\nmid n,\ n<r(n)\}.

Let c(n)c(n) be the least number of repetitions of the decimal digits of nn needed to reach a vv-palindromic number, with c(n)=∞c(n)=\infty when no such repetition reaches one, and define

T={n∈S:c(n)=∞}.T=\{n\in S:c(n)=\infty\}.

Density-one conjecture. The asymptotic density of TT in SS is 11. The paper proves that an explicitly described infinite family has c(n)=∞c(n)=\infty, and asks for a simple way to determine whether c(n)c(n) is finite. The stronger assertion that almost every element of SS belongs to TT 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 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.