|
Gauss's Digamma Theorem
In mathematics, the digamma function is defined as the logarithmic derivative of the gamma function: :\psi(x)=\frac\ln\big(\Gamma(x)\big)=\frac\sim\ln-\frac. It is the first of the polygamma functions. It is strictly increasing and strictly concave on (0,\infty). The digamma function is often denoted as \psi_0(x), \psi^(x) or (the uppercase form of the archaic Greek consonant digamma meaning double-gamma). Relation to harmonic numbers The gamma function obeys the equation :\Gamma(z+1)=z\Gamma(z). \, Taking the derivative with respect to gives: :\Gamma'(z+1)=z\Gamma'(z)+\Gamma(z) \, Dividing by or the equivalent gives: :\frac=\frac+\frac or: :\psi(z+1)=\psi(z)+\frac Since the harmonic numbers are defined for positive integers as :H_n=\sum_^n \frac 1 k, the digamma function is related to them by :\psi(n)=H_-\gamma, where and is the Euler–Mascheroni constant. For half-integer arguments the digamma function takes the values : \psi \left(n+\tfrac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Digamma
Digamma or wau (uppercase: Ϝ, lowercase: ϝ, numeral: ϛ) is an archaic letter of the Greek alphabet. It originally stood for the sound but it has remained in use principally as a Greek numeral for 6. Whereas it was originally called ''waw'' or ''wau'', its most common appellation in classical Greek is ''digamma''; as a numeral, it was called ''episēmon'' during the Byzantine era and is now known as '' stigma'' after the Byzantine ligature combining σ-τ as ϛ. Digamma or wau was part of the original archaic Greek alphabet as initially adopted from Phoenician. Like its model, Phoenician waw, it represented the voiced labial-velar approximant and stood in the 6th position in the alphabet between epsilon and zeta. It is the consonantal doublet of the vowel letter upsilon (), which was also derived from waw but was placed near the end of the Greek alphabet. Digamma or wau is in turn the ancestor of the Latin letter F. As an alphabetic letter, it is attested in archaic a ... [...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] |
Elementary Function
In mathematics, an elementary function is a function of a single variable (typically real or complex) that is defined as taking sums, products, roots and compositions of finitely many polynomial, rational, trigonometric, hyperbolic, and exponential functions, including possibly their inverse functions (e.g., arcsin, log, or ''x''1/''n''). All elementary functions are continuous on their domains. Elementary functions were introduced by Joseph Liouville in a series of papers from 1833 to 1841. An algebraic treatment of elementary functions was started by Joseph Fels Ritt in the 1930s. Examples Basic examples Elementary functions of a single variable include: * Constant functions: 2,\ \pi,\ e, etc. * Rational powers of : x,\ x^2,\ \sqrt\ (x^\frac),\ x^\frac, etc. * more general algebraic functions: f(x) satisfying f(x)^5+f(x)+x=0, which is not expressible through n-th roots or rational powers of alone * Exponential functions: e^x, \ a^x * Logarithms: \ln x, \ \log_a x ... [...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 connect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Number
In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every real number can be almost uniquely represented by an infinite decimal expansion. The real numbers are fundamental in calculus (and more generally in all mathematics), in particular by their role in the classical definitions of limits, continuity and derivatives. The set of real numbers is denoted or \mathbb and is sometimes called "the reals". The adjective ''real'' in this context was introduced in the 17th century by René Descartes to distinguish real numbers, associated with physical reality, from imaginary numbers (such as the square roots of ), which seemed like a theoretical contrivance unrelated to physical reality. The real numbers include the rational numbers, such as the integer and the fraction . The rest of the real number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monotonic Function
In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order theory. In calculus and analysis In calculus, a function f defined on a subset of the real numbers with real values is called ''monotonic'' if and only if it is either entirely non-increasing, or entirely non-decreasing. That is, as per Fig. 1, a function that increases monotonically does not exclusively have to increase, it simply must not decrease. A function is called ''monotonically increasing'' (also ''increasing'' or ''non-decreasing'') if for all x and y such that x \leq y one has f\!\left(x\right) \leq f\!\left(y\right), so f preserves the order (see Figure 1). Likewise, a function is called ''monotonically decreasing'' (also ''decreasing'' or ''non-increasing'') if, whenever x \leq y, then f\!\left(x\right) \geq f\!\left(y\ri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Forward Difference Operator
A finite difference is a mathematical expression of the form . If a finite difference is divided by , one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the numerical solution of differential equations, especially boundary value problems. The difference operator, commonly denoted \Delta is the operator that maps a function to the function \Delta /math> defined by :\Delta x)= f(x+1)-f(x). A difference equation is a functional equation that involves the finite difference operator in the same way as a differential equation involves derivatives. There are many similarities between difference equations and differential equations, specially in the solving methods. Certain recurrence relations can be written as difference equations by replacing iteration notation with finite differences. In numerical analysis, finite differences are widely used for approximating derivatives, and the term "fi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Recurrence Relation
In mathematics, a recurrence relation is an equation according to which the nth term of a sequence of numbers is equal to some combination of the previous terms. Often, only k previous terms of the sequence appear in the equation, for a parameter k that is independent of n; this number k is called the ''order'' of the relation. If the values of the first k numbers in the sequence have been given, the rest of the sequence can be calculated by repeatedly applying the equation. In ''linear recurrences'', the th term is equated to a linear function of the k previous terms. A famous example is the recurrence for the Fibonacci numbers, F_n=F_+F_ where the order k is two and the linear function merely adds the two previous terms. This example is a linear recurrence with constant coefficients, because the coefficients of the linear function (1 and 1) are constants that do not depend on n. For these recurrences, one can express the general term of the sequence as a closed-form expression o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reflection Formula
In mathematics, a reflection formula or reflection relation for a function ''f'' is a relationship between ''f''(''a'' − ''x'') and ''f''(''x''). It is a special case of a functional equation, and it is very common in the literature to use the term "functional equation" when "reflection formula" is meant. Reflection formulas are useful for numerical computation of special functions. In effect, an approximation that has greater accuracy or only converges on one side of a reflection point (typically in the positive half of the complex plane) can be employed for all arguments. Known formulae The even and odd functions satisfy by definition simple reflection relations around ''a'' = 0. For all even functions, :f(-x) = f(x), and for all odd functions, :f(-x) = -f(x). A famous relationship is Euler's reflection formula :\Gamma(z)\Gamma(1-z) = \frac, \qquad z \not\in \mathbb Z for the gamma function \Gamma(z), due to Leonhard Euler. There is also a reflect ... [...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] |
Falling And Rising Factorials
In mathematics, the falling factorial (sometimes called the descending factorial, falling sequential product, or lower factorial) is defined as the polynomial :\begin (x)_n = x^\underline &= \overbrace^ \\ &= \prod_^n(x-k+1) = \prod_^(x-k) \,. \end The rising factorial (sometimes called the Pochhammer function, Pochhammer polynomial, ascending factorial, (A reprint of the 1950 edition by Chelsea Publishing Co.) rising sequential product, or upper factorial) is defined as :\begin x^ = x^\overline &= \overbrace^ \\ &= \prod_^n(x+k-1) = \prod_^(x+k) \,. \end The value of each is taken to be 1 (an empty product) when . These symbols are collectively called factorial powers. The Pochhammer symbol, introduced by Leo August Pochhammer, is the notation , where is a non-negative integer. It may represent ''either'' the rising or the falling factorial, with different articles and authors using different conventions. Pochhammer himself actually used with yet another meaning, namely to d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
