Concept

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 average order of is if as tends to infinity. It is conventional to choose an approximating function that is continuous and monotone. But even so an average order is of course not unique. In cases where the limit exists, it is said that has a mean value (average value) . An average order of d(n), the number of divisors of n, is log n; An average order of σ(n), the sum of divisors of n, is nπ26; An average order of φ(n), Euler's totient function of n, is 6nπ2; An average order of r(n), the number of ways of expressing n as a sum of two squares, is π; The average order of representations of a natural number as a sum of three squares is 4πn3; The average number of decompositions of a natural number into a sum of one or more consecutive prime numbers is n log2; An average order of ω(n), the number of distinct prime factors of n, is loglog n; An average order of Ω(n), the number of prime factors of n, is loglog n; The prime number theorem is equivalent to the statement that the von Mangoldt function Λ(n) has average order 1; An average value of μ(n), the Möbius function, is zero; this is again equivalent to the prime number theorem. In case is of the form for some arithmetic function , one has, Generalized identities of the previous form are found here. This identity often provides a practical way to calculate the mean value in terms of the Riemann zeta function. This is illustrated in the following example. For an integer the set of k-th-power-free integers is We calculate the natural density of these numbers in N, that is, the average value of , denoted by , in terms of the zeta function. The function is multiplicative, and since it is bounded by 1, its Dirichlet series converges absolutely in the half-plane , and there has Euler product By the Möbius inversion formula, we get where stands for the Möbius function.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (1)
MATH-313: Number theory I.b - Analytic number theory
The aim of this course is to present the basic techniques of analytic number theory.
Related lectures (15)
Factored Representations: Planning Efficiency
Explores factored representations for planning, focusing on reducing complexity and improving efficiency through separate feature modeling.
Summation Formulas of Arithmetic Functions
Covers the application of convolution and Dirichlet hyperbola method in arithmetic functions.
Summation Formulas of Arithmetic Functions
Covers the Euler-Maclaurin summation formula and the method of convolution for evaluating arithmetic functions.
Show more
Related publications (8)

Comment on “Origin of water in the Badain Jaran Desert, China: New insight from isotopes” by Wu et al. (2017)

David Andrew Barry, Jiaqi Chen

Precipitation isotope data were used to determine the origin of groundwater in the Badain Jaran Desert (BJD) in the study of Wu et al. (2017). Both precipitation and its isotope composition vary seasonally, so arithmetic averages of precipitation isotope v ...
2018

Towards More Efficient Logic Blocks by Exploiting Biconditional Expansion

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Xifan Tang, Gain Kim

Nowadays, Field Programmable Gate Arrays (FPGA) exploit Look-Up Tables (LUTs) to generate logic functions. A K-input LUT can implement any Boolean functions with K inputs. Thanks to this flexibility, LUTs remained concep ...
2015

Computation Over Gaussian Networks With Orthogonal Components

Michael Christoph Gastpar, Chien-Yi Wang

Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum f ...
Institute of Electrical and Electronics Engineers2014
Show more
Related concepts (8)
Prime omega function
In number theory, the prime omega functions and count the number of prime factors of a natural number Thereby (little omega) counts each distinct prime factor, whereas the related function (big omega) counts the total number of prime factors of honoring their multiplicity (see arithmetic function). That is, if we have a prime factorization of of the form for distinct primes (), then the respective prime omega functions are given by and . These prime factor counting functions have many important number theoretic relations.
Divisor function
In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer (including 1 and the number itself). It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum.
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 numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n". An example of an arithmetic function is the divisor function whose value at a positive integer n is equal to the number of divisors of n.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.