I'm looking for the asymptotic approximation of the product of the first $n$ Fibonacci numbers.
Does there exist a tight approximation for these kind of things?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityI'm looking for the asymptotic approximation of the product of the first $n$ Fibonacci numbers.
Does there exist a tight approximation for these kind of things?
By the Binet formula,
$$F_n\approx\frac{\phi^n}{\sqrt5}.$$
Then multiplying the $n$ first estimates
$$P_n\approx a\frac{\phi^{n(n+1)/2}}{\sqrt5^n}.$$
By numerical computation, $a\approx 1.22674201072$.
We can deduce an expression for the geometric average
$$\sqrt[n]P_n\approx\frac{\phi^{(n+1)/2}}{\sqrt5}\approx\frac{F_n}{\sqrt{5\phi}}.$$