|
Gregory Coefficients
Gregory coefficients , also known as reciprocal logarithmic numbers, Bernoulli numbers of the second kind, or Cauchy numbers of the first kind,Ch. Jordan. ''The Calculus of Finite Differences'' Chelsea Publishing Company, USA, 1947.L. Comtet. ''Advanced combinatorics (2nd Edn.)'' D. Reidel Publishing Company, Boston, USA, 1974. are the rational numbers that occur in the Maclaurin series expansion of the reciprocal logarithm : \begin \frac & = 1+\frac12 z - \fracz^2 + \fracz^3 - \fracz^4 + \fracz^5 - \fracz^6 + \cdots \\ & = 1 + \sum_^\infty G_n z^n\,,\qquad , z, <1\,. \end Gregory coefficients are alternating and decreasing in absolute value. These numbers are named after James Gregory who introduced them in 1670 in the numerical integration context. They were subsequently rediscovered by many mathematicians and often appear in works of modern authors, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Maclaurin Series
Maclaurin or MacLaurin is a surname. Notable people with the surname include: * Colin Maclaurin (1698–1746), Scottish mathematician * Normand MacLaurin (1835–1914), Australian politician and university administrator * Henry Normand MacLaurin (1878–1915), Australian general * Ian MacLaurin, Baron MacLaurin of Knebworth * Richard Cockburn Maclaurin (1870–1920), US physicist and educator See also * Taylor series in mathematics, a special case of which is the ''Maclaurin series'' * Maclaurin (crater), a crater on the Moon * McLaurin (other) * MacLaren (surname) * McLaren (other) McLaren is a Formula One racing team, part of the McLaren Group. McLaren or MacLaren may also refer to: * McLaren (surname) * MacLaren (surname) * Clan MacLaren, a Scottish clan Places * McLaren Flat, South Australia * McLaren Park, New Zeal ... {{surname, Maclaurin Clan MacLaren ... [...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 consid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Number Theory
Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic function, integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics."German original: "Die Mathematik ist die Königin der Wissenschaften, und die Arithmetik ist die Königin der Mathematik." Number theorists study prime numbers as well as the properties of mathematical objects made out of integers (for example, rational numbers) or defined as generalizations of the integers (for example, algebraic integers). Integers can be considered either in themselves or as solutions to equations (Diophantine geometry). Questions in number theory are often best understood through the study of Complex analysis, analytical objects (for example, the Riemann zeta function) that encode properties of the integers, primes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integer Sequences
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 ''n''th term, or ''implicitly'' by giving a relationship between its terms. For example, the sequence 0, 1, 1, 2, 3, 5, 8, 13, ... (the Fibonacci sequence) is formed by starting with 0 and 1 and then adding any two consecutive terms to obtain the next one: an implicit description. The sequence 0, 3, 8, 15, ... is formed according to the formula ''n''2 − 1 for the ''n''th term: an explicit definition. Alternatively, an integer sequence may be defined by a property which members of the sequence possess and other integers do not possess. For example, we can determine whether a given integer is a perfect number, even though we do not have a formula for the ''n''th perfect number. Examples Integer sequences that have their own name include: *Abundant numbers *Baum–Sweet sequence *Bell numbe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stirling Polynomials
In mathematics, the Stirling polynomials are a family of polynomials that generalize important sequences of numbers appearing in combinatorics and analysis, which are closely related to the Stirling numbers, the Bernoulli numbers, and the generalized Bernoulli polynomials. There are multiple variants of the ''Stirling polynomial'' sequence considered below most notably including the Sheffer sequence form of the sequence, S_k(x), defined characteristically through the special form of its exponential generating function, and the ''Stirling (convolution) polynomials'', \sigma_n(x), which also satisfy a characteristic ''ordinary'' generating function and that are of use in generalizing the Stirling numbers (of both kinds) to arbitrary complex-valued inputs. We consider the "''convolution polynomial''" variant of this sequence and its properties second in the last subsection of the article. Still other variants of the Stirling polynomials are studied in the supplementary links to the art ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zeta-function
In mathematics, a zeta function is (usually) a function analogous to the original example, the Riemann zeta function : \zeta(s) = \sum_^\infty \frac 1 . Zeta functions include: * Airy zeta function, related to the zeros of the Airy function * Arakawa–Kaneko zeta function * Arithmetic zeta function * Artin–Mazur zeta function of a dynamical system * Barnes zeta function or double zeta function * Beurling zeta function of Beurling generalized primes * Dedekind zeta function of a number field * Duursma zeta function of error-correcting codes * Epstein zeta function of a quadratic form * Goss zeta function of a function field * Hasse–Weil zeta function of a variety * Height zeta function of a variety * Hurwitz zeta function, a generalization of the Riemann zeta function * Igusa zeta function * Ihara zeta function of a graph * ''L''-function, a "twisted" zeta function * Lefschetz zeta function of a morphism * Lerch zeta function, a generalization of the Riemann zeta fun ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bernoulli Polynomials Of The Second Kind
The Bernoulli polynomials of the second kind , also known as the Fontana-Bessel polynomials, are the polynomials defined by the following generating function: : \frac= \sum_^\infty z^n \psi_n(x) ,\qquad , z, -1 and :\gamma=\sum_^\infty\frac\Big\, \quad a>-1 where is Euler's constant. Furthermore, we also have : \Psi(v)= \frac\left\,\qquad \Re(v)>-a, where is the gamma function. The Hurwitz and Riemann zeta functions may be expanded into these polynomials as follows : \zeta(s,v)= \frac + \sum_^\infty (-1)^n \psi_(a) \sum_^ (-1)^k \binom (k+v)^ and : \zeta(s)= \frac + \sum_^\infty (-1)^n \psi_(a) \sum_^ (-1)^k \binom (k+1)^ and also : \zeta(s) =1 + \frac + \sum_^\infty (-1)^n \psi_(a) \sum_^ (-1)^k \binom (k+2)^ The Bernoulli polynomials of the second kind are also involved in the following relationship : \big(v+a-\tfrac\big)\zeta(s,v) = -\frac + \zeta(s-1,v) + \sum_^\infty (-1)^n \psi_(a) \sum_^ (-1)^k \binom (k+v)^ between the zeta functions, as w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bernoulli Numbers
In mathematics, the Bernoulli numbers are a sequence of rational numbers which occur frequently in analysis. The Bernoulli numbers appear in (and can be defined by) the Taylor series expansions of the tangent and hyperbolic tangent functions, in Faulhaber's formula for the sum of ''m''-th powers of the first ''n'' positive integers, in the Euler–Maclaurin formula, and in expressions for certain values of the Riemann zeta function. The values of the first 20 Bernoulli numbers are given in the adjacent table. Two conventions are used in the literature, denoted here by B^_n and B^_n; they differ only for , where B^_1=-1/2 and B^_1=+1/2. For every odd , . For every even , is negative if is divisible by 4 and positive otherwise. The Bernoulli numbers are special values of the Bernoulli polynomials B_n(x), with B^_n=B_n(0) and B^+_n=B_n(1). The Bernoulli numbers were discovered around the same time by the Swiss mathematician Jacob Bernoulli, after whom they are named, and inde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stieltjes Constants
In mathematics, the Stieltjes constants are the numbers \gamma_k that occur in the Laurent series expansion of the Riemann zeta function: :\zeta(s)=\frac+\sum_^\infty \frac \gamma_n (s-1)^n. The constant \gamma_0 = \gamma = 0.577\dots is known as the Euler–Mascheroni constant. Representations The Stieltjes constants are given by the limit (mathematics), limit : \gamma_n = \lim_ \left\ = \lim_ . (In the case ''n'' = 0, the first summand requires evaluation of 0^0, 00, which is taken to be 1.) Cauchy's integral formula, Cauchy's differentiation formula leads to the integral representation :\gamma_n = \frac \int_0^ e^ \zeta\left(e^+1\right) dx. Various representations in terms of integrals and infinite series are given in works of Johan Jensen (mathematician), Jensen, Franel, Hermite, G. H. Hardy, Hardy, Ramanujan, Ainsworth, Howell, Coppo, Connon, Coffey, Choi, Blagouchine and some other authors. In particular, Jensen-Franel's integral formula, often erroneously attri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polygamma Function
In mathematics, the polygamma function of order is a meromorphic function on the complex numbers \mathbb defined as the th derivative of the logarithm of the gamma function: :\psi^(z) := \frac \psi(z) = \frac \ln\Gamma(z). Thus :\psi^(z) = \psi(z) = \frac holds where is the digamma function and is the gamma function. They are holomorphic on \mathbb \backslash\mathbb_. At all the nonpositive integers these polygamma functions have a pole of order . The function is sometimes called the trigamma function. Integral representation When and , the polygamma function equals :\begin \psi^(z) &= (-1)^\int_0^\infty \frac\,\mathrmt \\ &= -\int_0^1 \frac(\ln t)^m\,\mathrmt\\ &= (-1)^m!\zeta(m+1,z) \end where \zeta(s,q) is the Hurwitz zeta function. This expresses the polygamma function as the Laplace transform of . It follows from Bernstein's theorem on monotone functions that, for and real and non-negative, is a completely monotone function. Setting in the above formula ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gamma Function
In mathematics, the gamma function (represented by , the capital letter gamma from the Greek alphabet) is one commonly used extension of the factorial function to complex numbers. The gamma function is defined for all complex numbers except the non-positive integers. For every positive integer , \Gamma(n) = (n-1)!\,. Derived by Daniel Bernoulli, for complex numbers with a positive real part, the gamma function is defined via a convergent improper integral: \Gamma(z) = \int_0^\infty t^ e^\,dt, \ \qquad \Re(z) > 0\,. The gamma function then is defined as the analytic continuation of this integral function to a meromorphic function that is holomorphic in the whole complex plane except zero and the negative integers, where the function has simple poles. The gamma function has no zeroes, so the reciprocal gamma function is an entire function. In fact, the gamma function corresponds to the Mellin transform of the negative exponential function: \Gamma(z) = \mathcal M \ (z ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binomial Coefficient
In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom. It is the coefficient of the term in the polynomial expansion of the binomial power ; this coefficient can be computed by the multiplicative formula :\binom nk = \frac, which using factorial notation can be compactly expressed as :\binom = \frac. For example, the fourth power of is :\begin (1 + x)^4 &= \tbinom x^0 + \tbinom x^1 + \tbinom x^2 + \tbinom x^3 + \tbinom x^4 \\ &= 1 + 4x + 6 x^2 + 4x^3 + x^4, \end and the binomial coefficient \tbinom =\tfrac = \tfrac = 6 is the coefficient of the term. Arranging the numbers \tbinom, \tbinom, \ldots, \tbinom in successive rows for n=0,1,2,\ldots gives a triangular array called Pascal's triangle, satisfying the recurrence relation :\binom = \binom + \binom. The binomial coefficients occur in many areas of mathematics, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
