Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-27T00:51:17.218Z Has data issue: false hasContentIssue false

ON NEAR-PERFECT NUMBERS WITH TWO DISTINCT PRIME FACTORS

Published online by Cambridge University Press:  11 March 2013

XIAO-ZHI REN
Affiliation:
School of Mathematical Sciences and Institute of Mathematics, Nanjing Normal University, Nanjing 210023, PR China
YONG-GAO CHEN*
Affiliation:
School of Mathematical Sciences and Institute of Mathematics, Nanjing Normal University, Nanjing 210023, PR China
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Recently, Pollack and Shevelev [‘On perfect and near-perfect numbers’, J. Number Theory 132 (2012), 3037–3046] introduced the concept of near-perfect numbers. A positive integer $n$ is called near-perfect if it is the sum of all but one of its proper divisors. In this paper, we determine all near-perfect numbers with two distinct prime factors.

Type
Research Article
Copyright
Copyright ©2013 Australian Mathematical Publishing Association Inc. 

References

Crandall, R. and Pomerance, C., Prime Numbers: A Computational Perspective, 2nd edn (Springer, New York, 2005).Google Scholar
Pollack, P. and Shevelev, V., ‘On perfect and near-perfect numbers’, J. Number Theory 132 (2012), 30373046.CrossRefGoogle Scholar
Sloane, N. J., ‘The online encyclopedia of integer sequences’, available at http://oeis.org/.Google Scholar