You are viewing a single comment's thread. Return to all comments →
just read about it Benit Theorem on fabonacci serious, & start the current num = 2; curr_num = int(pow(((1 + pow(5 , 0.5)) / 2),3) * curr_num + 0.5)
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #2: Even Fibonacci numbers
You are viewing a single comment's thread. Return to all comments →
just read about it Benit Theorem on fabonacci serious, & start the current num = 2; curr_num = int(pow(((1 + pow(5 , 0.5)) / 2),3) * curr_num + 0.5)