Difference between revisions 63609746 and 63976377 on enwiki

< previous diff
next diff >
Euler prime
In [[number theory]], '''Euler primes''' or '''symmetric primes''' are [[prime number|prime]]s that are the same distance from a given integer. For example 3 and 13 are both 5 units from the number 8, hence are symmetric primes. All [[twin prime]]s, [[cousin prime]]s, and [[sexy prime]]s are symmetric primes.

(contracted; show full)

The first part of this conjecture is trivially true, it is the last sentence which has yet to be proven/disproven.

Clearly the lower bound of ''n'' should be increased if one were to insist that symmetric primes be distinct, ie, have a minimal distance of 1 (''q'' - ''n'' = ''n'' - ''p'' 
=&ge; 1) — a judgement call which we leave to the reader.

== Mapping symmetric primes to a given natural number ==

 To be written!

==See also==
* [[Prime number]]
* [[Twin primes]]
* [[Cousin prime]]
* [[Sexy prime]]

{{num-stub}}
[[Category:Prime numbers]]
[[fr:Nombre premier d'Euler]]
[[zh:&#27431;&#25289;&#32032;&#25968;]]