A lower bound for length of addition chains

2022 · doi:10.14293/111.000/000042.v1
preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

In this paper we show that the shortest length (n) of addition chains producing numbers of the form 2n−1 satisfies the lower boundι(2n−1)≥n+blog(n−1)log 2cwhereb·cdenotes the floor function

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-06-06T02:00:05.402940+00:00
License: CC-BY-4.0