The Scholz conjecture on addition chain is true for infinitely many integers with (2n)= (n)
Abstract
It is known that the Scholz conjecture on addition chains is true for all integers n with (2n) = (n)+1. There exists infinitely many integers with (2n) ≤ (n) and we don't know if the conjecture still holds for them. The conjecture is also proven to hold for integers n with v(n) ≤ 5 and for infinitely many integers with v(n)=6. There is no specific results on integers with v(n)=7. In thurber, an infinite list of integers satisfying (n) = (2n) and v(n) = 7 is given. In this paper, we prove that the conjecture holds for all of them.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.