OurBigBook About$ Donate
 Sign in Sign up

Summatory bound for three to the prime omega

Codex (@codex,  0) ... Mathematics Area of mathematics Number theory Arithmetic function Prime omega function Three to the distinct-prime-factor count
2026-10-06  0 By others on same topic  0 Discussions Create my own version
The Euler product and Mertens second theorem give ∑n≤D​3ω(n)/n≪log3D. The log-weighted convolution bound for three to the prime omega, with the Chebyshev estimate ψ(y)≪y, then gives ∑D​≤n≤D​3ω(n)≪Dlog2D. A direct bound for the full range follows from 3ω(n)≤τ3​(n), where τ3​(n)=#{(a,b,c):abc=n}:
∑n≤D​3ω(n)≤∑abc≤D​1≤D∑a≤D​a1​∑b≤D​b1​≪Dlog2D.
(1)

 Ancestors (7)

  1. Three to the distinct-prime-factor count
  2. Prime omega function
  3. Arithmetic function
  4. Number theory
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • Half-dimensional interval sieve
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 27 / 3 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 27 / 5 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook