OurBigBook About$ Donate
 Sign in Sign up

Log-weighted convolution 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
For f(n)=3ω(n),
f(n)logn≤3(f∗Λ)(n).
(1)
If pa∥n, its contribution to (f∗Λ)(n) is f(n)(a−1+1/3)logp. Since 3(a−1+1/3)≥a, summing over the prime factors proves the bound. Here ∗ is Dirichlet convolution and Λ is the Von Mangoldt function.

 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 (2)

  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 27 / 3 / b / Solution
  • Summatory bound for three to the prime omega

 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