English

The Scholz conjecture for $n=2^m(23)+7$, $m \in \mathbb{N}^*$

Number Theory 2023-02-07 v1 Cryptography and Security

Abstract

The Scholz conjecture on addition chains states that (2n1)(n)+n1\ell(2^n-1) \leq \ell(n) + n -1 for all integers nn where (n)\ell(n) stands for the minimal length of all addition chains for nn. It is proven to hold for infinite sets of integers. In this paper, we will prove that the conjecture still holds for n=2m(23)+7n=2^m(23)+7. It is the first set of integers given by Thurber \cite{9} to prove that there are an infinity of integers satisfying (2n)=(n)\ell(2n) = \ell(n). Later on, Thurber \cite{4} give a second set of integers with the same properties (n=22m+k+7+22m+k+5+2m+k+4+2m+k+3+2m+2+2m+1+1n=2^{2m+k+7} + 2^{2m+k+5} + 2^{m+k+4} + 2^{m+k+3} + 2^{m+2} + 2^{m+1} + 1). We will prove that the conjecture holds for them as well.

Keywords

Cite

@article{arxiv.2302.02143,
  title  = {The Scholz conjecture for $n=2^m(23)+7$, $m \in \mathbb{N}^*$},
  author = {Amadou Tall},
  journal= {arXiv preprint arXiv:2302.02143},
  year   = {2023}
}