TOPICS
Search

Paterson Prime


A Paterson prime is a prime number whose quaternary (base 4) digits, read as a decimal integer, also give a prime number (OEIS A065722; Numberphile 2022). Writing p=sum_(j=0)^(k)d_j4^j, with d_j in {0,1,2,3} and d_k!=0, define

 T(p)=sum_(j=0)^kd_j10^j.

Applied to all nonnegative integers, the digit reinterpretation gives OEIS A007090, indexed from 0. The Paterson condition is that both p and T(p) are prime. The first values are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 37, 43, 47, 53, 61, ... (OEIS A065722).

The first ten prime numbers satisfy the condition, but the property is not universal: 31=133_4 gives T(31)=133=7·19, a composite number. For comparison, 29=131_4 gives the prime number T(29)=131.

Since 10=4  (mod6), the formula gives T(p)=p  (mod6). Consequently, for a prime number p>3, T(p) has neither 2 nor 3 as a divisor. This does not exclude larger prime factors.


See also

Base, Digit, Prime Number, Quaternary

Explore with Wolfram|Alpha

References

Numberphile. "Paterson Primes (with 3Blue1Brown)." Nov. 4, 2022. https://www.youtube.com/watch?v=jhObLT1Lrfo.Sloane, N. J. A. Sequences A007090 and A065722 in "The On-Line Encyclopedia of Integer Sequences."

Cite this as:

Weisstein, Eric W. "Paterson Prime." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PatersonPrime.html

Subject classifications