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[1] and Alfred Brauer who studied it soon afterward and proved a weaker bound.[2]
Neill Clift has announced an example showing that the bound of the conjecture is not always tight.
Statement
[edit]The conjecture states that
- l(2n − 1) ≤ n − 1 + l(n),
where l(n) is the length of the shortest addition chain producing n.[3]
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 (which are allowed to both be equal). 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 (since there is no sum of previous numbers for the first number in the sequence, 1). Computing the length of the shortest addition chain that contains a given number x 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 x. Scholz's conjecture, if true, would provide short addition chains for numbers x of a special form, the Mersenne numbers.
Example
[edit]As an example, l(5) = 3: it has a shortest addition chain
- 1, 2, 4, 5
of length three, determined by the three sums
- 1 + 1 = 2,
- 2 + 2 = 4,
- 4 + 1 = 5.
Also, l(31) = 7: it has a shortest addition chain
- 1, 2, 3, 6, 12, 24, 30, 31
of length seven, determined by the seven sums
- 1 + 1 = 2,
- 2 + 1 = 3,
- 3 + 3 = 6,
- 6 + 6 = 12,
- 12 + 12 = 24,
- 24 + 6 = 30,
- 30 + 1 = 31.
Both l(31) and 5 − 1 + l(5) equal 7. Therefore, these values obey the inequality (which in this case is an equality) and the Scholz conjecture is true for the case n = 5.
Partial results
[edit]By using a combination of computer search techniques and mathematical characterizations of optimal addition chains, Clift (2011) showed that the conjecture is true for all n < 5784689. Additionally, he verified that for all n ≤ 64, the inequality of the conjecture is actually an equality.[4]
The bound of the conjecture is not always an exact equality. For instance, for , , with .[5][6]
References
[edit]- ^ Scholz, Arnold (1937), "Aufgaben und Lösungen, 253", Jahresbericht der Deutschen Mathematiker-Vereinigung, 47: 41–42, ISSN 0012-0456
- ^ Brauer, Alfred (1939), "On addition chains", Bulletin of the American Mathematical Society, 45 (10): 736–739, doi:10.1090/S0002-9904-1939-07068-7, ISSN 0002-9904, MR 0000245, Zbl 0022.11106
- ^ Guy, Richard K. (2004). Unsolved problems in number theory (3rd ed.). Springer-Verlag. pp. 169–171. ISBN 978-0-387-20860-2. Zbl 1058.11001.
- ^ Clift, Neill Michael (2011). "Calculating optimal addition chains". Computing. 91 (3): 265–284. doi:10.1007/s00607-010-0118-8.
- ^ Clift, Neill (July 2024). "Exact Equality in the Scholz-Brauer Conjecture". Retrieved 2024-07-20.
- ^ Flammenkamp, Achim (July 2024). "A Counter-Example that the Scholz-Brauer Conjecture holds with Equality for all n". Retrieved 2024-07-20.