Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors

Peter Hagis, Jr
Mathematics of Computation
Vol. 35, No. 151 (Jul., 1980), pp. 1027-1032
DOI: 10.2307/2006211
Stable URL: http://www.jstor.org/stable/2006211
Page Count: 6
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Add to My Lists
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
Preview not available

Abstract

An argument is outlined which demonstrates that every odd perfect number is divisible by at least eight distinct primes.

Page Thumbnails

  • Thumbnail: Page 
1027
    1027
  • Thumbnail: Page 
1028
    1028
  • Thumbnail: Page 
1029
    1029
  • Thumbnail: Page 
1030
    1030
  • Thumbnail: Page 
1031
    1031
  • Thumbnail: Page 
1032
    1032