On k-Near Perfect Numbers
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Divisor Function, Mersenne Prime, Fermat Prime, Perfect Number, Near Perfect Number, k-Near Perfect NumberAbstract
A positive integer $n$ is said to be k-near perfect number, if $$\sigma(n)=2n+\sum_{i=1}^{k} d_i$$ where $d_i$'s are proper divisors of $n$ and function $\sigma(n)$ is the sum of all positive divisors of $n$. In this paper we discuss some results concerning with k-near perfect numbers. Near perfect numbers are nothing but 1-Near Perfect Numbers.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.