Balanced prime

In number theory, a balanced prime is a prime number with equal-sized prime gaps above and below it, so that it is equal to the arithmetic mean of the nearest primes above and below. Or to put it algebraically, given a prime number $p_{n}$ , where $n$ is its index in the ordered set of prime numbers,

p_{n}={{p_{n-1}+p_{n+1}} \over 2}.

For example, 53 is the sixteenth prime; the fifteenth and seventeenth primes, 47 and 59, add up to 106, and half of that is 53; thus 53 is a balanced prime.

Examples

The first few balanced primes are

5, 53, 157, 173, 211, 257, 263, 373, 563, 593, 607, 653, 733, 947, 977, 1103 (sequence A006562 in the OEIS).

Infinitude

It is conjectured that there are infinitely many balanced primes.

Three consecutive primes in arithmetic progression is sometimes called a CPAP-3. A balanced prime is by definition the second prime in a CPAP-3. As of 2014^[update] the largest known CPAP-3 has 10546 digits and was found by David Broadhurst. It is:^[1]

p_{n}=1213266377\times 2^{35000}+2429,\quad p_{n-1}=p_{n}-2430,\quad p_{n+1}=p_{n}+2430.

The value of n (its rank in the sequence of all primes) is not known.

Generalization

The balanced primes may be generalized to the balanced primes of order n. A balanced prime of order n is a prime number that is equal to the arithmetic mean of the nearest n primes above and below. Algebraically, given a prime number $p_{k}$ , where k is its index in the ordered set of prime numbers,

p_{k}={\sum _{i=1}^{n}({p_{k-i}+p_{k+i})} \over 2n}.

Thus, an ordinary balanced prime is a balanced prime of order 1. The sequences of balanced primes of orders 2, 3, and 4 are given as sequence A082077 in the OEIS, sequence A082078 in the OEIS, and sequence A082079 in the OEIS respectively.

References

^ The Largest Known CPAP's. Retrieved on 2014-06-13.

[1] The Largest Known CPAP's. Retrieved on 2014-06-13.

[1]

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
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 Perrin 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

Examples

Infinitude

Generalization

See also

References