The multiplicative persistence conjecture
Statement
Let be the product of the decimal digits of , let be the smallest nonnegative integer such that , and let be the resulting one-digit target. Multiplicative persistence conjecture. For every ,
This is the classical conjecture that multiplicative persistence is universally bounded by ; it is known to hold for all , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.