9 ms·
> Comparison against standard techniques such as Fibonacci ratios and mock Ramanujan-style series reveals orders-of-magnitude improvement in convergence speed
by Someone 1y ago
> Comparison against standard techniques such as Fibonacci ratios and mock Ramanujan-style series reveals orders-of-magnitude improvement in convergence speed
Given that computing The n-th term involved computing the factorial of 60 times n, I don’t see that as being interesting. If I define
FF(n) = F(n!) ÷ F(n! - 1)
With F(n) the nth Fibonacci number, that converges way faster than F(n), too.
Also, given that AIs can hallucinate: does this provably converge to √5?
- WASDAai 1y agoIt does not. What it does is, if you take consider delta phi then if you compress it more each step, the more it gets closer, the more you compress then you get near to golden ratio with like 10^-31 error only. The point of this equation is, at first it seems like just a not working serie generated by ai. But if you analyze correctly then you see it has something more inside. I already developed several python codes to do experiments with this graph and have graphs to see how this equations acts. What also interesting is, it always acts differently. People wanted to see if it can generate the golden ratio this is why I spent my time on showing that yes, It can. But the main purpose of this equation is not input and see bunch of 1.618033988749894848204586834365638...... It is just an illusion for me the keep eyes on it. Otherwise people would not understand the key point of this equation.