Supersingular prime (moonshine theory)

In the mathematical branch of moonshine theory, a supersingular prime is a prime number that divides the order of the Monster group M, which is the largest sporadic simple group. There are precisely fifteen supersingular prime numbers: the first eleven primes (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, and 31), as well as 41, 47, 59, and 71. (sequence A002267 in the OEIS)

The non-supersingular primes are 37, 43, 53, 61, 67, and any prime number greater than or equal to 73.

Supersingular primes are related to the notion of supersingular elliptic curves as follows. For a prime number p, the following are equivalent:

The modular curve X₀⁺(p) = X₀(p) / w_p, where w_p is the Fricke involution of X₀(p), has genus zero.
Every supersingular elliptic curve in characteristic p can be defined over the prime subfield F_p.
The order of the Monster group is divisible by p.

The equivalence is due to Andrew Ogg. More precisely, in 1975 Ogg showed that the primes satisfying the first condition are exactly the 15 supersingular primes listed above and shortly thereafter learned of the (then conjectural) existence of a sporadic simple group having exactly these primes as prime divisors. This strange coincidence was the beginning of the theory of monstrous moonshine.

All supersingular primes are Chen primes, but 37, 53, and 67 are also Chen primes, and there are infinitely many Chen primes greater than 73.

References

Weisstein, Eric W. "Supersingular Prime". MathWorld.
Weisstein, Eric W. "Sporadic group". MathWorld.
Ogg, A. P. (1980). "Modular Functions". In Cooperstein, Bruce; Mason, Geoffrey (eds.). The Santa Cruz Conference on Finite Groups. Held at the University of California, Santa Cruz, Calif., June 25–July 20, 1979. Providence, RI: Amer. Math. Soc. pp. 521–532. ISBN 0-8218-1440-0. MR 0604631.

v t e Prime number classes
By formula	Fermat ( $2 2 n + 1$ ) Mersenne ( $2 p - 1$ ) Double Mersenne ( $2 2 p -1 - 1$ ) Wagstaff $(2 p + 1)/3$ Proth ( $k \cdot2 n + 1$ ) Factorial ( $n! \pm 1$ ) Primorial ( $p n # \pm 1$ ) Euclid ( $p n # + 1$ ) Pythagorean ( $4 n + 1$ ) Pierpont ( $2 m \cdot3 n + 1$ ) Quartan ( $x 4 + y 4$ ) Solinas ( $2 m \pm 2 n \pm 1$ ) Cullen ( $n \cdot2 n + 1$ ) Woodall ( $n \cdot2 n - 1$ ) Cuban ( $x 3 - y 3)/(x - y$ ) Leyland ( $x y + y x$ ) Thabit ( $3\cdot2 n - 1$ ) Williams ( $(b -1)\cdot b n - 1$ ) Mills ( $⌊ A 3 n ⌋$ )
By integer sequence	Fibonacci Lucas Pell Newman–Shanks–Williams Perrin
By property	Wieferich (pair) Wall–Sun–Sun Wolstenholme Wilson Lucky Fortunate Ramanujan Pillai Regular Strong Stern Supersingular (elliptic curve) Supersingular (moonshine theory) Good Super Higgs Highly cototient Unique
Base-dependent	Palindromic Emirp Repunit $(10 n - 1)/9$ Permutable Circular Truncatable Minimal Delicate Primeval Full reptend Unique Happy Self Smarandache–Wellin Strobogrammatic Dihedral Tetradic
Patterns	Twin ( $p, p + 2$ ) Bi-twin chain ( $n \pm 1, 2 n \pm 1, 4 n \pm 1, \dots$ ) Triplet ( $p, p + 2 or p + 4, p + 6$ ) Quadruplet ( $p, p + 2, p + 6, p + 8$ ) k-tuple Cousin ( $p, p + 4$ ) Sexy ( $p, p + 6$ ) Chen Sophie Germain/Safe ( $p, 2 p + 1$ ) Cunningham ( $p, 2 p \pm 1, 4 p \pm 3, 8 p \pm 7, ...$ ) Arithmetic progression ( $p + a\cdotn, n = 0, 1, 2, 3, ...$ ) Balanced ( $consecutive p - n, p, p + n$ )
By size	Mega (1,000,000+ digits) Largest known list
Complex numbers	Eisenstein prime Gaussian prime
Composite numbers	Pseudoprime Catalan Elliptic Euler Euler–Jacobi Fermat Frobenius Lucas Perrin Somer–Lucas Strong Carmichael number Almost prime Semiprime Sphenic number Interprime Pernicious
Related topics	Probable prime Industrial-grade prime Illegal prime Formula for primes Prime gap
First 60 primes	2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281
List of prime numbers

This page was last edited on 8 March 2024, at 23:21

From Wikipedia, the free encyclopedia

See also

References