Circular prime

Last updated

Circular prime
19937 cyclic permutations.png
The numbers generated by cyclically permuting the digits of 19937. The first digit is removed and readded at the right side of the remaining string of digits. This process is repeated until the starting number is reached again. Since all intermediate numbers generated by this process are prime, 19937 is a circular prime.
Named after Circle
Publication year2004
Author of publicationDarling, D. J.
No. of known terms27
First terms2, 3, 5, 7, 11, 13, 17, 37, 79, 113, 197, 199
Largest known term(10^270343-1)/9
OEIS index
  • A016114
  • Circular primes (numbers that remain prime under cyclic shifts of digits)

A circular prime is a prime number with the property that the number generated at each intermediate step when cyclically permuting its (base 10) digits will be prime. [1] [2] For example, 1193 is a circular prime, since 1931, 9311 and 3119 all are also prime. [3] A circular prime with at least two digits can only consist of combinations of the digits 1, 3, 7 or 9, because having 0, 2, 4, 6 or 8 as the last digit makes the number divisible by 2, and having 0 or 5 as the last digit makes it divisible by 5. [4] The complete listing of the smallest representative prime from all known cycles of circular primes (The single-digit primes and repunits are the only members of their respective cycles) is 2, 3, 5, 7, R2, 13, 17, 37, 79, 113, 197, 199, 337, 1193, 3779, 11939, 19937, 193939, 199933, R19, R23, R317, R1031, R49081, R86453, R109297, and R270343, where Rn is a repunit prime with n digits. There are no other circular primes up to 1023. [3] A type of prime related to the circular primes are the permutable primes, which are a subset of the circular primes (every permutable prime is also a circular prime, but not necessarily vice versa). [3]

Contents

Other bases

The complete listing of the smallest representative prime from all known cycles of circular primes in base 12 is (using inverted two and three for ten and eleven, respectively)

2, 3, 5, 7, Ɛ, R2, 15, 57, 5Ɛ, R3, 117, 11Ɛ, 175, 1Ɛ7, 157Ɛ, 555Ɛ, R5, 115Ɛ77, R17, R81, R91, R225, R255, R4ᘔ5, R5777, R879Ɛ, R198Ɛ1, R23175, and R311407.

where Rn is a repunit prime in base 12 with n digits. There are no other circular primes in base 12 up to 1212.

In base 2, only Mersenne primes can be circular primes, since any 0 permuted to the one's place results in an even number.

Related Research Articles

The duodecimal system is a positional notation numeral system using twelve as its base. The number twelve is instead written as "10" in duodecimal, whereas the digit string "12" means "1 dozen and 2 units". Similarly, in duodecimal "100" means "1 gross", "1000" means "1 great gross", and "0.1" means "1 twelfth".

In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2n − 1 for some integer n. They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If n is a composite number then so is 2n − 1. Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form Mp = 2p − 1 for some prime p.

In recreational mathematics, a repunit is a number like 11, 111, or 1111 that contains only the digit 1 — a more specific type of repdigit. The term stands for repeated unit and was coined in 1966 by Albert H. Beiler in his book Recreations in the Theory of Numbers.

In recreational mathematics, a repdigit or sometimes monodigit is a natural number composed of repeated instances of the same digit in a positional number system. The word is a portmanteau of repeated and digit. Examples are 11, 666, 4444, and 999999. All repdigits are palindromic numbers and are multiples of repunits. Other well-known repdigits include the repunit primes and in particular the Mersenne primes.

In recreational number theory, a primeval number is a natural number n for which the number of prime numbers which can be obtained by permuting some or all of its digits is larger than the number of primes obtainable in the same way for any smaller natural number. Primeval numbers were first described by Mike Keith.

In mathematics, a Riesel number is an odd natural number k for which is composite for all natural numbers n. In other words, when k is a Riesel number, all members of the following set are composite:

79 (seventy-nine) is the natural number following 78 and preceding 80.

73 (seventy-three) is the natural number following 72 and preceding 74. In English, it is the smallest natural number with twelve letters in its spelled out name.

A permutable prime, also known as anagrammatic prime, is a prime number which, in a given base, can have its digits' positions switched through any permutation and still be a prime number. H. E. Richert, who is supposedly the first to study these primes, called them permutable primes, but later they were also called absolute primes.

300 is the natural number following 299 and preceding 301.

In mathematics, a harshad number in a given number base is an integer that is divisible by the sum of its digits when written in that base. Harshad numbers in base n are also known as n-harshad numbers. Harshad numbers were defined by D. R. Kaprekar, a mathematician from India. The word "harshad" comes from the Sanskrit harṣa (joy) + da (give), meaning joy-giver. The term "Niven number" arose from a paper delivered by Ivan M. Niven at a conference on number theory in 1977.

In number theory, a Wagstaff prime is a prime number of the form

A divisibility rule is a shorthand and useful way of determining whether a given integer is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix, or base, and they are all different, this article presents rules and examples only for decimal, or base 10, numbers. Martin Gardner explained and popularized these rules in his September 1962 "Mathematical Games" column in Scientific American.

100,000 (one hundred thousand) is the natural number following 99,999 and preceding 100,001. In scientific notation, it is written as 105.

In mathematics, the digit sum of a natural number in a given number base is the sum of all its digits. For example, the digit sum of the decimal number would be .

In number theory, a full reptend prime, full repetend prime, proper prime or long prime in base b is an odd prime number p such that the Fermat quotient

In mathematics, a pandigital number is an integer that in a given base has among its significant digits each digit used in the base at least once. For example, 1234567890 is a pandigital number in base 10. The first few pandigital base 10 numbers are given by :

Strobogrammatic number Numeral ambigram

A strobogrammatic number is a number whose numeral is rotationally symmetric, so that it appears the same when rotated 180 degrees. In other words, the numeral looks the same right-side up and upside down. A strobogrammatic prime is a strobogrammatic number that is also a prime number, i.e., a number that is only divisible by one and itself. It is a type of ambigram, words and numbers that retain their meaning when viewed from a different perspective, such as palindromes.

271 is the natural number after 270 and before 272.

References

  1. The Universal Book of Mathematics, Darling, David J., 11 August 2004, p. 70, ISBN   9780471270478 , retrieved 25 July 2010
  2. Prime Numbers—The Most Mysterious Figures in Math, Wells, D., p. 47 (page 28 of the book), retrieved 27 July 2010
  3. 1 2 3 Circular Primes, Patrick De Geest, retrieved 25 July 2010
  4. The mathematics of Oz: mental gymnastics from beyond the edge, Pickover, Clifford A., 2 September 2002, p. 330, ISBN   9780521016780 , retrieved 9 March 2011