Sums involving the number of distinct prime factors function

Abstract

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by ω(n), where ω(n) is the number of distinct prime factors of n. We then derive general convergence criteria for these series. The approach of this paper is use polynomial theorems to prove several factorization identities for arbitrary complex numbers, then apply these identities with arbitrary primes and values of multiplicative functions evaluated at primes. This allows us to reinterpret sums over arbitrary complex numbers as divisor sums and sums over the natural numbers.

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…