Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 4 Feb 2023 in math.NT and cs.CR | (2302.02143v1)

Abstract: The Scholz conjecture on addition chains states that $\ell(2n-1) \leq \ell(n) + n -1$ for all integers $n$ where $\ell(n)$ stands for the minimal length of all addition chains for $n$. 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)+7$. It is the first set of integers given by Thurber \cite{9} to prove that there are an infinity of integers satisfying $\ell(2n) = \ell(n)$. Later on, Thurber \cite{4} give a second set of integers with the same properties ($n=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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.