✦ScienexySCIENCE KNOWLEDGE LIBRARY
concept · SCI-MAT-002-093

Multiplicative and Additive Number-Theoretic Functions

Number-theoretic functions assign numerical values to positive integers and describe their arithmetic properties. Additive functions behave additively over coprime factors, while multiplicative functions behave multiplicatively over coprime factors.

NameExpressionDescription

Multiplicative Function

f(mn) = f(m)f(n), when gcd(m, n) = 1

The defining property of a multiplicative arithmetic function.

Completely Multiplicative Function

f(mn) = f(m)f(n), for all m, n ∈ ℤ⁺

The multiplication identity holds without a coprimality restriction.

Additive Function

f(mn) = f(m) + f(n), when gcd(m, n) = 1

The defining property of an additive arithmetic function.

Prime Factorization

n = p₁^a₁ p₂^a₂ ... pᵣ^aᵣ

The prime factorization used to evaluate many arithmetic functions.

Explanation

A number-theoretic function, also called an arithmetic function, is a function defined on the positive integers, usually with integer, real, or complex values. These functions are used to describe important properties of integers, including their prime factors, divisors, and divisibility structure.

A function f is multiplicative if f(1) = 1 and f(mn) = f(m)f(n) whenever gcd(m, n) = 1. The coprimality condition is essential. A multiplicative function is not necessarily completely multiplicative, because the identity may fail when m and n share a common factor.

An arithmetic function f is additive if f(mn) = f(m) + f(n) whenever gcd(m, n) = 1. This is also known as an additive arithmetic function. The logarithm of a completely multiplicative positive-valued function provides a familiar example of an additive function, because logarithms convert products into sums.

Important multiplicative functions include the divisor-counting function τ(n), the sum-of-divisors function σ(n), Euler's totient function φ(n), and the Möbius function μ(n). An important additive function is the number of distinct prime factors, ω(n), and the total number of prime factors counted with multiplicity, Ω(n). These functions are central to analytic and elementary number theory.

Variables

F

An arithmetic function defined on positive integers.

M, n

Positive integers used as inputs to the function.

P₁, p₂, ..., pᵣ

Distinct prime factors of n.

A₁, a₂, ..., aᵣ

Positive exponents in the prime factorization.

R

The number of distinct prime factors of n.

Example or application

A worked example has not yet been added.

Definition

An arithmetic function is a function defined on positive integers. It is multiplicative if f(1) = 1 and f(mn) = f(m)f(n) for coprime m and n. It is additive if f(mn) = f(m) + f(n) for coprime m and n.

Purpose

The purpose of arithmetic functions is to describe and organize numerical properties of positive integers. Their multiplicative and additive behavior makes it possible to analyze complicated integers through their relatively prime factors and prime factorizations.

Importance

  • Arithmetic functions provide a systematic way to study divisors and prime factors.

  • Multiplicative functions allow many calculations to be reduced to prime-power components.

  • Additive functions describe how certain arithmetic quantities combine across coprime factors.

  • They are essential in divisor-sum identities and Möbius inversion.

  • They provide tools for studying the distribution of prime numbers.

  • They are widely used in elementary and analytic number theory.

Key Concepts

NameDescription

Arithmetic Function

A function whose domain is the set of positive integers.

Multiplicative Function

A function satisfying f(mn) = f(m)f(n) whenever gcd(m, n) = 1, with f(1) = 1.

Completely Multiplicative Function

A function satisfying f(mn) = f(m)f(n) for all positive integers m and n, without requiring coprimality.

Additive Function

A function satisfying f(mn) = f(m) + f(n) whenever gcd(m, n) = 1.

Prime Factorization

The representation of a positive integer as a product of prime powers.

Divisor Function

An arithmetic function that counts or sums positive divisors of an integer.

Characteristics

  • Arithmetic functions are defined on positive integers.

  • A multiplicative function is determined by its values on prime powers.

  • Multiplicativity requires the relevant integers to be coprime.

  • Complete multiplicativity applies to all pairs of positive integers.

  • An additive function converts products of coprime integers into sums of function values.

  • Prime factorization is essential for evaluating many arithmetic functions.

  • The constant function f(n) = 1 is multiplicative but is not additive.

  • The logarithm function on positive integers is additive because log(mn) = log(m) + log(n).

Types

NameDescription

Multiplicative Functions

Arithmetic functions that preserve multiplication for coprime inputs. Examples include φ(n), μ(n), τ(n), and σ(n).

Completely Multiplicative Functions

Functions that preserve multiplication for every pair of positive integers. The identity function f(n) = n is an example.

Additive Functions

Functions that convert products of coprime integers into sums. Examples include ω(n) and Ω(n).

Completely Additive Functions

Functions satisfying f(mn) = f(m) + f(n) for all positive integers m and n. The function Ω(n), which counts prime factors with multiplicity, is completely additive.

Components

NameDescription

Domain

The positive integers on which the arithmetic function is defined.

Function Values

The numerical outputs assigned to each positive integer.

Coprimality Condition

The requirement gcd(m, n) = 1 in ordinary multiplicative and additive identities.

Prime-Power Values

Values of the function on prime powers, which determine a multiplicative function.

Arithmetic Structure

The divisibility and factorization properties described by the function.

Properties

  • A multiplicative function satisfies f(1) = 1.

  • A multiplicative function can be evaluated using its prime-power values.

  • Complete multiplicativity implies ordinary multiplicativity.

  • Ordinary multiplicativity does not necessarily imply complete multiplicativity.

  • An additive function satisfies f(1) = 0 under its standard definition.

  • The logarithm of a completely multiplicative positive-valued function is completely additive.

  • The sum or product of arithmetic functions need not preserve multiplicativity.

  • Dirichlet convolution of two multiplicative functions is also multiplicative.

Examples

TitleProblemSolutionAnswer

Verifying Multiplicativity

Check the multiplicative property of the identity function f(n) = n for m = 3 and n = 4.

Since gcd(3, 4) = 1, the multiplicative property applies. We have f(3 × 4) = f(12) = 12, while f(3)f(4) = 3 × 4 = 12.

The identity function satisfies the multiplicative property for this coprime pair.

Evaluating an Additive Function

Let Ω(n) count the prime factors of n with multiplicity. Find Ω(12).

The prime factorization of 12 is 2² × 3. Counting prime factors with multiplicity gives two factors of 2 and one factor of 3.

Ω(12) = 3.

Distinguishing ω and Ω

Find ω(60) and Ω(60).

The prime factorization is 60 = 2² × 3 × 5. There are three distinct prime factors, but four prime factors when multiplicity is counted.

ω(60) = 3 and Ω(60) = 4.

Applications

  • Calculating the number and sum of divisors.

  • Studying prime factorization and arithmetic structure.

  • Analyzing the distribution of prime numbers.

  • Developing Möbius inversion and Dirichlet convolution.

  • Understanding Euler's totient function.

  • Solving problems in analytic number theory.

  • Building mathematical foundations for advanced arithmetic algorithms.

Prerequisites

  • Positive integers

  • Prime factorization

  • Greatest common divisor

  • Divisibility

  • Basic function notation

Learning Objectives

  • Define an arithmetic function.

  • Distinguish multiplicative and additive functions.

  • Explain the difference between multiplicative and completely multiplicative functions.

  • Test whether a function satisfies a multiplicative or additive property.

  • Evaluate arithmetic functions using prime factorization.

  • Recognize important examples such as φ(n), μ(n), τ(n), ω(n), and Ω(n).

  • Explain why arithmetic functions are important in number theory.

Common Mistakes

  • Assuming multiplicativity applies when the inputs are not coprime.

  • Confusing multiplicative functions with completely multiplicative functions.

  • Confusing additive arithmetic functions with ordinary linear functions.

  • Counting distinct prime factors instead of counting multiplicity when calculating Ω(n).

  • Assuming that every arithmetic function is multiplicative.

  • Ignoring the prime-power structure when evaluating multiplicative functions.

Practice Questions

  • Determine whether f(n) = n is completely multiplicative.

  • Explain the difference between multiplicative and completely multiplicative functions.

  • Find ω(72) and Ω(72).

  • Calculate the value of the divisor-counting function τ(36).

  • Explain why the coprimality condition is necessary in the definition of an ordinary multiplicative function.

  • Give two examples of multiplicative arithmetic functions.

  • Give an example of a completely additive arithmetic function.

Key Takeaway

Additive and multiplicative arithmetic functions describe how numerical properties behave across integer products. They provide an organized framework for studying divisors, prime factors, and advanced number-theoretic identities.

Related Topics

  • Möbius Function

  • Möbius Inversion Formula

  • Dirichlet Convolution

  • Euler's Totient Function

  • Divisor Functions

  • Prime Factorization

  • Analytic Number Theory

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Arithmetic & Number Theory