摘要
Let n be a positive integer satisfying n >1; ω(n) denotes the number of distinct prime factors of n ; σ(n) denotes the sum of the positive divisors of n . If σ(n)=2n then n is said to be a perfect number and if σ(n)=kn(k≥3) then n is said to be a multiply perfect number. In this paper according to Euler theorem and Fermat theorem, we discuss the result of σ(n)=ω(n)n and prove that only n=2 3·3·5, 2 5·3·7, 2 5·3 3·5·7 satisfies σ(n)= ω(n) n(ω(n)≥3). ...
设n为大于 1的正整数 ,ω(n)表示n的不同素因子的个数 ,σ(n)为n的所有正因子之和 .若σ(n) =2n ,则称n为完全数 .若σ(n) =knk≥ 3,则称n为多重完全数 .本文以欧拉定理及费尔马定理为基础讨论了一种特定条件下的多重完全数问题 ,即满足σ(n) =ω(n)·n(ω(n)≥3)的解的情况 ,得到了σ(n) =ω(n)·n(ω(n)≥ 3)的全部解为n =2 3 ·3·5 ,2 5·3·7,2 5·33 ·5·7.
