The generating function for this construct has the closed-form solution of x over the quantity 1 minus x minus x squared. Euclid's algorithm has a worst case runtime when the inputs are consecutive numbers. Lucas numbers follow the same recurrence as this series but with starting inputs of 2 and 1, and it was originally developed in the Liber Abaci to follow the multiplication of rabbits. Converging to the golden ration is, for 10 points, what eponymous sequence whose first few terms are 1, 1, 2
The generating function for this construct has the closed-form solution of x over the quantity 1 minus x minus x squared. Euclid's algorithm has a worst case runtime when the inputs are consecutive numbers. Lucas numbers follow the same recurrence as this series but with starting inputs of 2 and 1, and it was originally developed in the Liber Abaci to follow the multiplication of rabbits. Converging to the golden ration is, for 10 points, what eponymous sequence whose first few terms are 1, 1, 2, 3, 5, and 8?
The generating function for this construct has the closed-form solution of x over the quantity 1 minus x minus x squared.
{Fibonacci} sequence/numbers