OurBigBook About$ Donate
 Sign in Sign up

Excess prime-factor multiplicity (Ω(n)−ω(n))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Arithmetic function Total number of prime factors
2026-10-06  0 By others on same topic  0 Discussions Create my own version
The nonnegative arithmetic function Ω(n)−ω(n) counts the repeated occurrences beyond the first of each prime factor. Its expectation under uniform sampling from [N] is bounded by ∑p​1/(p(p−1))≤1, independently of N.

 Ancestors (6)

  1. Total number of prime factors
  2. Arithmetic function
  3. Number theory
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 124 / 1 / 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