Fibonacci prime

A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime.
The first Fibonacci primes are :

Known Fibonacci primes

It is not known whether there are infinitely many Fibonacci primes. With the indexing starting with, the first 37 indices n for which F_n is prime are :
In addition to these proven Fibonacci primes, several probable primes have been found:
Except for the case n = 4, all Fibonacci primes have a prime index, because if a divides b, then also divides . That is to say, the Fibonacci sequence is a divisibility sequence.
F_p is prime for 8 of the first 10 primes p; the exceptions are F₂ = 1 and F₁₉ = 4181 = 37 × 113. However, Fibonacci primes appear to become rarer as the index increases. F_p is prime for only 26 of the 1229 primes p smaller than 10,000. The number of prime factors in the Fibonacci numbers with prime index are:
, the largest known certain Fibonacci prime is F₂₀₁₁₀₇, with 42029 digits. It was proved prime by Maia Karpovich in September 2023. The largest known probable Fibonacci prime is F_11964299. It was found by Ryan Propper in June 2025.
It was proved by Nick MacKinnon that the only Fibonacci numbers that are also twin primes are 3, 5, and 13.

Divisibility of Fibonacci numbers

A prime divides if and only if p is congruent to ±1 modulo 5, and p divides if and only if it is congruent to ±2 modulo 5.
Fibonacci numbers that have a prime index p do not share any common divisors greater than 1 with the preceding Fibonacci numbers, due to the identity:
For, F_n divides F_m if and only if n divides m.
If we suppose that m is a prime number p, and n is less than p, then it is clear that F_p cannot share any common divisors with the preceding Fibonacci numbers.
This means that F_p will always have characteristic factors or be a prime characteristic factor itself. The number of distinct prime factors of each Fibonacci number can be put into simple terms.F_nk is a multiple of F_k for all values of n and k such that n ≥ 1 and k ≥ 1. It's safe to say that F_nk will have "at least" the same number of distinct prime factors as F_k. All F_p will have no factors of F_k, but "at least" one new characteristic prime from Carmichael's theorem.

Carmichael's Theorem applies to all Fibonacci numbers except four special cases: and If we look at the prime factors of a Fibonacci number, there will be at least one of them that has never before appeared as a factor in any earlier Fibonacci number. Let π_n be the number of distinct prime factors of F_n.

n	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19	20	21	22	23	24	25
F_n	1	1	2	3	5	8	13	21	34	55	89	144	233	377	610	987	1597	2584	4181	6765	10946	17711	28657	46368	75025
π_n	0	0	1	1	1	1	1	2	2	2	1	2	1	2	3	3	1	3	2	4	3	2	1	4	2

The first step in finding the characteristic quotient of any F_n is to divide out the prime factors of all earlier Fibonacci numbers F_k for which k | n.
The exact quotients left over are prime factors that have not yet appeared.
If p and q are both primes, then all factors of F_pq are characteristic, except for those of F_p and F_q.
Therefore:
The number of distinct prime factors of the Fibonacci numbers with a prime index is directly relevant to the counting function.

p	2	3	5	7	11	13	17	19	23	29	31	37	41	43	47	53	59	61	67	71	73	79	83	89	97
π_p	0	1	1	1	1	1	1	2	1	1	2	3	2	1	1	2	2	2	3	2	2	2	1	2	4

Rank of apparition

For a prime p, the smallest index u > 0 such that F_u is divisible by p is called the rank of apparition of p and denoted a. The rank of apparition a is defined for every prime p. The rank of apparition divides the Pisano period π and allows to determine all Fibonacci numbers divisible by p.
For the divisibility of Fibonacci numbers by powers of a prime, and
In particular

Wall–Sun–Sun primes

A prime p ≠ 2, 5 is called a Fibonacci–Wieferich prime or a Wall–Sun–Sun prime if where
and is the Legendre symbol:
It is known that for p ≠ 2, 5, a is a divisor of:
For every prime p that is not a Wall–Sun–Sun prime, as illustrated in the table below:

p	2	3	5	7	11	13	17	19	23	29	31	37	41	43	47	53	59	61
a	3	4	5	8	10	7	9	18	24	14	30	19	20	44	16	27	58	15
a	6	12	25	56	110	91	153	342	552	406	930	703	820	1892	752	1431	3422	915

The existence of Wall–Sun–Sun primes is conjectural.

Fibonacci primitive part

Because, we can divide any Fibonacci number by the least common multiple of all where. The result is called the primitive part of. The primitive parts of the Fibonacci numbers are
Any primes that divide and not any of the s are called primitive prime factors of. The product of the primitive prime factors of the Fibonacci numbers are
The first case of more than one primitive prime factor is 4181 = 37 × 113 for.
The primitive part has a non-primitive prime factor in some cases. The ratio between the two above sequences is
The natural numbers n for which has exactly one primitive prime factor are
For a prime p, p is in this sequence if and only if is a Fibonacci prime, and 2p is in this sequence if and only if is a Lucas prime. Moreover, 2ⁿ is in this sequence if and only if is a Lucas prime.
The number of primitive prime factors of are
The least primitive prime factors of are
It is conjectured that all the prime factors of are primitive when is a prime number.

Fibonacci numbers in prime-like sequences

Although it is not known whether there are infinitely many Fibonacci numbers which are prime, Melfi proved that there are infinitely many which are practical numbers, a sequence which resembles the primes in some respects.