A Lower Bound for τ(n) for k-Multiperfect Number

2013/09/08 by Keneth Adrian P. Dagal, Dagal, Keneth Adrian
Computer Science · #Computability, Logic, AI Algorithms

paper · pdf · doi:10.48550/arxiv.1309.3527

Abstract

A natural number n is said to be k- multiperfect number if σ(n) = k⋅ n for some integer k>2. In this paper, I will provide a lower bound for τ(n) of any k- multiperfect numbers. The lower bound for τ(n) will help in distinguishing if the number is k-multiperfect or not.

Related

• Odd Multiperfect Numbers
• On the Radical of Multiperfect Numbers and Applications
• On the divisibility of odd perfect numbers by a high power of a prime
• Quasiperfect numbers with the same exponent
• Unitary Multiperfect Numbers in Certain Quadratic Rings