We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
For a positive integer 
$\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}n$, let 
$\sigma (n)$ denote the sum of the positive divisors of 
$n$. Let 
$d$ be a proper divisor of 
$n$. We call 
$n$ a deficient-perfect number if 
$\sigma (n) = 2n - d$. In this paper, we show that there are no odd deficient-perfect numbers with three distinct prime divisors.
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.
