Supersingular prime (moonshine theory) 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. The non-supersingular primes are 37, 43, 53, 61, 67, and any prime number greater than or equal to 73. All supersingular primes are Chen primes, but 37, 53, and 67 are also Chen primes, and
Prime number and the RSA cryptosystem were invented, using prime numbers as their basis. The increased practical importance of computerized primality testing and factorization led to the development of improved methods capable of handling large numbers of unrestricted form. The mathematical theory of prime numbers also moved forward with the Green–Tao theorem (2004) on long arithmetic progressions of prime numbers, and Yitang Zhang's 2013 proof that there exist infinitely many prime gaps of bounded size. Most early Greeks did not even consider 1 to be a number, so they could not consider its primality. A few mathematicians from this time also considered