determination of abundant numbers with specified prime factors
The formula for sums of factors may be used tofind all abundant numbers with a specified setof prime factors
or that no such numbersexist. To accomplish this, we first do alittle algebraic manipulation to our formula.
Theorem 1.
A number whose factorizationinto prime numbers is is abundant if and only if
Proof.
By definition is abundant, if the sum ofthe proper divisors of is greater than .Using our formula, this is equivalent to the condition
Dividing the -th term in the product onthe left-hand side by the -th term on theright-hand side,
so the condition becomes
∎
Note that each of the terms in the product is bigger than 1.Furthemore, the -th term is bounded by
This means that it is only possible to have an abundantnumber whose prime factors are if
As it turns out, the convers also holds, so we have anice criterion for determining when a set of primenumbers happens to be the set of prime divisors ofan abundant number.
Theorem 2.
A finite set of prime numbers is the set ofprime divisors of an abundant number if and only if
Proof.
As described above, if is a set of prime factorsof an abundant number, then we may bound each termin the inequality of the previous theorem to obtainthe inequality in the current theorem. Assume, thenthat is a finite set of prime numbers whichsatisfies said inequality. Then, by continuity,there must exist a real number suchthat
whenver . Since when , we can, for every ,find an such that
Hence,
so, by the previous theorem, is an abundant number.∎