number of prime divisors counted with multiplicity - Maple Help

Home : Support : Online Help : Mathematics : Group Theory : Numbers : numtheory/bigomega

numtheory[bigomega] - number of prime divisors counted with multiplicity

 Calling Sequence bigomega(n)

Parameters

 n - integer

Description

 • The function bigomega(n) computes the number of prime divisors of the integer n counted with multiplicity.
 • The command with(numtheory,bigomega) allows the use of the abbreviated form of this command.

Examples

 > $\mathrm{with}\left(\mathrm{numtheory}\right):$
 > $\mathrm{bigomega}\left(1\right)$
 ${0}$ (1)
 > $\mathrm{bigomega}\left(962500\right)$
 ${9}$ (2)