The Scholz conjecture for n=2m(23)+7, m ∈ N*

Abstract

The Scholz conjecture on addition chains states that (2n-1) ≤ (n) + n -1 for all integers n where (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 9 to prove that there are an infinity of integers satisfying (2n) = (n). Later on, Thurber 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 + 1). We will prove that the conjecture holds for them as well.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…