You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis 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.
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
Published by: American Mathematical Society
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.
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.
Preview not available
An argument is outlined which demonstrates that every odd perfect number which is not divisible by 3 has at least eleven distinct prime factors.
Mathematics of Computation © 1983 American Mathematical Society