Prime quadruplet 23620, 152141, 1028789, 7188960, 51672312, 381226246, 2873279651 . The constant representing the sum of the reciprocals of all prime quadruplets, Brun's constant for prime quadruplets, denoted by "B", is the sum of the reciprocals of all prime quadruplets: with value: 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 "B". The prime quadruplet {11, 13, 17, 19} is alleged to appear on the Ishango bone although this is disputed. Excluding the first prime quadruplet, the shortest possible distance between two quadruplets {"p",
Prime number is prime. The most basic primality testing routine, trial division, is too slow to be useful for large numbers. One group of modern primality tests is applicable to arbitrary numbers, while more efficient tests are available for numbers of special types. Most primality tests only tell whether their argument is prime or not. Routines that also provide a prime factor of composite arguments (or all of its prime factors) are called factorization algorithms. Prime numbers are also used in computing for checksums, hash tables, and pseudorandom number generators. The most basic method of checking the primality of a given integer