@Limitcycle Uh, there is no algorithm which computes the nth fibonacci number in constant time. The best algorithm is \(O(\log n)\) for smallnums.
Why is this step necessary? mathstodon.xyz might not be the server where you are registered, so we need to redirect you to your home server first.
Don't have an account? You can sign up here