Prime quadruplet

Summary

In number theory, a prime quadruplet (sometimes called prime quadruple) is a set of four prime numbers of the form {p,\ p+2,\ p+6,\ p+8}. This represents the closest possible grouping of four primes larger than 3, and is the only prime constellation of length 4. The first eight prime quadruplets are: {5, 7, 11, 13}, {11, 13, 17, 19}, {101, 103, 107, 109}, {191, 193, 197, 199}, {821, 823, 827, 829}, {1481, 1483, 1487, 1489}, {1871, 1873, 1877, 1879}, {2081, 2083, 2087, 2089} All prime quadruplets except {5, 7, 11, 13} are of the form {30n + 11, 30n + 13, 30n + 17, 30n + 19} for some integer n. (This structure is necessary to ensure that none of the four primes are divisible by 2, 3 or 5). A prime quadruplet of this form is also called a prime decade. A prime quadruplet can be described as a consecutive pair of twin primes, two overlapping sets of prime triplets, or two intermixed pairs of sexy primes. It is not known if there are infinitely many prime quadruplets. A proof that there are infinitely many would imply the twin prime conjecture, but it is consistent with current knowledge that there may be infinitely many pairs of twin primes and only finitely many prime quadruplets. The number of prime quadruplets with n digits in base 10 for n = 2, 3, 4, ... is 1, 3, 7, 27, 128, 733, 3869, 23620, 152141, 1028789, 7188960, 51672312, 381226246, 2873279651 . the largest known prime quadruplet has 10132 digits. It starts with p = 667674063382677 × 233608 − 1, found by Peter Kaiser. The constant representing the sum of the reciprocals of all prime quadruplets, Brun's constant for prime quadruplets, denoted by B4, is the sum of the reciprocals of all prime quadruplets: with value: B4 = 0.87058 83800 ± 0.00000 00005. This constant should not be confused with the Brun's constant for cousin primes, prime pairs of the form (p, p + 4), which is also written as B4. The prime quadruplet {11, 13, 17, 19} is alleged to appear on the Ishango bone although this is disputed.

Official source

https://en.wikipedia.org/wiki/Prime_quadruplet

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (31)

At the prime 2, Behrens, Hill, Hopkins and Mahowald showed that M-2 (1, 4) admits a 32-periodic v(2)-self-map. More recently, in joint work with Mahowald, we showed that A(1) also admits a 32-periodic v(2)-self-map. This leads to the question of whether th ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

We consider two problems regarding arithmetic progressions in symmetric sets in the finite field (product space) model. First, we show that a symmetric set S subset of Z(q)(n) containing vertical bar S vertical bar = mu . q(n) elements must contain at leas ...

ELECTRONIC JOURNAL OF COMBINATORICS2020

, , , , ,

Social cognition is dependent on the ability to extract information from human stimuli. Of those, patterns of biological motion (BM) and in particular walking patterns of other humans, are prime examples. Although most often tested in isolation, BM outside ...

2020

Related people (5)

Serge Vaudenay, Mohammad Amin Shokrollahi, Thorsten Kleinjung, Julianne Grainger, Sonia Mihaela Bogos

Related units (2)

Security and Cryptography Laboratory

Psychophysics Laboratory

Related concepts (11)

Prime k-tuple

In number theory, a prime k-tuple is a finite collection of values representing a repeatable pattern of differences between prime numbers. For a k-tuple (a, b, ...), the positions where the k-tuple matches a pattern in the prime numbers are given by the set of integers n such that all of the values (n + a, n + b, ...) are prime. Typically the first value in the k-tuple is 0 and the rest are distinct positive even numbers. Several of the shortest k-tuples are known by other common names: OEIS sequence covers 7-tuples (prime septuplets) and contains an overview of related sequences, e.

Brun's theorem

In number theory, Brun's theorem states that the sum of the reciprocals of the twin primes (pairs of prime numbers which differ by 2) converges to a finite value known as Brun's constant, usually denoted by B2 . Brun's theorem was proved by Viggo Brun in 1919, and it has historical importance in the introduction of sieve methods. The convergence of the sum of reciprocals of twin primes follows from bounds on the density of the sequence of twin primes. Let denote the number of primes p ≤ x for which p + 2 is also prime (i.

Prime triplet

In number theory, a prime triplet is a set of three prime numbers in which the smallest and largest of the three differ by 6. In particular, the sets must have the form (p, p + 2, p + 6) or (p, p + 4, p + 6). With the exceptions of (2, 3, 5) and (3, 5, 7), this is the closest possible grouping of three prime numbers, since one of every three sequential odd numbers is a multiple of three, and hence not prime (except for 3 itself).

Related courses (20)

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how

MATH-521: Advanced analytic number theory

We will present the work of James Maynard (MF 2022) on the existence of bounded gaps between primes

MATH-310: Algebra

This is an introduction to modern algebra: groups, rings and fields.

Related lectures (55)

Periodic Orbits of Hamiltonian Systems

Covers the theory of periodic orbits of Hamiltonian systems and the Conley-Zehnder index.

RSA Cryptography: Primality Testing and Quadratic Residues COM-401: Cryptography and security

Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.

Dimension theory of rings MATH-510: Algebraic geometry II - schemes and sheaves

Covers the dimension theory of rings, including additivity of dimension and height, Krull's Hauptidealsatz, and the height of general complete intersections.