First 9 prime Fibonacci number: Difference between revisions
Content added Content deleted
Alextretyak (talk | contribs) (Added 11l) |
Alextretyak (talk | contribs) (Fix Python solution to match output) |
||
| Line 1,230: | Line 1,230: | ||
d = [1, 1] |
|||
a, b, = 1, 1 |
a, b, = 1, 1 |
||
fibn = 3 |
|||
f = [] |
f = [] |
||
while len(f) < n: |
while len(f) < n: |
||
a, b, = b, a + b |
a, b, = b, a + b |
||
d.append(b) |
|||
if prime(b): |
if prime(b): |
||
f.append(b) |
f.append(b) |
||
print("fib(%d): %s (%s s)" % ( |
print("fib(%d): %s (%s s)" % (fibn, b, time() - start)) |
||
fibn += 1 |
|||
</syntaxhighlight> |
</syntaxhighlight> |
||
{{out}} |
{{out}} |
||