![]() |
|
Golden Tommy Numbers - Printable Version +- Tetration Forum (https://tetrationforum.org) +-- Forum: Etc (https://tetrationforum.org/forumdisplay.php?fid=4) +--- Forum: About the Forum (https://tetrationforum.org/forumdisplay.php?fid=5) +--- Thread: Golden Tommy Numbers (/showthread.php?tid=983) |
Golden Tommy Numbers - tommy1729 - 04/13/2015 Consider the Fibonacci or tribonacci like recursion F(k) = f(1) + f(2) + ... + f(k-n) This leads us to the related golden Tommy Numbers G(n) for n a strict + integer, The largest real root of : x^n - x^(n-1) = 1 I know that g(1) till g(5) can be given by radicals and that g(1) = 2, g(2) = the golden mean. Also lim g(n) = 1. What else do we know about these numbers ? Regards Tommy1729 RE: Golden Tommy Numbers - tommy1729 - 04/13/2015 Sorry belongs in community or main. RE: Golden Tommy Numbers - tommy1729 - 04/24/2015 G(n) grows like 1 + exp(2)/n. I find it fascinating. Regards Tommy1729 |