This paper presents a brief demonstration of Schulz’s first conjecture, which sets the upper and lower limits on the length of the shortest chain of addition. Two methods of the upper limit are demonstrated;the secon...This paper presents a brief demonstration of Schulz’s first conjecture, which sets the upper and lower limits on the length of the shortest chain of addition. Two methods of the upper limit are demonstrated;the second one is based on the algorithm of one of the most popular methods for obtaining addition chains of a number, known as the binary method.展开更多
文摘This paper presents a brief demonstration of Schulz’s first conjecture, which sets the upper and lower limits on the length of the shortest chain of addition. Two methods of the upper limit are demonstrated;the second one is based on the algorithm of one of the most popular methods for obtaining addition chains of a number, known as the binary method.
