Abstract: This paper presents a brief demonstration of Scholz’s third conjecture  for n numbers such that their minimum chain addition is star type . The demonstration is based on the proposal of an algorithm that takes as input the star-adding chain of a number n, and returns a string in addition to x = 2n - 1 of length equal to l (n) + n - 1. As for any type addition chain star of a number n, this chain is minimal demonstrates the Scholz’s third Conjecture for such numbers.
Cite this paper:
J. Vallejo, A. Moreno, C. Herrera and V. Guzmán, "Scholz’s Third Conjecture: A Demonstration for Star Addition Chains," Applied Mathematics, Vol. 4 No. 10, 2013, pp. 1-2. doi: 10.4236/am.2013.410A1001.
 A. Scholtz, “Aufgaben und Losungen, 253,” Jahresbericht der Deutsche Mathematiker-Vereinigung, Vol. 47, 1937, pp. 41-42.