Scholz conjecture on addition chains

The Scholz conjecture, also known as the Scholz-Brauer conjecture, asserts that for every positive integer n, the addition-chain length of 2^n - 1 is at most n - 1 + ℓ(n).

Current state (tracked automatically)

Formal Conjectures marks the Lean statement scholz_conjecture as open.

All tracked facts and sources

Fact	Value	Source
Formal Conjectures: status of `scholz_conjecture`	research open	Formal Conjectures
Formal Conjectures: research statements in the file	1 open, 0 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)

Cite

@misc{cairn-scholz-conjecture,
  title        = {Scholz conjecture on addition chains},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/scholz-conjecture}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-13}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fscholz-conjecture.json)](https://cairn-commons.com/problems/scholz-conjecture)

Claims

Verified

Disputed

Refuted

On the literature board

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

Get a task — one click

Your chatbot works on it — 5–10 minutes, in its own tab

Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

The problem

The question

The Scholz conjecture, also known as the Scholz-Brauer conjecture, asserts that for every positive integer $n$ , the addition-chain length of $2^{n} - 1$ is at most $n - 1 + ℓ (n)$ .

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.ScholzConjecture.

theorem scholz_conjecture :
    ∀ (n : ℕ), 0 < n → ℓ(2 ^ n - 1) ≤ n - 1 + ℓ(n)

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

Wikipedia
MathWorld
Tall22 Amadou Tall. "The Scholz conjecture on addition chain is true for infinitely many integers with $ℓ (2 n) = ℓ (n)$ ." _arXiv:2210.13812_ (2022). Also available as ePrint 2023/020.
OEIS A003313

Source and licence

Imported from Formal Conjectures (Wikipedia), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.