2000 character limit reached
On Exactly $3$-Deficient-Perfect Numbers
Published 20 Jan 2020 in math.NT | (2001.06953v1)
Abstract: Let $n$ and $k$ be positive integers and $\sigma(n)$ the sum of all positive divisors of $n$. We call $n$ an exactly $k$-deficient-perfect number with deficient divisors $d_1, d_2, \ldots, d_k$ if $d_1, d_2, \ldots, d_k$ are distinct proper divisors of $n$ and $\sigma (n)=2n-(d_1+d_2+\ldots + d_k)$. In this article, we show that the only odd exactly $3$-deficient-perfect number with at most two distinct prime factors is $1521=32 \cdot 132$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.