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

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…