Permutable prime (original) (raw)
Eine permutierbare Primzahl (auch absolute Primzahl) ist eine Primzahl, bei der eine beliebige Neuanordnung ihrer Ziffern ebenfalls eine Primzahl ergibt. Zum Beispiel ist 113 eine permutierbare Primzahl, da 131 und 311 ebenfalls prim sind. Ob diese Bedingung erfüllt ist, hängt dabei auch vom verwendeten Stellenwertsystem ab. Als sich erstmals der Mathematiker Hans-Egon Richert in einem Aufsatz mit diesen Zahlen befasste, nannte er sie permutierbare Primzahlen. Spätere Autoren verwendeten auch den Begriff der absoluten Primzahl.
| Property | Value | ||||||
|---|---|---|---|---|---|---|---|
| dbo:abstract | Eine permutierbare Primzahl (auch absolute Primzahl) ist eine Primzahl, bei der eine beliebige Neuanordnung ihrer Ziffern ebenfalls eine Primzahl ergibt. Zum Beispiel ist 113 eine permutierbare Primzahl, da 131 und 311 ebenfalls prim sind. Ob diese Bedingung erfüllt ist, hängt dabei auch vom verwendeten Stellenwertsystem ab. Als sich erstmals der Mathematiker Hans-Egon Richert in einem Aufsatz mit diesen Zahlen befasste, nannte er sie permutierbare Primzahlen. Spätere Autoren verwendeten auch den Begriff der absoluten Primzahl. (de) Un número primo permutable, también conocido como primo anagramático, es un número primo que, en una base dada, puede cambiar las posiciones de sus dígitos a través de cualquier permutación y seguir siendo un número primo. H. E. Richert, quien posiblemente fue el primero en estudiar estos primos, los llamó primos permutables, pero luego también se les llamó primos absolutos. (es) 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. In base 10, all the permutable primes with fewer than 49,081 digits are known 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, 97, 113, 131, 199, 311, 337, 373, 733, 919, 991, R19 (1111111111111111111), R23, R317, R1031, ... (sequence in the OEIS) Of the above, there are 16 unique permutation sets, with smallest elements 2, 3, 5, 7, R2, 13, 17, 37, 79, 113, 199, 337, R19, R23, R317, R1031, ... (sequence in the OEIS) Note Rn = is a repunit, a number consisting only of n ones (in base 10). Any repunit prime is a permutable prime with the above definition, but some definitions require at least two distinct digits. All permutable primes of two or more digits are composed from the digits 1, 3, 7, 9, because no prime number except 2 is even, and no prime number besides 5 is divisible by 5. It is proven that no permutable prime exists which contains three different of the four digits 1, 3, 7, 9, as well as that there exists no permutable prime composed of two or more of each of two digits selected from 1, 3, 7, 9. There is no n-digit permutable prime for 3 < n < 6·10175 which is not a repunit. It is conjectured that there are no non-repunit permutable primes other than the eighteen listed above. They can be split into seven permutation sets: {13, 31}, {17, 71}, {37, 73}, {79, 97}, {113, 131, 311}, {199, 919, 991}, {337, 373, 733}. In base 2, only repunits can be permutable primes, because any 0 permuted to the ones place results in an even number. Therefore, the base 2 permutable primes are the Mersenne primes. The generalization can safely be made that for any positional number system, permutable primes with more than one digit can only have digits that are coprime with the radix of the number system. One-digit primes, meaning any prime below the radix, are always trivially permutable. In base 12, the smallest elements of the unique permutation sets of the permutable primes with fewer than 9,739 digits are known (using inverted two and three for ten and eleven, respectively) 2, 3, 5, 7, Ɛ, R2, 15, 57, 5Ɛ, R3, 117, 11Ɛ, 555Ɛ, R5, R17, R81, R91, R225, R255, R4ᘔ5, ... There is no n-digit permutable prime in base 12 for 4 < n < 12144 which is not a repunit. It is conjectured that there are no non-repunit permutable primes in base 12 other than those listed above. In base 10 and base 12, every permutable prime is a repunit or a near-repdigit, that is, it is a permutation of the integer P(b, n, x, y) = xxxx...xxxyb (n digits, in base b)where x and y are digits which is coprime to b. Besides, x and y must be also coprime (since if there is a prime p divides both x and y, then p also divides the number), so if x = y, then x = y = 1. (This is not true in all bases, but exceptions are rare and could be finite in any given base; the only exceptions below 109 in bases up to 20 are: 13911, 36A11, 24713, 78A13, 29E19 (M. Fiorentini, 2015).) Let P(b, n, x, y) be a permutable prime in base b and let p be a prime such that n ≥ p. If b is a primitive root of p, and p does not divide x or |x - y | , then n is a multiple of p - 1. (Since b is a primitive root mod p and p does not divide | x − y | , the p numbers xxxx...xxxy, xxxx...xxyx, xxxx...xyxx, ..., xxxx...xyxx...xxxx (only the bp−2 digit is y, others are all x), xxxx...yxxx...xxxx (only the bp−1 digit is y, others are all x), xxxx...xxxx (the repdigit with n xs) mod p are all different. That is, one is 0, another is 1, another is 2, ..., the other is p − 1. Thus, since the first p − 1 numbers are all primes, the last number (the repdigit with n xs) must be divisible by p. Since p does not divide x, so p must divide the repunit with n 1s. Since b is a primitive root mod p, the multiplicative order of n mod p is p − 1. Thus, n must be divisible by p − 1) Thus, if b = 10, the digits coprime to 10 are {1, 3, 7, 9}. Since 10 is a primitive root mod 7, so if n ≥ 7, then either 7 divides x (in this case, x = 7, since x ∈ {1, 3, 7, 9}) or | x − y | (in this case, x = y = 1, since x, y ∈ {1, 3, 7, 9}. That is, the prime is a repunit) or n is a multiple of 7 − 1 = 6. Similarly, since 10 is a primitive root mod 17, so if n ≥ 17, then either 17 divides x (not possible, since x ∈ {1, 3, 7, 9}) or | x − y |
| dbo:wikiPageID | 421593 (xsd:integer) | ||||||
| dbo:wikiPageLength | 8995 (xsd:nonNegativeInteger) | ||||||
| dbo:wikiPageRevisionID | 1107532104 (xsd:integer) | ||||||
| dbo:wikiPageWikiLink | dbr:5_(number) dbr:Primitive_root_modulo_n dbr:Base_10 dbr:Permutation dbr:Repunit dbr:113_(number) dbr:11_(number) dbr:131_(number) dbr:13_(number) dbr:17_(number) dbc:Permutations dbr:Conjecture dbc:Base-dependent_integer_sequences dbr:71_(number) dbr:79_(number) dbr:97_(number) dbr:73_(number) dbr:7_(number) dbr:31_(number) dbr:37_(number) dbr:Duodecimal dbc:Classes_of_prime_numbers dbr:Radix dbr:199_(number) dbr:Prime_number dbr:2_(number) dbr:3_(number) dbr:Coprime dbr:H._E._Richert dbr:Mersenne_prime dbr:Repdigit dbr:Repunit_prime dbr:Positional_number_system | ||||||
| dbp:conNumber | Infinite (en) | ||||||
| dbp:firstTerms | 9223372036854775807 (xsd:decimal) | ||||||
| dbp:largestKnownTerm | /9 (en) | ||||||
| dbp:oeis | A258706 (en) | ||||||
| dbp:oeisName | Absolute primes: every permutation of digits is a prime (en) | ||||||
| dbp:wikiPageUsesTemplate | dbt:OEIS dbt:Pp-semi-indef dbt:Prime_number_classes dbt:Infobox_integer_sequence | ||||||
| dct:subject | dbc:Permutations dbc:Base-dependent_integer_sequences dbc:Classes_of_prime_numbers | ||||||
| rdf:type | yago:WikicatBase-dependentIntegerSequences yago:WikicatClassesOfPrimeNumbers yago:Abstraction100002137 yago:Arrangement107938773 yago:Change107296428 yago:Class107997703 yago:Collection107951464 yago:DefiniteQuantity113576101 yago:Event100029378 yago:Group100031264 yago:Happening107283608 yago:Measure100033615 yago:Number113582013 yago:Ordering108456993 yago:Prime113594005 yago:PrimeNumber113594302 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Sequence108459252 yago:Series108457976 yago:Substitution107443761 yago:Variation107337390 yago:WikicatPermutations yago:WikicatPrimeNumbers | ||||||
| rdfs:comment | Eine permutierbare Primzahl (auch absolute Primzahl) ist eine Primzahl, bei der eine beliebige Neuanordnung ihrer Ziffern ebenfalls eine Primzahl ergibt. Zum Beispiel ist 113 eine permutierbare Primzahl, da 131 und 311 ebenfalls prim sind. Ob diese Bedingung erfüllt ist, hängt dabei auch vom verwendeten Stellenwertsystem ab. Als sich erstmals der Mathematiker Hans-Egon Richert in einem Aufsatz mit diesen Zahlen befasste, nannte er sie permutierbare Primzahlen. Spätere Autoren verwendeten auch den Begriff der absoluten Primzahl. (de) Un número primo permutable, también conocido como primo anagramático, es un número primo que, en una base dada, puede cambiar las posiciones de sus dígitos a través de cualquier permutación y seguir siendo un número primo. H. E. Richert, quien posiblemente fue el primero en estudiar estos primos, los llamó primos permutables, pero luego también se les llamó primos absolutos. (es) En arithmétique, un nombre premier permutable est un nombre premier qui, dans une base donnée, reste premier après n'importe quelle permutation de ses chiffres. Cette définition a été proposée par Bill Gosper en 2003. (fr) 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. In base 10, all the permutable primes with fewer than 49,081 digits are known 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, 97, 113, 131, 199, 311, 337, 373, 733, 919, 991, R19 (1111111111111111111), R23, R317, R1031, ... (sequence in the OEIS) (en) Un primo permutabile è un numero primo tale che, in una data base di numerazione, qualunque permutazione delle sue cifre formi ancora un numero primo. In base 10, la sequenza dei primi permutabili inizia come segue (sequenza nell'OEIS): 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, 97, 113, 131, 199, 311, 337, 373, 733, 919, 991, R19, R23 Dove Ri indica un repunit di i cifre. Ogni repunit primo è evidentemente un primo permutabile. (it) 재배열 가능 소수 또는 치환 가능 소수는 주어진 진법에서, 그 자릿수를 가능한 여러 가지 순열로 바꾸어도 여전히 소수인 소수 (수론)를 말한다. 이 소수를 처음 연구한 것으로 알려진 는 재배열 가능 소수(또는 순열 소수)라고 이름 지었으나, 나중에는 절대 소수라고도 불렀다.. 또한 자릿수에 2, 4, 6, 8이 있는 소수는 자릿수를 재배열 하면 짝수이고, 5가 있으면 5의 배수가 되므로 재배열 가능 소수가 아니다. 또한 n진법에서 n보다 작아서 한 자리인 소수는 배열하는 방법이 한가 지이 므로 무조건 재배열 가능 소수에 속하며, n진법에서 자리수가 모두 1로 되어있는 단위 반복 소수 역시 배열하는 반법이 한 가지 밖에 없으므로 무조건 재배열 가능 소수가 된다. 10진법에서, 49,081 자릿수 이하의 자릿수에서의 모든 재배열 소수들은 다음과 같다. 여기서 Rn = 이고, 단위 반복 소수의 일종이다. (ko) 置換可能素数（ちかんかのうそすう、英語: permutable prime）は、与えられたにおいて、任意の桁の数字を置換しても素数となる素数のことである。この素数を最初に研究したはこれを"permutable primes"（置換可能素数）と呼んだが、後に"absolute primes"（絶対素数）とも呼ばれた。また、"anagrammatic prime"（アナグラム素数）とも呼ばれる。 基数10においては、49,081桁以下の全ての置換可能素数が判明している。 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, 97, 113, 131, 199, 311, 337, 373, 733, 919, 991, R19 (1111111111111111111), R23, R317, R1031, ... オンライン整数列大辞典の数列 A003459 上記から、置換により同じ数字となるもののうち最小のもの以外を除くと、以下の16個となる。 2, 3, 5, 7, 11, 13, 17, 37, 79, 113, 199, 337, R19, R23, R317, R1031, ... オンライン整数列大辞典の数列 A258706 (ja) 可交換質數（permutable prime）是指一個質數，在特定進制下的各位數字可以任意交換位置，其結果仍為質數。數學家Hans-Egon Richert最早研究這類的質數，命名為可交換質數，不過這類質數也被稱為絕對質數（absolute primes）。 以下是十進制下所有已知的，小於49081位數的可交換質數（OEIS數列）： 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, 97, 113, 131, 199, 311, 337, 373, 733, 919, 991, R19 (1111111111111111111), R23, R317, R1031。 以上有些質數的的數字相同，只是位置不同，例如13和31，若這類由同一質數交換位置所得的質數只用一個作為代表，那麼只有16組可交換質數： 2, 3, 5, 7, R2, 13, 17, 37, 79, 113, 199, 337, R19, R23, R317, R1031. 其中Rn = 是循環單位，是由n個1組成的（十進位）數字。循環單位的質數是可交換質數，不過也有些可交換質數的定義中包括至少有二個不同的數字，此定義下循環單位的質數就不是可交換質數。 對於3 < n < 6·10175的正整數n，不存在n位數且不是循環單位的可交換質數。目前猜想除了上述數字外，不存在其他的可交換質數。 (zh) | ||||||
| rdfs:label | Permutierbare Primzahl (de) Número primo permutable (es) Primo permutabile (it) Nombre premier permutable (fr) 재배열 가능 소수 (ko) 置換可能素数 (ja) Permutable prime (en) 可交换素数 (zh) | ||||||
| owl:sameAs | freebase:Permutable prime yago-res:Permutable prime wikidata:Permutable prime dbpedia-bg:Permutable prime dbpedia-de:Permutable prime dbpedia-es:Permutable prime dbpedia-fr:Permutable prime dbpedia-it:Permutable prime dbpedia-ja:Permutable prime dbpedia-ko:Permutable prime dbpedia-ro:Permutable prime dbpedia-zh:Permutable prime https://global.dbpedia.org/id/4p9KZ | ||||||
| prov:wasDerivedFrom | wikipedia-en:Permutable_prime?oldid=1107532104&ns=0 | ||||||
| foaf:isPrimaryTopicOf | wikipedia-en:Permutable_prime | ||||||
| is dbo:wikiPageRedirects of | dbr:Anagrammatic_prime dbr:Absolute_prime | ||||||
| is dbo:wikiPageWikiLink of | dbr:List_of_integer_sequences dbr:List_of_prime_numbers dbr:Repunit dbr:List_of_permutation_topics dbr:List_of_recreational_number_theory_topics dbr:1000_(number) dbr:113_(number) dbr:131_(number) dbr:17_(number) dbr:163_(number) dbr:Anagrammatic_prime dbr:Emirp dbr:555_(number) dbr:700_(number) dbr:71_(number) dbr:79_(number) dbr:73_(number) dbr:311_(number) dbr:31_(number) dbr:37_(number) dbr:Primeval_number dbr:19_(number) dbr:2000_(number) dbr:Circular_prime dbr:Truncatable_prime dbr:Absolute_prime | ||||||
| is foaf:primaryTopic of | wikipedia-en:Permutable_prime |