First 9 prime Fibonacci number: Difference between revisions
Content added Content deleted
No edit summary |
|||
Line 48: | Line 48: | ||
19: 10597999265301490732599643671505003412515860435409421932560009680142974347195483140293254396195769876129909 |
19: 10597999265301490732599643671505003412515860435409421932560009680142974347195483140293254396195769876129909 |
||
20: 36684474316080978061473613646275630451100586901195229815270242868417768061193560857904335017879540515228143777781065869</pre> |
20: 36684474316080978061473613646275630451100586901195229815270242868417768061193560857904335017879540515228143777781065869</pre> |
||
=={{header|Python}}== |
|||
<lang python> |
|||
print("working...") |
|||
print("The firsr 9 Prime Fibonacci numbers:") |
|||
num = 0 |
|||
def isprime(m): |
|||
for i in range(2,int(m**0.5)+1): |
|||
if m%i==0: |
|||
return False |
|||
return True |
|||
def fib(nr): |
|||
if (nr == 0): |
|||
return 0 |
|||
if (nr == 1): |
|||
return 1 |
|||
if (nr > 1): |
|||
return fib(nr-1) + fib(nr-2) |
|||
for n in range(2,520000): |
|||
x = fib(n) |
|||
if isprime(x): |
|||
num = num + 1 |
|||
if (x > 1): |
|||
if (num < 11): |
|||
print(str(x),end=" ") |
|||
else: |
|||
break |
|||
print() |
|||
print("done...") |
|||
</lang> |
|||
{{out}} |
|||
<pre> |
|||
working... |
|||
The firsr 9 Prime Fibonacci numbers: |
|||
2 3 5 13 89 233 1597 28657 514229 |
|||
done... |
|||
</pre> |
|||
=={{header|Ring}}== |
=={{header|Ring}}== |