Generate Fibonacci Primes
Generate list of Fibonacci primes instantly. Fast browser-side calculations using BigInt with customizable ranges, indices, separators, and number bases.
What is a Fibonacci Prime?
A Fibonacci Prime is a Fibonacci number that is also a prime number. The Fibonacci sequence is a famous sequence of numbers in which each number is the sum of the two preceding ones, starting from $0$ and $1$. It is defined mathematically by the recurrence relation:
$$F_0 = 0,\quad F_1 = 1$$ $$F_n = F_{n-1} + F_{n-2} \quad \text{for } n \ge 2$$
A prime number is a natural number greater than $1$ that has no positive divisors other than $1$ and itself. When we look at the Fibonacci numbers: $$0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, \dots$$ we can identify the first few prime values:
- $F_3 = 2$ (prime)
- $F_4 = 3$ (prime)
- $F_5 = 5$ (prime)
- $F_7 = 13$ (prime)
- $F_{11} = 89$ (prime)
- $F_{13} = 233$ (prime)
- $F_{17} = 1597$ (prime)
- $F_{23} = 28657$ (prime)
Mathematical Properties of Fibonacci Primes
Fibonacci primes have several fascinating properties that captivate number theorists:
- Prime Indices: Except for $F_4 = 3$, if a Fibonacci number $F_p$ is prime, then its index $p$ must also be a prime number. For example, $F_{11} = 89$ is prime, and $11$ is prime. However, the converse is not true: a prime index does not guarantee that the Fibonacci number is prime. For instance, $19$ is a prime number, but $F_{19} = 4181 = 37 \times 113$ is composite.
- Divisibility: Fibonacci numbers have a strong divisibility property: $\gcd(F_a, F_b) = F_{\gcd(a, b)}$. This helps in showing that if $n$ is composite, then $F_n$ must also be composite (except for $n=4$).
- Infinite Question: One of the greatest unsolved problems in mathematics is whether there are infinitely many Fibonacci primes. Although many extremely large Fibonacci primes have been discovered, a formal proof of their infinitude remains elusive.
How to Use This Tool
This online Fibonacci Prime Generator makes it extremely simple to explore these special mathematical objects:
- Select the Generation Mode: Choose "First N Fibonacci Primes" to generate the first few primes sequentially, or choose "By Index Range n" to search within a specific range of indices.
- Configure the Number Format: You can output the prime values in standard decimal (Base 10), Hexadecimal, Binary, or Octal format.
- Choose a Separator: Customize how the generated list is formatted, including options for newlines, commas, spaces, or a custom string.
- Toggle index display to show the exact formula (e.g., $F(11) = 89$) or output raw values.
- Instantly copy or download the results using the quick action buttons on the output screen.
Frequently Asked Questions
What is the first Fibonacci prime?
The first Fibonacci prime is $2$, which corresponds to the 3rd Fibonacci number ($F_3 = 2$). The next is $3$ ($F_4 = 3$), followed by $5$ ($F_5 = 5$) and $13$ ($F_7 = 13$).
Does every prime index n produce a Fibonacci prime?
No, a prime index $p$ does not guarantee that $F_p$ is prime. For example, $19$ is a prime number, but the 19th Fibonacci number, $F_{19} = 4181$, is not prime since $4181 = 37 \times 113$. Other prime indices that produce composite Fibonacci numbers include $p = 31, 37, 41,$ and $53$.
Are there infinitely many Fibonacci primes?
This is currently an unsolved problem in number theory. Mathematicians conjecture that there are infinitely many Fibonacci primes, but it has not been mathematically proven.
How large can Fibonacci primes get?
Fibonacci primes grow extremely fast. While $F_{11}$ is only $89$, $F_{83}$ has 18 digits ($991948530948313$), and $F_{2971}$ has $621$ digits! Finding and proving primality for very large Fibonacci numbers requires specialized distributed computing software.
Related tools
Your recent visits