|
Formal 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] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...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 (except ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiplicative Function
In number theory, a multiplicative function is an arithmetic function ''f''(''n'') of a positive integer ''n'' with the property that ''f''(1) = 1 and f(ab) = f(a)f(b) whenever ''a'' and ''b'' are coprime. An arithmetic function ''f''(''n'') is said to be completely multiplicative (or totally multiplicative) if ''f''(1) = 1 and ''f''(''ab'') = ''f''(''a'')''f''(''b'') holds ''for all'' positive integers ''a'' and ''b'', even when they are not coprime. Examples Some multiplicative functions are defined to make formulas easier to write: * 1(''n''): the constant function, defined by 1(''n'') = 1 (completely multiplicative) * Id(''n''): identity function, defined by Id(''n'') = ''n'' (completely multiplicative) * Id''k''(''n''): the power functions, defined by Id''k''(''n'') = ''n''''k'' for any complex number ''k'' (completely multiplicative). As special cases we have ** Id0(''n'') = 1(''n'') and ** Id1(''n'') = Id(''n''). * ''ε''(''n''): the function defined by ''ε''(''n'') ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Omega Function
In number theory, the prime omega functions \omega(n) and \Omega(n) count the number of prime factors of a natural number n. Thereby \omega(n) (little omega) counts each ''distinct'' prime factor, whereas the related function \Omega(n) (big omega) counts the ''total'' number of prime factors of n, honoring their multiplicity (see arithmetic function). That is, if we have a prime factorization of n of the form n = p_1^ p_2^ \cdots p_k^ for distinct primes p_i (1 \leq i \leq k), then the respective prime omega functions are given by \omega(n) = k and \Omega(n) = \alpha_1 + \alpha_2 + \cdots + \alpha_k. These prime factor counting functions have many important number theoretic relations. Properties and relations The function \omega(n) is additive and \Omega(n) is completely additive. \omega(n)=\sum_ 1 If p divides n at least once we count it only once, e.g. \omega(12)=\omega(2^2 3)=2. \Omega(n) =\sum_ 1 =\sum_\alpha If p divides n \alpha \geq 1 times then we count the exponent ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 the values of the function applied to ''a'' and ''b'':Erdös, P., and M. Kac. On the Gaussian Law of Errors in the Theory of Additive Functions. Proc Natl Acad Sci USA. 1939 April; 25(4): 206–207online/ref> f(a b) = f(a) + f(b). Completely additive An additive function ''f''(''n'') is said to be completely additive if f(a b) = f(a) + f(b) holds ''for all'' positive integers ''a'' and ''b'', even when they are not coprime. Totally additive is also used in this sense by analogy with totally multiplicative functions. If ''f'' is a completely additive function then ''f''(1) = 0. Every completely additive function is additive, but not vice versa. Examples Examples of arithmetic functions which are completely additive are: * The restriction of the Logarithm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moebius Function
Moebius, Möbius or Mobius may refer to: People * August Ferdinand Möbius (1790–1868), German mathematician and astronomer * Theodor Möbius (1821–1890), German philologist * Karl Möbius (1825–1908), German zoologist and ecologist * Paul Julius Möbius (1853–1907), German neurologist * Dieter Moebius (1944–2015), German/Swiss musician * Mark Mobius (born 1936), emerging markets investments pioneer * Jean Giraud (1938–2012), French comics artist who used the pseudonym Mœbius Fictional characters * Mobius M. Mobius, a character in Marvel Comics * Mobius, also known as the Anti-Monitor, a supervillain in DC Comics Mathematics * Möbius energy, a particular knot energy * Möbius strip, an object with one surface and one edge * Möbius function, an important multiplicative function in number theory and combinatorics ** Möbius transform, transform involving the Möbius function ** Möbius inversion formula, in number theory * Möbius transformation, a particular ration ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Zeta Function
In mathematics, the prime zeta function is an analogue of the Riemann zeta function, studied by . It is defined as the following infinite series, which converges for \Re(s) > 1: :P(s)=\sum_ \frac=\frac+\frac+\frac+\frac+\frac+\cdots. Properties The Euler product for the Riemann zeta function ''ζ''(''s'') implies that : \log\zeta(s)=\sum_ \frac n which by Möbius inversion gives :P(s)=\sum_ \mu(n)\frac n When ''s'' goes to 1, we have P(s)\sim \log\zeta(s)\sim\log\left(\frac \right). This is used in the definition of Dirichlet density. This gives the continuation of ''P''(''s'') to \Re(s) > 0, with an infinite number of logarithmic singularities at points ''s'' where ''ns'' is a pole (only ''ns'' = 1 when ''n'' is a squarefree number greater than or equal to 1), or zero of the Riemann zeta function ''ζ''(.). The line \Re(s) = 0 is a natural boundary as the singularities cluster near all points of this line. If one defines a sequence :a_n=\prod_ \frac=\prod_ \f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Omega Function
In number theory, the prime omega functions \omega(n) and \Omega(n) count the number of prime factors of a natural number n. Thereby \omega(n) (little omega) counts each ''distinct'' prime factor, whereas the related function \Omega(n) (big omega) counts the ''total'' number of prime factors of n, honoring their multiplicity (see arithmetic function). That is, if we have a prime factorization of n of the form n = p_1^ p_2^ \cdots p_k^ for distinct primes p_i (1 \leq i \leq k), then the respective prime omega functions are given by \omega(n) = k and \Omega(n) = \alpha_1 + \alpha_2 + \cdots + \alpha_k. These prime factor counting functions have many important number theoretic relations. Properties and relations The function \omega(n) is additive and \Omega(n) is completely additive. \omega(n)=\sum_ 1 If p divides n at least once we count it only once, e.g. \omega(12)=\omega(2^2 3)=2. \Omega(n) =\sum_ 1 =\sum_\alpha If p divides n \alpha \geq 1 times then we count the exponent ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ramanujan's Sum
In number theory, Ramanujan's sum, usually denoted ''cq''(''n''), is a function of two positive integer variables ''q'' and ''n'' defined by the formula : c_q(n) = \sum_ e^, where (''a'', ''q'') = 1 means that ''a'' only takes on values coprime to ''q''. Srinivasa Ramanujan mentioned the sums in a 1918 paper. In addition to the expansions discussed in this article, Ramanujan's sums are used in the proof of Vinogradov's theorem that every sufficiently large odd number is the sum of three primes. Notation For integers ''a'' and ''b'', a\mid b is read "''a'' divides ''b''" and means that there is an integer ''c'' such that \frac b a = c. Similarly, a\nmid b is read "''a'' does not divide ''b''". The summation symbol :\sum_f(d) means that ''d'' goes through all the positive divisors of ''m'', e.g. :\sum_f(d) = f(1) + f(2) + f(3) + f(4) + f(6) + f(12). (a,\,b) is the greatest common divisor, \phi(n) is Euler's totient function, \mu(n) is the Möbius function, and \zeta(s) is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Liouville Function
The Liouville Lambda function, denoted by λ(''n'') and named after Joseph Liouville, is an important arithmetic function. Its value is +1 if ''n'' is the product of an even number of prime numbers, and −1 if it is the product of an odd number of primes. Explicitly, the fundamental theorem of arithmetic states that any positive integer ''n'' can be represented uniquely as a product of powers of primes: n = p_1^\cdots p_k^ where ''p''1 0 is some absolute limiting constant. Define the related sum : T(n) = \sum_^n \frac. It was open for some time whether ''T''(''n'') ≥ 0 for sufficiently big ''n'' ≥ ''n''0 (this conjecture is occasionally–though incorrectly–attributed to Pál Turán). This was then disproved by , who showed that ''T''(''n'') takes negative values infinitely often. A confirmation of this positivity conjecture would have led to a proof of the Riemann hypothesis, as was shown by Pál Turán. Generalizations More generally, we ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logarithmic Derivative
In mathematics, specifically in calculus and complex analysis, the logarithmic derivative of a function ''f'' is defined by the formula \frac where f' is the derivative of ''f''. Intuitively, this is the infinitesimal relative change in ''f''; that is, the infinitesimal absolute change in ''f,'' namely f', scaled by the current value of ''f.'' When ''f'' is a function ''f''(''x'') of a real variable ''x'', and takes real, strictly positive values, this is equal to the derivative of ln(''f''), or the natural logarithm of ''f''. This follows directly from the chain rule: \frac\ln f(x) = \frac \frac Basic properties Many properties of the real logarithm also apply to the logarithmic derivative, even when the function does ''not'' take values in the positive reals. For example, since the logarithm of a product is the sum of the logarithms of the factors, we have (\log uv)' = (\log u + \log v)' = (\log u)' + (\log v)' . So for positive-real-valued functions, the logarithmic deri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 multiplicative nor additive. Definition The von Mangoldt function, denoted by , is defined as :\Lambda(n) = \begin \log p & \textn=p^k \text p \text k \ge 1, \\ 0 & \text \end The values of for the first nine positive integers (i.e. natural numbers) are :0 , \log 2 , \log 3 , \log 2 , \log 5 , 0 , \log 7 , \log 2 , \log 3, which is related to . Properties The von Mangoldt function satisfies the identityApostol (1976) p.32Tenenbaum (1995) p.30 :\log(n) = \sum_ \Lambda(d). The sum is taken over all integers that divide . This is proved by the fundamental theorem of arithmetic, since the terms that are not powers of primes are equal to . For example, consider the case . Then :\begin \sum_ \Lambda(d) &= \Lambda(1) + \Lambda(2) + \Lambda(3) + \Lambda(4) + \Lambda(6) + \Lambda(12) \\ &= \ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
