- Fields of mathematics
- >
- Discrete mathematics
- >
- Number theory
- >
- Arithmetic functions

- Mathematical analysis
- >
- Functions and mappings
- >
- Types of functions
- >
- Arithmetic functions

- Mathematical objects
- >
- Functions and mappings
- >
- Types of functions
- >
- Arithmetic functions

- Mathematical relations
- >
- Functions and mappings
- >
- Types of functions
- >
- Arithmetic functions

- Mathematics
- >
- Fields of mathematics
- >
- Number theory
- >
- Arithmetic functions

Bell series

In mathematics, the Bell series is a formal power series used to study properties of arithmetical functions. Bell series were introduced and developed by Eric Temple Bell. Given an arithmetic function

Landau's function

In mathematics, Landau's function g(n), named after Edmund Landau, is defined for every natural number n to be the largest order of an element of the symmetric group Sn. Equivalently, g(n) is the larg

Average

In ordinary language, an average is a single number taken as representative of a list of numbers, usually the sum of the numbers divided by how many numbers are in the list (the arithmetic mean). For

Divisor summatory function

In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic behaviour of the Riemann zeta function. The

Partition function (number theory)

In number theory, the partition function p(n) represents the number of possible partitions of a non-negative integer n. For instance, p(4) = 5 because the integer 4 has the five partitions 1 + 1 + 1 +

Prime-counting function

In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by π(x) (unrelated to the number π).

Normal order of an arithmetic function

In number theory, a normal order of an arithmetic function is some simpler or better-understood function which "usually" takes the same or closely approximate values. Let f be a function on the natura

Pillai's arithmetical function

In number theory, the gcd-sum function,also called Pillai's arithmetical function, is defined for every by or equivalently where is a divisor of and is Euler's totient function. it also can be written

Aliquot sum

In number theory, the aliquot sum s(n) of a positive integer n is the sum of all proper divisors of n, that is, all divisors of n other than n itself.That is, It can be used to characterize the prime

Möbius inversion formula

In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 183

Totient summatory function

In number theory, the totient summatory function is a summatory function of Euler's totient function defined by: It is the number of coprime integer pairs {p, q}, 1 ≤ p ≤ q ≤ n.

Von Mangoldt function

In mathematics, the von Mangoldt function is an arithmetic function named after German mathematician Hans von Mangoldt. It is an example of an important arithmetic function that is neither multiplicat

Crank of a partition

In number theory, the crank of a partition of an integer is a certain integer associated with the partition. The term was first introduced without a definition by Freeman Dyson in a 1944 paper publish

Aliquot sequence

In mathematics, an aliquot sequence is a sequence of positive integers in which each term is the sum of the proper divisors of the previous term. If the sequence reaches the number 1, it ends, since t

Arithmetic function

In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbe

Gauss circle problem

In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centered at the origin and with radius . This number is approximated by the

Arithmetic derivative

In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a fun

Prime gap

A prime gap is the difference between two successive prime numbers. The n-th prime gap, denoted gn or g(pn) is the difference between the (n + 1)-th and then-th prime numbers, i.e. We have g1 = 1, g2

Additive function

In number theory, an additive function is an arithmetic function f(n) of the positive integer variable n such that whenever a and b are coprime, the function applied to the product ab is the sum of th

Average order of an arithmetic function

In number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average". Let be an arithmetic function. We say that an avera

Divisibility sequence

In mathematics, a divisibility sequence is an integer sequence indexed by positive integers n such that for all m, n. That is, whenever one index is a multiple of another one, then the corresponding t

Extremal orders of an arithmetic function

In mathematics, specifically in number theory, the extremal orders of an arithmetic function are best possible bounds of the given arithmetic function. Specifically, if f(n) is an arithmetic function

Integer sequence

In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified explicitly by giving a formula for its nth term, or implicitly by giving a r

Chebyshev function

In mathematics, the Chebyshev function is either a scalarising function (Tchebycheff function) or one of two related functions. The first Chebyshev function ϑ(x) or θ(x) is given by where denotes the

Sum of squares function

In number theory, the sum of squares function is an arithmetic function that gives the number of representations for a given positive integer n as the sum of k squares, where representations that diff

Dirichlet convolution

In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet.

Rank of a partition

In mathematics, particularly in the fields of number theory and combinatorics, the rank of a partition of a positive integer is a certain integer associated with the partition. In fact at least two di

Mertens function

In number theory, the Mertens function is defined for all positive integers n as where is the Möbius function. The function is named in honour of Franz Mertens. This definition can be extended to posi

© 2023 Useful Links.