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.
On Weird and Pseudoperfect Numbers
S. J. Benkoski and P. Erdös
Mathematics of Computation
Vol. 28, No. 126 (Apr., 1974), pp. 617-623
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2005938
Page Count: 7
You can always find the topics here!Topics: Integers, Numbers, Mathematical problems, Mathematical theorems, Prime numbers
Were these topics helpful?See somethings 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
If $n$ is a positive integer and $\sigma(n)$ denotes the sum of the divisors of $n$, then $n$ is perfect if $\sigma(n) = 2n$, abundant if $\sigma(n) \geqq 2n$ and deficient if $\sigma(n) < 2n. n$ is called pseudoperfect if $n$ is the sum of distinct proper divisors of $n$. If $n$ is abundant but not pseudoperfect, then $n$ is called weird. The smallest weird number is 70. We prove that the density of weird numbers is positive and discuss several related problems and results. A list of all weird numbers not exceeding $10^6$ is given.
Mathematics of Computation © 1974 American Mathematical Society