arXiv (All)
open access
On the distribution of the minimal length of addition chains
A sequence of integers $1=a_0<a_1<\cdots<a_k=n$ is called an addition chain of length $k$ if $a_j=a_s+a_t$ with $0\le s,t<j$ for all integers $j\in \{1,2,\ldots,k\}$. We denote by $\ell(n)$ the minimal length of an addition chain leading to $n$. Here we investigate the distribution of the function $
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
- Averages of values of L-series#954561
- Square root cancellation in the hyperbolic lattice counting problem over cocompact groups#1118902
- The Jensen--Pólya program and inequalities for arithmetic sequences#1149452
- Sharp and Growing Linear-Excess Inverse Theorems for Sets with Few Subset Sums#1097482
- Sharp unconditional moment bounds for products of L-functions#999135
Record · ID 1064977
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