Metraipolis › archive › dc_15e8781adbbb

Prime omega function — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Prime_omega_function
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T17:23:13.550Z
SHA-256 of the archived text
31219b8f8656cd49ad2221f5bb668c785d48926010ee3595b724a4055a12f6ca
Stable URL of this page
https://metraipolis.com/documento/dc_15e8781adbbb

How to cite

Prime omega function — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Prime_omega_function (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_15e8781adbbb (Metraipolis archive dc_15e8781adbbb, sha256 31219b8f8656cd49ad2221f5bb668c785d48926010ee3595b724a4055a12f6ca)
BibTeX
@misc{dc15e8781adbbb,
  title = {Prime omega function — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Prime_omega_function},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_15e8781adbbb; sha256 31219b8f8656cd49ad2221f5bb668c785d48926010ee3595b724a4055a12f6ca},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Prime_omega_function. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In number theory, the prime omega functions ω ( n ) {\displaystyle \omega (n)} and Ω ( n ) {\displaystyle \Omega (n)} count the number of prime factors of a natural number n {\displaystyle n} . The number of distinct prime factors is assigned to ω ( n ) {\displaystyle \omega (n)} (little omega), while Ω ( n ) {\displaystyle \Omega (n)} (big omega) counts the total number of prime factors with multiplicity (see arithmetic function). That is, if we have a prime factorization of n {\displaystyle n} of the form n = p 1 α 1 p 2 α 2 ⋯ p k α k {\displaystyle n=p_{1}^{\alpha _{1}}p_{2}^{\alpha _{2}}\cdots p_{k}^{\alpha _{k}}} for distinct primes p i {\displaystyle p_{i}} ( 1 ≤ i ≤ k {\displaystyle 1\leq i\leq k} ), then the prime omega functions are given by ω ( n ) = k {\displaystyle \omega (n)=k} and Ω ( n ) = α 1 + α 2 + ⋯ + α k {\displaystyle \Omega (n)=\alpha _{1}+\alpha _{2}+\cdots +\alpha _{k}} . These prime-factor-counting functions have many important number theoretic relations.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Number theory»).
Fonte: Wikipedia in inglese, voce «Prime omega function» — https://en.wikipedia.org/wiki/Prime_omega_function
Wikidata Q55630466 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q55630466
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Prime_omega_function?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378748356, consultata il 2026-10-07T16:54:19.909Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 53007ce1a476887f0fc783b570e2848b32e015fd0bdfc0ad0bfc388bbde3e486