摘要
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.
作者
José
M. Sautto
Agustín Santiago
Carlos N. Bouza
Veró
nica Campos
JoséM. Sautto;Agustín Santiago;Carlos N. Bouza;Verónica Campos(Campus Costa Chica, Universidad Autónoma de Guerrero, Guerrero, México;Facultad de Matemáticas, Universidad Autónoma de Guerrero, Acapulco, México;Facultad de Matemática y Computación, Universidad de la Habana, Ciudad de La Habana, Cuba)
