Author(s)

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.

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.

Addition Chain, Exponentiation, Short Chain, Scholz’s Conjecture, Binary Method

M. Sautto, J. , Santiago, A. , Bouza, C. and Campos, V. (2016) Scholz’s First Conjecture: A Brief Demonstration. Applied Mathematics, 7, 70-76. doi: 10.4236/am.2016.71006.