Supersingular Prime

There are two definitions of the supersingular primes: one group-theoretic, and the other number-theoretic.

Group-theoretically, let Gamma_0(N) be the modular group Gamma0, and let X_0(N) be the compactification (by adding cusps) of Y_0(N)=Gamma_0(N)H, where H is the upper half-plane. Also define w_N to be the Fricke involution defined by the block matrix [[0,-1],[N,0]]. For p a prime, define X_0^+(p)=X_0(p)/(w_p). Then p is a supersingular prime if the genus of X_0^+(p)=0.

The number-theoretic definition involves supersingular elliptic curves defined over the algebraic closure of the finite field F_p. They have their j-invariant in F_p.

Supersingular curves were mentioned by Charlie the math genius in the Season 2 episode "In Plain Sight" of the television crime drama NUMB3RS.

There are exactly 15 supersingular primes: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41, 47, 59, and 71 (OEIS A002267). The supersingular primes are exactly the set of primes that divide the group order of the Monster group.

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.