This technique was first used in 1575 by Francesco
This technique was first used in 1575 by Francesco Maurolico and can be used to show the Binet formulation for the nth Fibonacci number in terms of the Golden Ratio. The technique is included as one of the Peano Axioms and is logically equivalent to the Well-Ordering Principle or the Axiom of Choice. Gauss was able to give 5050 as the sum the first 100 integers via a shortcut to it. For 10 points, one must first show a base case and then show that the assumption is true for n+1 in what method, which can establish truth for all natural numbers?
This technique was first used in 1575 by Francesco Maurolico and can be used to show the Binet formulation for the nth Fibonacci number in terms of the Golden Ratio.