The series of prime numbers p(adsbygoogle = window.adsbygoogle || []).push({}); _{n}=2, 3, 5, 7, 11, 13, 17, 19, 23, 27..., and Fibonacci numbers F_{n}=0, 1, 1, 2, 3, 5, 8, 13, 21, 34..., suggest that F_{n}might be considered to surpass p_{n}exactly at an irrational value n_{s}such that 9<n_{s}<10 and can be determined most exactly from both series as n-->infinity.

How would you determine n_{s}?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Where Fibonacci numbers surpass prime numbers

Loading...

Similar Threads for Where Fibonacci numbers | Date |
---|---|

I Matrices and linear transformations. Where did I go wrong? | Feb 2, 2017 |

I Transpose Property (where's my mistake) | Aug 28, 2016 |

Condition for a number to be a Fibonacci one | May 30, 2014 |

The question is , if f(n)= 1+10+10^2 + + 10^n , where n is | Dec 5, 2012 |

Sum_{k=0n} p(k) where p(k) = number of partitions of k | Nov 5, 2012 |

**Physics Forums - The Fusion of Science and Community**