arXiv (OAI Expanded)
open access
The Multiplicative Persistence Conjecture: Resolving the \(2\)-Adic Obstruction for Nonzero Even Targets
The multiplicative persistence problem studies the process of repeatedly replacing a positive integer by the product of its digits until a single digit, called the terminal digit, is reached. The classical conjecture asserts that no decimal integer requires more than \(11\) iterations. Brier, Clavie
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Multiplicative Persistence Conjecture: Resolving the \(2\)-Adic Obstruction for Nonzero Even Targets#781093
- Smarandache recursive arithmetic structures: Conjectures, open problems, and computational explorations#691366
- Vô conjecture 31 series 2(VC31S2)#688920
- Vô conjecture 31 series 1(VC31S1)#690338
- Multiplicative number theory. I. Classical theory#490196
Record · ID 779718
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive