DEV Community

Discussion on: Let's Get Clever #1: Fibonacci Sequence

View post

Replies for: I'm going for the bonus points, no explicit loops nor recursion, and O(1) time*. import math sq5 = math.sqrt(5.0) def fib( n ): a = ((1.0 + ...

Collapse
 
mortoray profile image
edA‑qa mort‑ora‑y • • Edited

Everything is more fun with unicode:

import math

sq5 = math.sqrt(5.0)
φ = (1.0 + sq5)/2.0
ψ = -1/φ

def fib_x( n ):
    return  int( (φ ** n - ψ ** n) / sq5 )

for i in range(20):
    print(fib_x(i))