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.
Journal Article

Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors

Peter Hagis, Jr.
Mathematics of Computation
Vol. 40, No. 161 (Jan., 1983), pp. 399-404
DOI: 10.2307/2007384
Stable URL: http://www.jstor.org/stable/2007384
Page Count: 6

You can always find the topics here!

Topics: Prime numbers, Numbers, Mathematical theorems, Polynomials
Were these topics helpful?
See something inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • 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.
Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors
Preview not available

Abstract

An argument is outlined which demonstrates that every odd perfect number which is not divisible by 3 has at least eleven distinct prime factors.

Page Thumbnails

  • Thumbnail: Page 
399
    399
  • Thumbnail: Page 
400
    400
  • Thumbnail: Page 
401
    401
  • Thumbnail: Page 
402
    402
  • Thumbnail: Page 
403
    403
  • Thumbnail: Page 
404
    404