====== The Scholz conjecture ======

The //Scholz Conjecture// relates the shortest length of an addition chain of //Mersene numbers// ([[https://en.wikipedia.org/wiki/Mersenne_prime|ref.]]) to the shortest length of addition chains producing their exponents.

Stated formally as :

//l//(2//<sup>n</sup>// − 1) ≤ //n// − 1 + //l//(//n//),

where //l//(//n//) 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 (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)."\\ \\ Source : [[https://en.wikipedia.org/wiki/Scholz_conjecture|Wikipedia]]

Note that various 'weaker' versions of the conjecture //have// been proved. For example :

Brauer, Alfred (1939), [[https://www.ams.org/journals/bull/1939-45-10/S0002-9904-1939-07068-7/S0002-9904-1939-07068-7.pdf|"On addition chains"]] {{:oa_padlock_grn.png?16}}//Bulletin of the American Mathematical Society//, 45 (10): 736–739,

Agama,Theophilus (2022).  [[https://doi.org/10.20935/AL5858|"On the shortest addition chain of numbers of special forms"]]{{:oa_padlock_grn.png?16}}  //arXiv, mathematics, general mathematics,// Mar. 2022.

Example chains have also been extensively investigated by computational methods. See:  Clift, Neill Michael (2011). [[https://link.springer.com/content/pdf/10.1007/s00607-010-0118-8.pdf|"Calculating optimal addition chains".]] {{:oa_padlock_grn.png?16}} //Computing//. 91 (3): 265–284.

But the full conjecture, as stated above, remains unproved.