First 9 prime Fibonacci number: Difference between revisions
Content added Content deleted
(→{{header|Quackery}}: improved efficiency) |
Hellangelx (talk | contribs) |
||
Line 1,168: | Line 1,168: | ||
=={{header|Python}}== |
=={{header|Python}}== |
||
<syntaxhighlight lang="python"> |
<syntaxhighlight lang="python"> |
||
from math import sqrt |
|||
print("working...") |
|||
from time import time |
|||
print("The firsr 9 Prime Fibonacci numbers:") |
|||
n = 12 |
|||
start = time() |
|||
def |
def prime(x): |
||
⚫ | |||
if x < 2: |
|||
return False |
|||
if x == 2 or x == 3: |
|||
return True |
|||
⚫ | |||
return False |
|||
⚫ | |||
if x % i == 0: |
|||
return False |
return False |
||
return True |
return True |
||
def fib(nr): |
|||
⚫ | |||
return 0 |
|||
if (nr == 1): |
|||
return 1 |
|||
if (nr > 1): |
|||
return fib(nr-1) + fib(nr-2) |
|||
d = [1, 1] |
|||
for n in range(2,520000): |
|||
a, b, = 1, 1 |
|||
f = [] |
|||
if isprime(x): |
|||
while len(f) < n: |
|||
num = num + 1 |
|||
a, b, = b, a + b |
|||
if (x > 1): |
|||
d.append(b) |
|||
if (num < 11): |
|||
if prime(b): |
|||
print(str(x),end=" ") |
|||
f.append(b) |
|||
else: |
|||
print("fib(" + str(len(d)) + "):", b, "(" + str(time() - start) + "s)") |
|||
break |
|||
print() |
|||
print("done...") |
|||
</syntaxhighlight> |
</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
fib(3): 2 (0.0s) |
|||
working... |
|||
fib(4): 3 (0.0s) |
|||
The firsr 9 Prime Fibonacci numbers: |
|||
fib(5): 5 (0.0s) |
|||
2 3 5 13 89 233 1597 28657 514229 |
|||
fib(7): 13 (0.0s) |
|||
done... |
|||
fib(11): 89 (0.0s) |
|||
fib(13): 233 (0.0s) |
|||
fib(17): 1597 (0.0s) |
|||
fib(23): 28657 (0.0s) |
|||
fib(29): 514229 (0.0009968280792236328s) |
|||
fib(43): 433494437 (0.0009968280792236328s) |
|||
fib(47): 2971215073 (0.003988504409790039s) |
|||
fib(83): 99194853094755497 (15.122319459915161s) |
|||
Process finished with exit code 0 |
|||
</pre> |
</pre> |
||