Department of Mathematics, University of Iowa, Iowa City, Iowa 52242
Abstract:
An odd perfect number, , is shown to have at least nine distinct prime factors. If then must have at least twelve distinct prime divisors. The proof ultimately avoids previous computational results for odd perfect numbers.