Prime omega function

Number of prime factors of a natural number From Wikipedia, the free encyclopedia

In number theory, the prime omega functions and count the number of prime factors of a natural number The number of distinct prime factors is assigned to (little omega), while (big omega) counts the total number of prime factors with multiplicity (see arithmetic function). That is, if we have a prime factorization of of the form for distinct primes (), then the prime omega functions are given by and . These prime-factor-counting functions have many important number theoretic relations.

Properties and relations

Summarize
Perspective

The function is additive and is completely additive. Little omega has the formula

where notation p|n indicates that the sum is taken over all primes p that divide n, without multiplicity. For example, .

Big omega has the formulas

The notation pα|n indicates that the sum is taken over all prime powers pα that divide n, while pα||n indicates that the sum is taken over all prime powers pα that divide n and such that n / pα is coprime to pα. For example, .

The omegas are related by the inequalities ω(n) Ω(n) and 2ω(n) d(n) 2Ω(n), where d(n) is the divisor-counting function.[1] If Ω(n) = ω(n), then n is squarefree and related to the Möbius function by

If then is a prime power, and if then is prime.

An asymptotic series for the average order of is [2]

where is the Mertens constant and are the Stieltjes constants.

The function is related to divisor sums over the Möbius function and the divisor function, including:[3]

is the number of unitary divisors. OEIS: A034444

The characteristic function of the primes can be expressed by a convolution with the Möbius function:[4]

A partition-related exact identity for is given by [5]

where is the partition function, is the Möbius function, and the triangular sequence is expanded by

in terms of the infinite q-Pochhammer symbol and the restricted partition functions which respectively denote the number of 's in all partitions of into an odd (even) number of distinct parts.[6]

Continuation to the complex plane

Summarize
Perspective

A continuation of has been found, though it is not analytic everywhere.[7] Note that the normalized function is used.

This is closely related to the following partition identity. Consider partitions of the form

where , , and are positive integers, and . The number of partitions is then given by . [8]

Average order and summatory functions

Summarize
Perspective

An average order of both and is . When is prime a lower bound on the value of the function is . Similarly, if is primorial then the function is as large as

on average order. When is a power of 2, then [9]

Asymptotics for the summatory functions over , , and powers of are respectively[10][11]

where is the Mertens constant and the constant is defined by

The sum of number of unitary divisors is

[12] (sequence A064608 in the OEIS)

Other sums relating the two variants of the prime omega functions include [13]

and

Example I: A modified summatory function

In this example we suggest a variant of the summatory functions estimated in the above results for sufficiently large . We then prove an asymptotic formula for the growth of this modified summatory function derived from the asymptotic estimate of provided in the formulas in the main subsection of this article above.[14]

To be completely precise, let the odd-indexed summatory function be defined as

where denotes Iverson bracket. Then we have that

The proof of this result follows by first observing that

and then applying the asymptotic result from Hardy and Wright for the summatory function over , denoted by , in the following form:

Example II: Summatory functions for so-termed factorial moments of ω(n)

The computations expanded in Chapter 22.11 of Hardy and Wright provide asymptotic estimates for the summatory function

by estimating the product of these two component omega functions as

We can similarly calculate asymptotic formulas more generally for the related summatory functions over so-termed factorial moments of the function .

Dirichlet series

Summarize
Perspective

A known Dirichlet series involving and the Riemann zeta function is given by [15]

We can also see that

The function is completely additive, where is strongly additive (additive). Now we can prove a short lemma in the following form which implies exact formulas for the expansions of the Dirichlet series over both and :

Lemma. Suppose that is a strongly additive arithmetic function defined such that its values at prime powers is given by , i.e., for distinct primes and exponents . The Dirichlet series of is expanded by

Proof. We can see that

This implies that

wherever the corresponding series and products are convergent. In the last equation, we have used the Euler product representation of the Riemann zeta function.

The lemma implies that for ,

where is the prime zeta function, where is the -th harmonic number and is the identity for the Dirichlet convolution, .

The distribution of the difference of prime omega functions

Summarize
Perspective

The distribution of the distinct integer values of the differences is regular in comparison with the semi-random properties of the component functions. For , define

These cardinalities have a corresponding sequence of limiting densities such that for

These densities are generated by the prime products

With the absolute constant , the densities satisfy

Compare to the definition of the prime products defined in the last section of [16] in relation to the Erdős–Kac theorem.

See also

Notes

References

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.