arXiv (All)
open access
Counterexamples to a conjecture of Kamenetsky on OEIS A173419
Define a(n) as the number corresponding to the shortest computation using only addition, subtraction, or multiplication, as A173419 states on the related OEIS page. In a comment to the sequence, D. Kamenetsky conjectured that a(p) $\ge$ a(p -1) for every prime. We show that the conjecture is false t
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
- Notes on Mitsui's Prime Number Theorem with Siegel zeros#984784
- Distinct Consecutive Products#1011277
- Vô Conjecture 6 (VC6)#109201
- Vô Conjecture 12 series 1 (VC12S1)#690061
- Nombres de Pisot, nombres de Salem et la conjecture de Lehmer#1144733
Record · ID 1076169
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