Fibonacci prime

Fibonacci prime
No. of known terms	15
Conjectured no. of terms	Infinite
First terms	2, 3, 5, 13, 89, 233
Largest known term	F6530879
OEIS index	A001605 ; Indices of prime Fibonacci numbers;

Last updated November 08, 2023

A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime.

Known Fibonacci primes

Unsolved problem in mathematics:

Are there an infinite number of Fibonacci primes?

(more unsolved problems in mathematics)

It is not known whether there are infinitely many Fibonacci primes. With the indexing starting with F₁ = F₂ = 1, the first 37 indices n for which F_n is prime are (sequence A001605 in the OEIS ):

n = 3, 4, 5, 7, 11, 13, 17, 23, 29, 43, 47, 83, 131, 137, 359, 431, 433, 449, 509, 569, 571, 2971, 4723, 5387, 9311, 9677, 14431, 25561, 30757, 35999, 37511, 50833, 81839, 104911, 130021, 148091, 201107.

(Note that the actual values F_n rapidly become very large, so, for practicality, only the indices are listed.)

In addition to these proven Fibonacci primes, several probable primes have been found:

n = 397379, 433781, 590041, 593689, 604711, 931517, 1049897, 1285607, 1636007, 1803059, 1968721, 2904353, 3244369, 3340367, 4740217, 6530879.^[2]

Except for the case n = 4, all Fibonacci primes have a prime index, because if a divides b, then $F_{a}$ also divides $F_{b}$ (but not every prime index results in a Fibonacci prime). 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.^[3] The number of prime factors in the Fibonacci numbers with prime index are:

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, 2, 3, 2, 2, 2, 2, 1, 1, 3, 4, 2, 4, 4, 2, 2, 3, 3, 2, 2, 4, 2, 4, 4, 2, 5, 3, 4, 3, 2, 3, 3, 4, 2, 2, 3, 4, 2, 4, 4, 4, 3, 2, 3, 5, 4, 2, 1, ... (sequence A080345 in the OEIS )

As of September 2023^[update], the largest known certain Fibonacci prime is F₂₀₁₁₀₇, with 42029 digits. It was proved prime by Maia Karpovich in September 2023.^[4] The largest known probable Fibonacci prime is F_6530879. It was found by Ryan Propper in August 2022.^[2] It was proved by Nick MacKinnon that the only Fibonacci numbers that are also twin primes are 3, 5, and 13.^[5]

Divisibility of Fibonacci numbers

A prime $p$ divides $F_{p-1}$ if and only if p is congruent to ±1 modulo 5, and p divides $F_{p+1}$ if and only if it is congruent to ±2 modulo 5. (For p = 5, F₅ = 5 so 5 divides F₅)

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:^[6]

\gcd(F_{n},F_{m})=F_{\gcd(n,m)}.

For $n \geq 3$ , F_n divides F_m if and only if n divides m.^[7]

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.

\gcd(F_{p},F_{n})=F_{\gcd(p,n)}=F_{1}=1.

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.^[8] 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: $F_{1}=F_{2}=1,F_{6}=8$ and $F_{12}=144.$ 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. (sequence A022307 in the OEIS )

If k | n then

\pi _{n}\geqslant \pi _{k}+1

except for

\pi _{6}=\pi _{3}=1.

If k = 1, and n is an odd prime, then 1 | p and

\pi _{p}\geqslant \pi _{1}+1=1.

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.^[9]

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.

{\begin{aligned}\gcd(F_{pq},F_{q})&=F_{\gcd(pq,q)}=F_{q}\\\gcd(F_{pq},F_{p})&=F_{\gcd(pq,p)}=F_{p}\end{aligned}}

Therefore:

\pi _{pq}\geqslant {\begin{cases}\pi _{p}+\pi _{q}+1&p\neq q\\\pi _{p}+1&p=q\end{cases}}

The number of distinct prime factors of the Fibonacci numbers with a prime index is directly relevant to the counting function. (sequence A080345 in the OEIS )

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 (sometimes called Fibonacci entry point) of p and denoted a(p). The rank of apparition a(p) is defined for every prime p.^[10] The rank of apparition divides the Pisano period π(p) and allows to determine all Fibonacci numbers divisible by p.^[11]

For the divisibility of Fibonacci numbers by powers of a prime, $p\geqslant 3,n\geqslant 2$ and $k\geqslant 0$

p^{n}\mid F_{a(p)kp^{n-1}}.

In particular

p^{2}\mid F_{a(p)p}.

Wall–Sun–Sun primes

A prime p ≠ 2, 5 is called a Fibonacci–Wieferich prime or a Wall–Sun–Sun prime if $p^{2}\mid F_{q},$ where

q=p-\left({\frac {p}{5}}\right)

and $\left({\tfrac {p}{5}}\right)$ is the Legendre symbol:

\left({\frac {p}{5}}\right)={\begin{cases}1&p\equiv \pm 1{\bmod {5}}\\-1&p\equiv \pm 2{\bmod {5}}\end{cases}}

It is known that for p ≠ 2, 5, a(p) is a divisor of:^[12]

p-\left({\frac {p}{5}}\right)={\begin{cases}p-1&p\equiv \pm 1{\bmod {5}}\\p+1&p\equiv \pm 2{\bmod {5}}\end{cases}}

For every prime p that is not a Wall–Sun–Sun prime, $a(p^{2})=pa(p)$ 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(p)	3	4	5	8	10	7	9	18	24	14	30	19	20	44	16	27	58	15
a(p²)	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 $F_{a}|F_{ab}$ , we can divide any Fibonacci number $F_{n}$ by the least common multiple of all $F_{d}$ where $d|n$ . The result is called the primitive part of $F_{n}$ . The primitive parts of the Fibonacci numbers are

1, 1, 2, 3, 5, 4, 13, 7, 17, 11, 89, 6, 233, 29, 61, 47, 1597, 19, 4181, 41, 421, 199, 28657, 46, 15005, 521, 5777, 281, 514229, 31, 1346269, 2207, 19801, 3571, 141961, 321, 24157817, 9349, 135721, 2161, 165580141, 211, 433494437, 13201, 109441, ... (sequence A061446 in the OEIS )

Any primes that divide $F_{n}$ and not any of the $F_{d}$ s are called primitive prime factors of $F_{n}$ . The product of the primitive prime factors of the Fibonacci numbers are

1, 1, 2, 3, 5, 1, 13, 7, 17, 11, 89, 1, 233, 29, 61, 47, 1597, 19, 4181, 41, 421, 199, 28657, 23, 3001, 521, 5777, 281, 514229, 31, 1346269, 2207, 19801, 3571, 141961, 107, 24157817, 9349, 135721, 2161, 165580141, 211, 433494437, 13201, 109441, 64079, 2971215073, 1103, 598364773, 15251, ... (sequence A178763 in the OEIS )

The first case of more than one primitive prime factor is 4181 = 37 × 113 for $F_{19}$ .

The primitive part has a non-primitive prime factor in some cases. The ratio between the two above sequences is

1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 1, 1, .... (sequence A178764 in the OEIS )

The natural numbers n for which $F_{n}$ has exactly one primitive prime factor are

3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 32, 33, 34, 35, 36, 38, 39, 40, 42, 43, 45, 47, 48, 51, 52, 54, 56, 60, 62, 63, 65, 66, 72, 74, 75, 76, 82, 83, 93, 94, 98, 105, 106, 108, 111, 112, 119, 121, 122, 123, 124, 125, 131, 132, 135, 136, 137, 140, 142, 144, 145, ... (sequence A152012 in the OEIS )

For a prime p, p is in this sequence if and only if $F_{p}$ is a Fibonacci prime, and 2p is in this sequence if and only if $L_{p}$ is a Lucas prime (where $L_{p}$ is the $p$ th Lucas number). Moreover, 2ⁿ is in this sequence if and only if $L_{2^{n-1}}$ is a Lucas prime.

The number of primitive prime factors of $F_{n}$ are

0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 1, 2, 1, 1, 3, 2, 3, 2, 2, 1, 2, 1, 1, 1, 2, 2, 2, 2, 3, 1, 1, 2, 2, 2, 2, 3, 2, 2, 2, 2, 1, 1, 3, 2, 4, 1, 2, 2, 2, 2, 3, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 3, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, ... (sequence A086597 in the OEIS )

The least primitive prime factors of $F_{n}$ are

1, 1, 2, 3, 5, 1, 13, 7, 17, 11, 89, 1, 233, 29, 61, 47, 1597, 19, 37, 41, 421, 199, 28657, 23, 3001, 521, 53, 281, 514229, 31, 557, 2207, 19801, 3571, 141961, 107, 73, 9349, 135721, 2161, 2789, 211, 433494437, 43, 109441, 139, 2971215073, 1103, 97, 101, ... (sequence A001578 in the OEIS )

It is conjectured that all the prime factors of $F_{n}$ are primitive when $n$ is a prime number.^[13]

Fibonacci numbers in prime-like sequences

Although it is not known whether there are infinitely primes in the Fibonacci sequence, Melfi proved that there are infinitely many primes^[14] among practical numbers, a prime-like sequence.

Related Research Articles

In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted $F n$ . The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes from 1 and 2. Starting from 0 and 1, the first few values in the sequence are:

The Möbius function $μ (n)$ is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated Moebius) in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted $μ (x)$ .

<span class="mw-page-title-main">Quadratic reciprocity</span> Gives conditions for the solvability of quadratic equations modulo prime numbers

In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is:

<span class="mw-page-title-main">Euler's totient function</span> Number of integers coprime to and not exceeding n

In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as $or, and may also be called Euler's phi function . In other words, it is the number of integers k in the range 1 \leq k \leq n for which the greatest common divisor gcd(n, k) is equal to 1. The integers k of this form are sometimes referred to as totatives of n .$

2 (two) is a number, numeral and digit. It is the natural number following 1 and preceding 3. It is the smallest and only even prime number. Because it forms the basis of a duality, it has religious and spiritual significance in many cultures.

<span class="mw-page-title-main">Root of unity</span> Number that has an integer power equal to 1

In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power $n$ . Roots of unity are used in many branches of mathematics, and are especially important in number theory, the theory of group characters, and the discrete Fourier transform.

In number theory, a $k$ -hyperperfect number is a natural number $n$ for which the equality $holds, where σ (n) is the divisor function (i.e., the sum of all positive divisors of n). A hyperperfect number is a k -hyperperfect number for some integer k . Hyperperfect numbers generalize perfect numbers, which are 1-hyperperfect.$

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist, although none are known.

In mathematics, a semiprime is a natural number that is the product of exactly two prime numbers. The two primes in the product may equal each other, so the semiprimes include the squares of prime numbers. Because there are infinitely many prime numbers, there are also infinitely many semiprimes. Semiprimes are also called biprimes.

63 (sixty-three) is the natural number following 62 and preceding 64.

In number theory, Carmichael's theorem, named after the American mathematician R. D. Carmichael, states that, for any nondegenerate Lucas sequence of the first kind U_n(P, Q) with relatively prime parameters P, Q and positive discriminant, an element U_n with n ≠ 1, 2, 6 has at least one prime divisor that does not divide any earlier one except the 12th Fibonacci number F(12) = U₁₂(1, −1) = 144 and its equivalent U₁₂(−1, −1) = −144.

Lucas pseudoprimes and Fibonacci pseudoprimes are composite integers that pass certain tests which all primes and very few composite numbers pass: in this case, criteria relative to some Lucas sequence.

In number theory, the nth Pisano period, written as $π$ (n), is the period with which the sequence of Fibonacci numbers taken modulo n repeats. Pisano periods are named after Leonardo Pisano, better known as Fibonacci. The existence of periodic functions in Fibonacci numbers was noted by Joseph Louis Lagrange in 1774.

In number theory, a practical number or panarithmic number is a positive integer $such that all smaller positive integers can be represented as sums of distinct divisors of . For example, 12 is a practical number because all the numbers from 1 to 11 can be expressed as sums of its divisors 1, 2, 3, 4, and 6: as well as these divisors themselves, we have 5 = 3 + 2, 7 = 6 + 1, 8 = 6 + 2, 9 = 6 + 3, 10 = 6 + 3 + 1, and 11 = 6 + 3 + 2.$

In algebra, Gauss's lemma, named after Carl Friedrich Gauss, is a statement about polynomials over the integers, or, more generally, over a unique factorization domain. Gauss's lemma underlies all the theory of factorization and greatest common divisors of such polynomials.

Cubic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence x³ ≡ p (mod q) is solvable; the word "reciprocity" comes from the form of the main theorem, which states that if p and q are primary numbers in the ring of Eisenstein integers, both coprime to 3, the congruence x³ ≡ p is solvable if and only if x³ ≡ q is solvable.

744 is the natural number following 743 and preceding 745.

The square root of 5 is the positive real number that, when multiplied by itself, gives the prime number 5. It is more precisely called the principal square root of 5, to distinguish it from the negative number with the same property. This number appears in the fractional expression for the golden ratio. It can be denoted in surd form as:

In number theory, a cyclotomic field is a number field obtained by adjoining a complex root of unity to $Q$ , the field of rational numbers.

In number theory, Chebyshev's bias is the phenomenon that most of the time, there are more primes of the form 4k + 3 than of the form 4k + 1, up to the same limit. This phenomenon was first observed by Russian mathematician Pafnuty Chebyshev in 1853.

References

↑ "Fibonacci Prime".
1 2 PRP Top Records, Search for : F(n). Retrieved 2018-04-05.
↑ Sloane's OEIS: A005478 , OEIS: A001605
↑ "The Top Twenty: Fibonacci Number". primes.utm.edu. Retrieved 15 September 2023.
↑ N. MacKinnon, Problem 10844, Amer. Math. Monthly 109, (2002), p. 78
↑ Paulo Ribenboim, My Numbers, My Friends, Springer-Verlag 2000
↑ Wells 1986, p.65
↑ The mathematical magic of Fibonacci numbers Factors of Fibonacci numbers
↑ Jarden - Recurring sequences, Volume 1, Fibonacci quarterly, by Brother U. Alfred
↑ (sequence A001602 in the OEIS )
↑ John Vinson (1963). "The Relation of the Period Modulo m to the Rank of Apparition of m in the Fibonacci Sequence" (PDF). Fibonacci Quarterly. 1: 37–45.
↑ Steven Vajda. Fibonacci and Lucas Numbers, and the Golden Section: Theory and Applications. Dover Books on Mathematics.
↑ The mathematical magic of Fibonacci numbers Fibonacci Numbers and Primes
↑ Giuseppe Melfi (1995). "A survey on practical numbers" (PDF). Rend. Sem. Mat. Torino. 53: 347–359.

External links

Weisstein, Eric W. "Fibonacci Prime". MathWorld .
R. Knott Fibonacci primes
Caldwell, Chris. Fibonacci number, Fibonacci prime, and Record Fibonacci primes at the Prime Pages
Factorization of the first 300 Fibonacci numbers
Factorization of Fibonacci and Lucas numbers Archived 2016-08-19 at the Wayback Machine
Small parallel Haskell program to find probable Fibonacci primes at haskell.org

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] "Fibonacci Prime".

[prptop-2] 1 2 PRP Top Records, Search for : F(n). Retrieved 2018-04-05.

[3] Sloane's OEIS: A005478 , OEIS: A001605

[4] "The Top Twenty: Fibonacci Number". primes.utm.edu. Retrieved 15 September 2023.

[5] N. MacKinnon, Problem 10844, Amer. Math. Monthly 109, (2002), p. 78

[6] Paulo Ribenboim, My Numbers, My Friends, Springer-Verlag 2000

[7] Wells 1986, p.65

[8] The mathematical magic of Fibonacci numbers Factors of Fibonacci numbers

[9] Jarden - Recurring sequences, Volume 1, Fibonacci quarterly, by Brother U. Alfred

[10] (sequence A001602 in the OEIS )

[11] John Vinson (1963). "The Relation of the Period Modulo m to the Rank of Apparition of m in the Fibonacci Sequence" (PDF). Fibonacci Quarterly. 1: 37–45.

[12] Steven Vajda. Fibonacci and Lucas Numbers, and the Golden Section: Theory and Applications. Dover Books on Mathematics.

[13] The mathematical magic of Fibonacci numbers Fibonacci Numbers and Primes

[14] Giuseppe Melfi (1995). "A survey on practical numbers" (PDF). Rend. Sem. Mat. Torino. 53: 347–359.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

v t e Prime number classes
By formula	Fermat ( $2 2 n + 1$ ) Mersenne ( $2 p - 1$ ) Double Mersenne ( $2 2 p -1 - 1$ ) Wagstaff $(2 p + 1)/3$ Proth ( $k \cdot2 n + 1$ ) Factorial ( $n! \pm 1$ ) Primorial ( $p n # \pm 1$ ) Euclid ( $p n # + 1$ ) Pythagorean ( $4 n + 1$ ) Pierpont ( $2 m \cdot3 n + 1$ ) Quartan ( $x 4 + y 4$ ) Solinas ( $2 m \pm 2 n \pm 1$ ) Cullen ( $n \cdot2 n + 1$ ) Woodall ( $n \cdot2 n - 1$ ) Cuban ( $x 3 - y 3)/(x - y$ ) Leyland ( $x y + y x$ ) Thabit ( $3\cdot2 n - 1$ ) Williams ( $(b -1)\cdot b n - 1$ ) Mills ( $⌊ A 3 n ⌋$ )
By integer sequence	Fibonacci Lucas Pell Newman–Shanks–Williams Perrin Partitions Bell Motzkin
By property	Wieferich (pair) Wall–Sun–Sun Wolstenholme Wilson Lucky Fortunate Ramanujan Pillai Regular Strong Stern Supersingular (elliptic curve) Supersingular (moonshine theory) Good Super Higgs Highly cototient Unique
Base-dependent	Palindromic Emirp Repunit $(10 n - 1)/9$ Permutable Circular Truncatable Minimal Delicate Primeval Full reptend Unique Happy Self Smarandache–Wellin Strobogrammatic Dihedral Tetradic
Patterns	Twin ( $p, p + 2$ ) Bi-twin chain ( $n \pm 1, 2 n \pm 1, 4 n \pm 1, \dots$ ) Triplet ( $p, p + 2 or p + 4, p + 6$ ) Quadruplet ( $p, p + 2, p + 6, p + 8$ ) k-tuple Cousin ( $p, p + 4$ ) Sexy ( $p, p + 6$ ) Chen Sophie Germain/Safe ( $p, 2 p + 1$ ) Cunningham ( $p, 2 p \pm 1, 4 p \pm 3, 8 p \pm 7, ...$ ) Arithmetic progression ( $p + a\cdotn, n = 0, 1, 2, 3, ...$ ) Balanced ( $consecutive p - n, p, p + n$ )
By size	Mega (1,000,000+ digits) Largest known list
Complex numbers	Eisenstein prime Gaussian prime
Composite numbers	Pseudoprime Catalan Elliptic Euler Euler–Jacobi Fermat Frobenius Lucas Somer–Lucas Strong Carmichael number Almost prime Semiprime Sphenic number Interprime Pernicious
Related topics	Probable prime Industrial-grade prime Illegal prime Formula for primes Prime gap
First 60 primes	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 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281
List of prime numbers