# Proth prime

(Redirected from Proth number)
Named after François Proth 1878 Proth, Francois Over 1.5 billion below 270 Infinite Proth numbers, prime numbers k × 2n + 1 3, 5, 13, 17, 41, 97, 113 10223 × 231172165 + 1 (as of December 2019) A080076Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m ≥ 1

A Proth number is a natural number N of the form $N=k\times 2^{n}+1$ where k and n are positive integers, k is odd and $2^{n}>k$ . A Proth prime is a Proth number that is prime. They are named after the French mathematician François Proth. The first few Proth primes are

3, 5, 13, 17, 41, 97, 113, 193, 241, 257, 353, 449, 577, 641, 673, 769, 929, 1153, 1217, 1409, 1601, 2113, 2689, 2753, 3137, 3329, 3457, 4481, 4993, 6529, 7297, 7681, 7937, 9473, 9601, 9857 ().

The primality of Proth numbers can be tested more easily than many other numbers of similar magnitude.

## Definition

A Proth number takes the form $N=k2^{n}+1$ where k and n are positive integers, $k$ is odd and $2^{n}>k$ . A Proth prime is a Proth number that is prime.

Without the condition that $2^{n}>k$ , all odd integers larger than 1 would be Proth numbers.

## Primality testing

The primality of a Proth number can be tested with Proth's theorem, which states that a Proth number $p$ is prime if and only if there exists an integer $a$ for which

$a^{\frac {p-1}{2}}\equiv -1{\pmod {p}}.$ This theorem can be used as a probabilistic test of primality, by checking for many random choices of $a$ whether $a^{\frac {p-1}{2}}\equiv -1{\pmod {p}}.$ If this fails to hold for several random $a$ , then it is very likely that the number $p$ is composite.[citation needed] This test is a Las Vegas algorithm: it never returns a false positive but can return a false negative; in other words, it never reports a composite number as "probably prime" but can report a prime number as "possibly composite".

In 2008, Sze created a deterministic algorithm that runs in at most ${\tilde {O}}((k\log k+\log N)(\log N)^{2})$ time, where Õ is the soft-O notation. For typical searches for Proth primes, usually $k$ is either fixed (e.g. 321 Prime Search or Sierpinski Problem) or of order $O(\log N)$ (e.g. Cullen prime search). In these cases algorithm runs in at most ${\tilde {O}}((\log N)^{3})$ , or $O((\log N)^{3+\epsilon })$ time for all $\epsilon >0$ . There is also an algorithm that runs in ${\tilde {O}}((\log N)^{24/7})$ time.

## Large primes

As of 2019, the largest known Proth prime is $10223\times 2^{31172165}+1$ . It is 9,383,761 digits long. It was found by Szabolcs Peter in the PrimeGrid distributed computing project which announced it on 6 November 2016. It is also the largest known non-Mersenne prime.

The project Seventeen or Bust, searching for Proth primes with a certain $t$ to prove that 78557 is the smallest Sierpinski number (Sierpinski problem), has found 11 large Proth primes by 2007, of which 5 are megaprimes. Similar resolutions to the prime Sierpiński problem and extended Sierpiński problem have yielded several more numbers.

Since divisors of Fermat numbers $F_{n}=2^{2^{n}}+1$ are always of the form $k\times 2^{n+2}+1$ , it is customary to determine if a new Proth prime divides a Fermat number.

As of December 2019, PrimeGrid is the leading computing project for searching for Proth primes. Its main projects include:

• general Proth prime search
• 321 Prime Search (searching for primes of the form $3\times 2^{n}+1$ , also called Thabit primes of the second kind)
• 27121 Prime Search (searching for primes of the form $27\times 2^{n}+1$ and $121\times 2^{n}+1$ )
• Cullen prime search (searching for primes of the form $n\times 2^{n}+1$ )
• Sierpinski problem (and their prime and extended generalizations) – searching for primes of the form $k\times 2^{n}+1$ where k is in this list:

k ∈ {21181, 22699, 24737, 55459, 67607, 79309, 79817, 91549, 99739, 131179, 152267, 156511, 163187, 200749, 202705, 209611, 222113, 225931, 227723, 229673, 237019, 238411}

As of December 2019, the largest Proth primes discovered are:

rank prime digits when Comments Discoverer (Project) References
1 10223 × 231172165 + 1 9383761 31 Oct 2016 Szabolcs Péter (Sierpinski Problem) 
2 168451 × 219375200 + 1 5832522 17 Sep 2017 Ben Maloney (Prime Sierpinski Problem) 
3 7 × 218233956 + 1 5488969 1 Oct 2020 Divides Fermat F18233954 Ryan Propper (LLR) 
4 3 × 216408818 + 1 4939547 28 Oct 2020 Divides generalized Fermat F16408814(3) and F16408817(5) James Brown (PrimeGrid) 
5 (27658613 + 1) × 27658614 + 1 4610945 31 Jul 2020 Gaussian Mersenne norm Ryan Propper and Serge Batalov 
6 99739 × 214019102 + 1 4220176 24 Dec 2019 Brian Niegocki (Extended Sierpinski) 
7 404849 × 213764867 + 1 4143644 10 Mar 2021 Generalized Cullen with base 131072 Ryan Propper and Serge Batalov 
8 9 × 213334487 + 1 4014082 31 Mar 2020 Divides F13334485(3) Ryan Propper 
9 19249 × 213018586 + 1 3918990 26 Mar 2007 Konstantin Agafonov (Seventeen or Bust) 
10 9 × 212406887 + 1 3734847 29 Mar 2020 Divides F12406885(3) Ryan Propper 
11 27 × 212184319 + 1 3667847 6 Feb 2021 Ryan Propper 
12 9 × 211500843 + 1 3462100 13 Mar 2020 Divides F11500840(12) Ryan Propper 
13 193997 × 211452891 + 1 3447670 3 Apr 2018 Tom Greer (Extended Sierpinski Problem) 
14 9 × 211366286 + 1 3421594 26 Mar 2020 Ryan Propper 
15 9 × 211158963 + 1 3359184 13 Mar 2020 Divides F11158962(5) Ryan Propper 
16 3 × 210829346 + 1 3259959 14 Jan 2014 Divides F10829343(3) and F10829345(5) Sai Yik Tang (321 Prime Search) 
17 9 × 29778263 + 1 2943552 5 Aug 2020 Divides F9778262(7) Ryan Propper 
18 121 × 29584444 + 1 2885208 20 Nov 2020 James Winskill (27121 Prime Search) 
19 11 × 29381365 + 1 2824704 7 Mar 2020 Divides F9381364(6) Ryan Propper 
20 27653 × 29167433 + 1 2759677 8 Jun 2005 Derek Gordon (Seventeen or Bust) 

## Uses

Small Proth primes (less than 10200) have been used in constructing prime ladders, sequences of prime numbers such that each term is "close" (within about 1011) to the previous one. Such ladders have been used to empirically verify prime-related conjectures. For example, Goldbach's weak conjecture was verified in 2008 up to 8.875 × 1030 using prime ladders constructed from Proth primes. (The conjecture was later proved by Harald Helfgott.[better source needed])

Also, Proth primes can optimize den Boer reduction between the Diffie-Hellman problem and the Discrete logarithm problem. The prime number 55 × 2286 + 1 has been used in this way.

As Proth primes have simple binary representations, they have also been used in fast modular reduction without the need for pre-computation, for example by Microsoft.