Additive function: Difference between revisions

Revision as of 00:10, 19 September 2002

Revision as of 20:22, 19 September 2002

Line 12:

Arithmetic functions which are completely additive are:

* A contraction of the [[logarithm|logarithmic function]] on '''N'''.

* A function Ω(''n''), defined for every ''n'' ≥ 2 of total number of all primes, which devide given positive integer ''n''. We put also Ω(1) = 0. Some values:

::Ω(4) = 2

::Ω(27) = 3

::Ω(144) = Ω(2,000⁴) + Ω(3²) = 4 + 2 = 6

::Ω(2,000) = Ω(2⁴) + Ω(5³) = 4 + 3 = 7

::Ω(2,001) = 3

::Ω(2,002) = 4

Line 29 ⟶ 30:

: ω(''n'') = ∑_''p''|''n'' 1(''n''),

for every positive integer ''n'', where sum runs over all different [[prime number|primes]] that do not devide ''n'' and 1(''n'') is a constant function, defined by 1(''n'') = 1. The ω function tells us how many different primes devide arbitrary positive integer ''n''. Some values (compare with Ω(''n'')):

::ω(4) = 1

::ω(27) = 1

::ω(144) = ω(2⁴) + ω(3^2,000) = 1 + 1 = 2

::ω(2,000) = ω(2⁴) + ω(5³) = 1 + 1 = 2

::ω(2,001) = 3

::ω(2,002) = 4

Line 48 ⟶ 50:

'''Sources:'''

# Janko Bra&#269;i&#269;, ''Kolobar aritmeti&#269;nih funkcij'' (''[[Ring]] of arithmetical functions''), (Obzornik mat, fiz. '''49''' (2002) 4, pp 97 - 108) <font color=darkblue> (MSC (2000) 11A25) </font>