 |
Möbius Function
The Möbius function is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted . Definition For any positive integer , define as the sum of the primitive th roots of unity. It has values in depending on the factorization of into prime factors: * if is a square-free positive integer with an even number of prime factors. * if is a square-free positive integer with an odd number of prime factors. * if has a squared prime factor. The Möbius function can alternatively be represented as : \mu(n) = \delta_ \lambda(n), where is the Kronecker delta, is the Liouville function, is the numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Rational Function
In mathematics, a rational function is any function that can be defined by a rational fraction, which is an algebraic fraction such that both the numerator and the denominator are polynomials. The coefficients of the polynomials need not be rational numbers; they may be taken in any field ''K''. In this case, one speaks of a rational function and a rational fraction ''over K''. The values of the variables may be taken in any field ''L'' containing ''K''. Then the domain of the function is the set of the values of the variables for which the denominator is not zero, and the codomain is ''L''. The set of rational functions over a field ''K'' is a field, the field of fractions of the ring of the polynomial functions over ''K''. Definitions A function f(x) is called a rational function if and only if it can be written in the form : f(x) = \frac where P\, and Q\, are polynomial functions of x\, and Q\, is not the zero function. The domain of f\, is the set of all va ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Kronecker Delta
In mathematics, the Kronecker delta (named after Leopold Kronecker) is a function of two variables, usually just non-negative integers. The function is 1 if the variables are equal, and 0 otherwise: \delta_ = \begin 0 &\text i \neq j, \\ 1 &\text i=j. \end or with use of Iverson brackets: \delta_ = =j, where the Kronecker delta is a piecewise function of variables and . For example, , whereas . The Kronecker delta appears naturally in many areas of mathematics, physics and engineering, as a means of compactly expressing its definition above. In linear algebra, the identity matrix has entries equal to the Kronecker delta: I_ = \delta_ where and take the values , and the inner product of vectors can be written as \mathbf\cdot\mathbf = \sum_^n a_\delta_b_ = \sum_^n a_ b_. Here the Euclidean vectors are defined as -tuples: \mathbf = (a_1, a_2, \dots, a_n) and \mathbf= (b_1, b_2, ..., b_n) and the last step is obtained by using the values of the Kronecker ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Free Riemann Gas
In mathematical physics, the primon gas or free Riemann gas is a toy model illustrating in a simple way some correspondences between number theory and ideas in quantum field theory and dynamical systems. It is a quantum field theory of a set of non-interacting particles, the primons; it is called a gas or a ''free model'' because the particles are non-interacting. The idea of the primon gas was independently discovered by Donald Spector and Bernard Julia. Later works by Bakas and Bowick and Spector D. Spector, Duality, Partial Supersymmetry, and Arithmetic Number Theory, J. Math. Phys. 39 (1998) pp. 1919–1927 explored the connection of such systems to string theory. The model State space Consider a Hilbert space H with an orthonormal basis of states , p\rangle labelled by the prime numbers ''p''. Second quantization gives a new Hilbert space K, the bosonic Fock space on H, where states describe collections of primes - which we can call primons if we think of them as analogo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Finite Field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod when is a prime number. The ''order'' of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number and every positive integer there are fields of order p^k, all of which are isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. Properties A finite field is a finite set which is a field; this means that multiplication, addition, subtraction and division (excluding division by zero) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Primitive Root Modulo N
In modular arithmetic, a number is a primitive root modulo if every number coprime to is congruent to a power of modulo . That is, is a ''primitive root modulo'' if for every integer coprime to , there is some integer for which ≡ (mod ). Such a value is called the index or discrete logarithm of to the base modulo . So is a ''primitive root modulo'' if and only if is a generator of the multiplicative group of integers modulo . Gauss defined primitive roots in Article 57 of the '' Disquisitiones Arithmeticae'' (1801), where he credited Euler with coining the term. In Article 56 he stated that Lambert and Euler knew of them, but he was the first to rigorously demonstrate that primitive roots exist for a prime . In fact, the ''Disquisitiones'' contains two proofs: The one in Article 54 is a nonconstructive existence proof, while the proof in Article 55 is constructive. Elementary example The number 3 is a primitive root modulo 7 beca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Lambert Series
In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form :S(q)=\sum_^\infty a_n \frac . It can be resumed formally by expanding the denominator: :S(q)=\sum_^\infty a_n \sum_^\infty q^ = \sum_^\infty b_m q^m where the coefficients of the new series are given by the Dirichlet convolution of ''a''''n'' with the constant function 1(''n'') = 1: :b_m = (a*1)(m) = \sum_ a_n. \, This series may be inverted by means of the Möbius inversion formula, and is an example of a Möbius transform. Examples Since this last sum is a typical number-theoretic sum, almost any natural multiplicative function will be exactly summable when used in a Lambert series. Thus, for example, one has :\sum_^\infty q^n \sigma_0(n) = \sum_^\infty \frac where \sigma_0(n)=d(n) is the number of positive divisors of the number ''n''. For the higher order sum-of-divisor functions, one has :\sum_^\infty q^n \sigma_\alpha(n) = \sum_^\infty \frac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Euler's Constant
Euler's constant (sometimes also called the Euler–Mascheroni constant) is a mathematical constant usually denoted by the lowercase Greek letter gamma (). It is defined as the limiting difference between the harmonic series and the natural logarithm, denoted here by \log: :\begin \gamma &= \lim_\left(-\log n + \sum_^n \frac1\right)\\ px&=\int_1^\infty\left(-\frac1x+\frac1\right)\,dx. \end Here, \lfloor x\rfloor represents the floor function. The numerical value of Euler's constant, to 50 decimal places, is: : History The constant first appeared in a 1734 paper by the Swiss mathematician Leonhard Euler, titled ''De Progressionibus harmonicis observationes'' (Eneström Index 43). Euler used the notations and for the constant. In 1790, Italian mathematician Lorenzo Mascheroni used the notations and for the constant. The notation appears nowhere in the writings of either Euler or Mascheroni, and was chosen at a later time perhaps because of the constant's connec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Euler Product
In number theory, an Euler product is an expansion of a Dirichlet series into an infinite product indexed by prime numbers. The original such product was given for the sum of all positive integers raised to a certain power as proven by Leonhard Euler. This series and its continuation to the entire complex plane would later become known as the Riemann zeta function. Definition In general, if is a bounded multiplicative function, then the Dirichlet series :\sum_ \frac\, is equal to :\prod_ P(p, s) \quad \text \operatorname(s) >1 . where the product is taken over prime numbers , and is the sum :\sum_^\infty \frac = 1 + \frac + \frac + \frac + \cdots In fact, if we consider these as formal generating functions, the existence of such a ''formal'' Euler product expansion is a necessary and sufficient condition that be multiplicative: this says exactly that is the product of the whenever factors as the product of the powers of distinct primes . An important special cas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Riemann Zeta Function
The Riemann zeta function or Euler–Riemann zeta function, denoted by the Greek letter ( zeta), is a mathematical function of a complex variable defined as \zeta(s) = \sum_^\infty \frac = \frac + \frac + \frac + \cdots for \operatorname(s) > 1 and its analytic continuation elsewhere. The Riemann zeta function plays a pivotal role in analytic number theory, and has applications in physics, probability theory, and applied statistics. Leonhard Euler first introduced and studied the function over the reals in the first half of the eighteenth century. Bernhard Riemann's 1859 article " On the Number of Primes Less Than a Given Magnitude" extended the Euler definition to a complex variable, proved its meromorphic continuation and functional equation, and established a relation between its zeros and the distribution of prime numbers. This paper also contained the Riemann hypothesis, a conjecture about the distribution of complex zeros of the Riemann zeta function that is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Generating Function
In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series, the ''formal'' power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series; definitions and examples are given below. Every sequence in principle has a generating function of each type (exc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Dirichlet Series
In mathematics, a Dirichlet series is any series of the form \sum_^\infty \frac, where ''s'' is complex, and a_n is a complex sequence. It is a special case of general Dirichlet series. Dirichlet series play a variety of important roles in analytic number theory. The most usually seen definition of the Riemann zeta function is a Dirichlet series, as are the Dirichlet L-functions. It is conjectured that the Selberg class of series obeys the generalized Riemann hypothesis. The series is named in honor of Peter Gustav Lejeune Dirichlet. Combinatorial importance Dirichlet series can be used as generating series for counting weighted sets of objects with respect to a weight which is combined multiplicatively when taking Cartesian products. Suppose that ''A'' is a set with a function ''w'': ''A'' → N assigning a weight to each of the elements of ''A'', and suppose additionally that the fibre over any natural number under that weight is a finite set. (We call such an arrangement (''A'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |