basically, they proved that if a number is superabundant, the exponent of a larger prime number is never bigger than a smaller prime number during prime decomposition(the process of a composite number become smaller prime numbers). all primes from 0 to formula_4 are also factors of "n". the equation says that a superabundant number has to be an even integer. it also is a multiple of the "k"-th primorial formula_5