Scholz conjecture


In mathematics, the Scholz conjecture is a conjecture on the length of certain addition chains.
It is sometimes also called the Scholz–Brauer conjecture or the Brauer–Scholz conjecture, after Arnold Scholz who formulated it in 1937 and Alfred T. Brauer who studied it soon afterward and proved a weaker bound.

Statement

The conjecture states that
where is the length of the shortest addition chain producing n.
Here, an addition chain is defined as a sequence of numbers, starting with 1, such that every number after the first can be expressed as a sum of two earlier numbers. Its length is the number of sums needed to express all its numbers, which is one less than the length of the sequence of numbers. Computing the length of the shortest addition chain that contains a given number can be done by dynamic programming for small numbers, but it is not known whether it can be done in polynomial time measured as a function of the length of the binary representation of. Scholz's conjecture, if true, would provide short addition chains for numbers of a special form, the Mersenne numbers.

Example

As an example, : it has a shortest addition chain
of length three, determined by the three sums
Also, : it has a shortest addition chain
of length seven, determined by the seven sums
Both and equal 7.
Therefore, these values obey the inequality and the Scholz conjecture is true for the case.

Partial results

By using a combination of computer search techniques and mathematical characterizations of optimal addition chains, showed that the conjecture is true for all. Additionally, he verified that for all, the inequality of the conjecture is actually an equality.