ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(n)f(n) be the product of the decimal digits of nn, let Xi(n)Xi(n) be the smallest nonnegative integer kk such that fk(n)≤9f^k(n)\leq 9, and let Δ(n)\Delta(n) be the resulting one-digit target. Multiplicative persistence conjecture. For every n∈Nn\in\mathbb{N},

Ξ(n)≤11.\Xi(n)\leq 11.

This is the classical conjecture that multiplicative persistence is universally bounded by 1111; it is known to hold for all n≤1020000n\leq 10^{20000}, but remains open in general.

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.