You are not signed in.

To save solutions, earn points and appear on the leaderboard. register or sign in.
In the fibonacci sequence every number is the sum of the two preceding ones:

\(1, 1, 2, 3, 5, 8, 13, 21, 34...\)

The sequence \(F_n\) of fibonacci numbers is defined as:

\(F_n = F_{n-1} + F_{n-2}\)

Find the sum of all the prime values in the fibonacci sequence, where \(F_n < 1,000,000\)

Find the sum of all the prime values in the fibonacci sequence, where \(F_n < 1,000,000\)