Fact-checked by Grok 2 weeks ago

Reciprocal gamma function

The reciprocal gamma function, denoted \frac{1}{\Gamma(z)}, is the multiplicative inverse of the gamma function \Gamma(z), which extends the factorial to complex numbers. As the gamma function is meromorphic with simple poles at non-positive integers but no zeros anywhere in the complex plane, the reciprocal gamma function is an entire function—holomorphic everywhere with no singularities or zeros. First studied by Francis William Newman in , the reciprocal gamma function was recognized early for its analytic simplicity compared to the itself, admitting a Weierstrass representation:
\frac{1}{\Gamma(z)} = z e^{\gamma z} \prod_{n=1}^{\infty} \left(1 + \frac{z}{n}\right) e^{-z/n},
where \gamma is the Euler-Mascheroni constant. This product form highlights its order-one growth and facilitates expansions like the around z = 0, whose coefficients involve multiple zeta values and exhibit asymptotic behaviors useful in . representations further characterize it, such as the real-line form
\frac{1}{\Gamma(z)} = \frac{1}{\pi} \int_{-\infty}^{\infty} e^{i t z} \frac{\sin(\pi t)}{\pi t} \, dt,
valid for \Re(z) > 0 and extendable analytically.
Beyond , the reciprocal gamma function serves as a normalization constant in , appearing in the definitions of the Riemann–Liouville, Caputo, and Grünwald–Letnikov fractional derivatives, where it ensures consistency and aids in computational implementations. Its entire nature and rapid decay properties also make it valuable in , special function theory, and approximations for large arguments.

Introduction and Background

Definition

The reciprocal gamma function is defined as the of the , expressed mathematically as f(z) = \frac{1}{\Gamma(z)}, where \Gamma(z) is the that extends the to complex and real numbers greater than zero. This definition arises naturally as the reciprocal, providing a function whose values at positive integers correspond to the reciprocals of factorials, since \Gamma(n+1) = n! for nonnegative integers n, yielding \frac{1}{\Gamma(n+1)} = \frac{1}{n!}. In standard , the reciprocal gamma function is typically written as $1/\Gamma(z) to emphasize its relation to the , though some specialized contexts, such as representations derived from Euler's formulation of \Gamma(z), explicitly define it this way for analytic purposes. This notation convention facilitates its use in and special function theory, avoiding ambiguity with other functions like the .

Historical Development

The gamma function, serving as an interpolation of the for real and complex numbers, was first introduced by Leonhard Euler in his 1729 letter to , where he proposed an form to extend factorial values beyond integers. This foundational work was advanced by in his 1813 "Disquisitiones generales circa seriem infinitam," which provided a rigorous product representation. The modern notation Γ(z) was established by . The reciprocal gamma function was first studied by Francis William Newman in 1848, who derived its infinite product representation valid over the complex plane. In the mid-19th century, Karl Weierstrass shifted attention to the reciprocal of the gamma function, which he termed the "factorielle" and defined as Fc(u) = 1/Γ(1 + u). Weierstrass employed this function extensively in his lectures around 1856, using its infinite product form to illustrate principles central to the Weierstrass factorization theorem for entire functions. By highlighting the reciprocal gamma's status as an entire function free of zeros, Weierstrass's contributions emphasized its simplicity compared to the gamma function itself, which has poles, thereby facilitating analysis in the complex plane. Early 20th-century developments in further integrated the into studies of , building on Weierstrass's framework to explore order and in theorems, such as those refined by in 1896 and applied to gamma-related problems. This evolution marked a transition from the gamma function's origins in extension to a focused examination of its as a example of an , influencing subsequent work in and function theory.

Analytic Properties

Entire Function Characteristics

The reciprocal gamma function, denoted $1/\Gamma(z), is an on the . This follows from the fact that the \Gamma(z) is meromorphic with simple poles at the non-positive integers z = 0, -1, -2, \dots and has no zeros anywhere in the finite . Consequently, $1/\Gamma(z) has removable singularities at those poles and is holomorphic everywhere, rendering it . As an , $1/\Gamma(z) possesses specific growth properties characteristic of functions in this class. It is of order 1, meaning that the quantity \limsup_{r \to \infty} \frac{\log \log M(r)}{\log r} = 1, where M(r) = \max_{|z|=r} |1/\Gamma(z)| denotes the maximum modulus. Furthermore, within functions of order 1, it attains the maximal type, indicating that its growth exceeds any exponential bound of the form \exp(\tau |z|) for finite \tau > 0 along certain directions, though it remains sub-exponential in others due to the distribution of its zeros. This order and type can be established via of its Taylor coefficients or the Weierstrass product form. In terms of boundedness and behavior at infinity, $1/\Gamma(z) exhibits rapid decay in the right half-plane for large |\operatorname{Im} z| with fixed \operatorname{Re} z > 0, consistent with for \Gamma(z), but grows without bound along rays approaching the negative real axis due to the accumulation of zeros. Overall, as an of order 1, it displays an at , with the maximum growing like \exp(c r \log r) for some c > 0 in the direction of maximal . The analytic structure of $1/\Gamma(z) is closely tied to the Hadamard factorization theorem for entire functions of finite order. Since it is of order 1 (genus 1), the theorem guarantees a canonical product representation incorporating its simple zeros at the non-positive integers, multiplied by an exponential factor to account for the growth: $1/\Gamma(z) = z^m e^{a + b z} \prod_n E_1(z/z_n), where E_1 are the primary factors and the product converges due to the linear density of the zeros. This factorization uniquely determines the function up to constants, highlighting its role as a canonical example of an entire function with prescribed zeros and growth.

Zeros and Relation to Gamma Function

The reciprocal gamma function, denoted f(z) = \frac{1}{\Gamma(z)}, satisfies the direct inverse relation f(z) \Gamma(z) = 1 for all z excluding the non-positive integers, where \Gamma(z) exhibits simple poles. This relation underscores the complementary nature of the two functions: the meromorphic character of \Gamma(z), with poles at z = 0, -1, -2, \dots, is inverted in f(z), transforming those singularities into zeros while rendering f(z) holomorphic everywhere in the . The zeros of f(z) occur precisely at the non-positive integers z = 0, -1, -2, \dots, and each is , mirroring the order of the corresponding poles of \Gamma(z). There are no other zeros in the , as \Gamma(z) has no zeros itself and its poles are isolated at these points alone. This zero structure ensures that f(z) vanishes exactly where \Gamma(z) diverges, providing a clean without additional singularities or null points. The reflection formula for \Gamma(z), given by \Gamma(z) \Gamma(1 - z) = \frac{\pi}{\sin(\pi z)}, adapts directly to the reciprocal as f(z) = \frac{\sin(\pi z)}{\pi} \Gamma(1 - z). This form facilitates meromorphic continuation of gamma-related expressions by leveraging the entire property of f(z) to bypass poles, while the reflection relates values of f(z) across the plane, enabling analytic evaluation in regions near the negative real axis without direct encounter of divergences.

Representations

Infinite Product Expansion

The infinite product expansion of the reciprocal gamma function is given by \frac{1}{\Gamma(z)} = z e^{\gamma z} \prod_{n=1}^\infty \left(1 + \frac{z}{n}\right) e^{-z/n}, where \gamma \approx 0.5772156649 is the Euler-Mascheroni constant. This representation, first derived by F. W. Newman in 1848, establishes that $1/\Gamma(z) is an of exponential type, free of across the . The derivation begins with the Weierstrass canonical product form for the itself, \Gamma(z) = \frac{e^{-\gamma z}}{z} \prod_{n=1}^\infty \left(1 + \frac{z}{n}\right)^{-1} e^{z/n}, which inverts directly to the reciprocal form above; this product arises from Euler's limit expression for \Gamma(z) as \lim_{n \to \infty} \frac{n! \, n^z}{z(z+1)\cdots(z+n)}, incorporating \gamma = \lim_{n \to \infty} \left( \sum_{k=1}^n \frac{1}{k} - \ln n \right) to ensure convergence. formalized this approach in , using the reciprocal gamma (which he termed the "factorielle") as a foundational example in his development of the for entire functions. The product converges uniformly on every compact subset of the complex plane, as the terms \left(1 + \frac{z}{n}\right) e^{-z/n} satisfy the necessary growth conditions for Weierstrass products of genus one, with the exponential factor e^{\gamma z} compensating for the logarithmic divergence of the partial sums; this uniform convergence implies that $1/\Gamma(z) is holomorphic everywhere, confirming its entire nature without singularities. Via the reflection formula \Gamma(z) \Gamma(1-z) = \pi / \sin(\pi z), the product for $1/\Gamma(z) connects to the infinite product for the , \sin(\pi z) = \pi z \prod_{n=1}^\infty \left(1 - \frac{z^2}{n^2}\right), yielding an explicit factorization that links the zeros of sine to the poles of gamma.

Taylor Series Expansion

The Maclaurin series expansion of the reciprocal gamma function around z=0 is \frac{1}{\Gamma(z)} = \sum_{n=1}^{\infty} a_n z^n , where the coefficients a_n are given by a_1 = 1 and a_2 = \gamma, with \gamma the Euler-Mascheroni constant. For n \ge 3, the coefficients can be computed using known relations involving the zeta function. The first few coefficients are a_1 = 1, a_2 = \gamma \approx 0.5772156649, a_3 = \frac{\gamma^2 - \zeta(2)}{2} \approx -0.6558780713, and a_4 \approx 0.0480785628. As an , the reciprocal gamma function has an infinite for this series. The series can be truncated for numerical near z=0; for example, using the first three terms at z=0.1 yields 0.1 + 0.577216 \times 0.01 - 0.655878 \times 0.001 \approx 0.105116, compared to the value \approx 0.105104. An alternative form for the expansion of the shifted reciprocal gamma function 1/\Gamma(1 + z) around z=0, often used in numerical computation, is \frac{1}{\Gamma(1 + z)} = \sum_{n=0}^{\infty} d_n z^n , with d_0 = 1, d_1 = \gamma, d_2 = \frac{\gamma^2 - \zeta(2)}{2}, d_3 = \frac{\gamma^3}{6} - \frac{\gamma \zeta(2)}{2} + \frac{\zeta(3)}{3}, and higher terms obtained from the recursion for the scaled coefficients \rho_k = k! d_k, where \rho_0 = 1 and \rho_{k+1} = \sum_{\nu=0}^k \binom{k+1}{\nu} \rho_\nu (-1)^{k - \nu} \zeta(k - \nu + 1) for k \ge 0. This series also has infinite radius of convergence. For example, at z=0.1, the first three terms give 1 + 0.577216 \times 0.1 + (-0.655878) \times 0.01 \approx 1.05116, compared to the exact value \approx 1.05119.

Asymptotic Expansion

The asymptotic expansion of the reciprocal gamma function $1/\Gamma(z) for large |z| is derived by inverting the asymptotic series for \Gamma(z). This provides a that approximates $1/\Gamma(z) effectively when truncated optimally, particularly useful in sectors of the where \Gamma(z) grows rapidly. The expansion takes the form \frac{1}{\Gamma(z)} \sim \sqrt{\frac{z}{2\pi}} \left( \frac{e}{z} \right)^z \sum_{n=0}^\infty (-1)^n g_n z^{-n}, where the coefficients g_n are the same as those in the series for \Gamma(z), given by g_0 = 1, g_1 = 1/12, g_2 = 1/288, g_3 = -139/51840, and higher terms involving numbers or explicit computations. The leading term \sqrt{z/(2\pi)} (e/z)^z arises directly from the dominant part of for \Gamma(z), with subsequent terms correcting for the subdominant exponential and power behaviors. For instance, including the first few terms yields \frac{1}{\Gamma(z)} \sim \sqrt{\frac{z}{2\pi}} \left( \frac{e}{z} \right)^z \left( 1 - \frac{1}{12z} + \frac{1}{288z^2} + \frac{139}{51840z^3} + \cdots \right). These coefficients alternate in sign due to the series inversion, and explicit values up to high orders (e.g., n=30) have been tabulated for practical use. The expansion is valid as |z| \to \infty in the sector |\arg z| \leq \pi - \delta for any fixed \delta > 0, excluding a small neighborhood of the negative real axis to avoid the poles of \Gamma(z). Error estimates for the remainder after N terms satisfy bounds such as |R_N(z)| \leq (|g_N|/|z|^N + |g_{N+1}|/|z|^{N+1}) \cdot C(\arg z), where C(\arg z) depends on (e.g., involving \csc(2\arg z) for larger ), ensuring the approximation's reliability in the specified sectors. Exponentially improved , incorporating terminant functions, further reduce errors to O(e^{-2\pi |z|} |z|^M) for suitable M. This asymptotic series facilitates high-precision computations of $1/\Gamma(z) for large |z|, especially in numerical algorithms for special functions and quadrature, where direct evaluation of \Gamma(z) may overflow; truncation at the term minimizing the remainder achieves relative errors below machine precision in the valid sectors.

Integral Representations

Contour Integral Representation

The contour integral representation of the reciprocal gamma function is provided by Hankel's formula: \frac{1}{\Gamma(z)} = \frac{1}{2\pi i} \oint_H (-t)^{-z} e^{-t} \, dt, where the integral is taken over the Hankel contour H encircling the negative real axis in the positive (counterclockwise) direction. This form is equivalent to the standard representation \frac{1}{\Gamma(z)} = \frac{1}{2\pi i} \int_{-\infty}^{(0+)} e^{t} t^{-z} \, dt via the substitution t \to -t, preserving convergence due to the exponential decay along the contour arms. The Hankel contour H begins at -\infty along the real axis just above the negative real axis, proceeds toward the origin, encircles the origin once in the counterclockwise direction on a small circle of vanishing radius, and returns to -\infty just below the negative real axis. The branch of the (-t)^{-z} is defined with the principal cut along the negative real axis, ensuring the argument of -t ranges from -\pi to \pi across the contour. This setup avoids the branch point at the origin while capturing the essential behavior for the integral's evaluation. This representation derives from the inverse applied to the , which itself arises as the of e^{-t}. Specifically, deforming the vertical Bromwich contour of the inverse Mellin integral into the Hankel loop yields the closed-form contour expression for $1/\Gamma(z), leveraging the analytic properties of the in the s-plane. The contour integral facilitates of the reciprocal gamma function to the entire , valid for all z \in \mathbb{C} except the poles of \Gamma(z) at non-positive integers, where the integrand's behavior ensures the result is an with zeros precisely at those points. The convergence of the integral for arbitrary z stems from the rapid decay of e^{-t} along the real-axis segments and the vanishing contribution from the small around the as its radius approaches zero.

Real-Line Integral Representations

One prominent real-line integral representation for the reciprocal gamma function arises from deforming the Hankel contour to a vertical line in the , yielding a Fourier-like form along the real parameter t. Specifically, for c > 0 and \operatorname{Re}(z) > 0, \frac{1}{\Gamma(z)} = \frac{1}{2\pi} \int_{-\infty}^{\infty} (c + i t)^{-z} e^{c + i t} \, dt. This representation converges absolutely for \operatorname{Re}(z) > 0 due to the of e^{c + i t} balanced against the branch of (c + i t)^{-z}, and it holds as a when necessary near potential singularities, though the choice of c ensures the path avoids branch cuts. Recent developments have introduced regularized hypersingular integrals along the positive real axis to express $1/\Gamma(z), addressing the divergence issues inherent in naive attempts to invert the Euler integral for \Gamma(z) = \int_0^\infty t^{z-1} e^{-t} \, dt. For z > 0 with z \notin \mathbb{Z} and n = \lfloor z \rfloor, the reciprocal gamma function admits the form \frac{1}{\Gamma(z)} = \frac{\sin(\pi z)}{\pi} \int_0^\infty \frac{e^{-x} - e_{n-1}(-x)}{x^z} \, dx, where e_{n-1}(u) = \sum_{k=0}^{n-1} \frac{u^k}{k!} is the truncated series providing the regularization by subtracting the singular behavior near x = 0. An equivalent imaginary part formulation is \frac{1}{\Gamma(z)} = \operatorname{Im} \left[ \frac{1}{\pi} \int_0^{-\infty} \frac{e^{x} - e_{n-1}(x)}{x^z} \, dx \right], interpreted in the principal value sense to handle the hypersingularity at the origin for $0 < \operatorname{Re}(z) < 1. These integrals converge for z > 0, z \notin \mathbb{Z}, with the truncation order n ensuring finite limits; unlike the Gamma function's convergent integral for \operatorname{Re}(z) > 0, the reciprocal requires this subtraction to counter the pole structure of \Gamma(z). Such representations highlight the reciprocal gamma's entire function nature, contrasting with the Gamma function's meromorphic properties, and facilitate numerical evaluations along the real line by avoiding complex contours.

Representations at Positive Integers

The reciprocal gamma function at the positive integers n+1, where n = 0, 1, 2, \dots, simplifies to the reciprocal of the : \frac{1}{\Gamma(n+1)} = \frac{1}{n!}. This relation stems from the fundamental property of the , which interpolates the such that \Gamma(n+1) = n! for non-negative integers n. A specific contour integral representation for this value, applicable at positive integers, arises from applying Cauchy's integral formula to the exponential function. For n \geq 0, \frac{1}{n!} = \frac{1}{2\pi i} \oint_{\gamma} \frac{e^{z}}{z^{n+1}} \, dz, where \gamma is any simple closed contour in the complex plane that encircles the origin once in the counterclockwise direction, lying within the domain of analyticity of the integrand. This form derives from the Taylor series expansion of e^z around z=0, where the coefficient of z^n / n! is $1/n!, extracted via the residue at the origin. Another integral representation follows from the , where \frac{1}{n!} = \mathcal{L}^{-1} \left\{ \frac{1}{s^{n+1}} \right\} (t) \big|_{t=1}. The Bromwich provides an explicit form: \frac{1}{n!} = \frac{1}{2\pi i} \int_{c - i \infty}^{c + i \infty} \frac{e^{s}}{s^{n+1}} \, ds, with the vertical contour chosen such that c > 0 ensures all singularities of the integrand lie to the left of the line \operatorname{Re}(s) = c. This representation links the reciprocal factorial to transform theory and facilitates derivations from the gamma function's definition via substitution and properties of the . For small non-negative integers n, such as n = 0 to $5, the values \frac{1}{n!} are exactly computable as rational numbers (e.g., $1/0! = 1, $1/1! = 1, $1/2! = 1/2, $1/3! = 1/6, $1/4! = 1/24, $1/5! = 1/120), offering perfect numerical stability without approximation errors. These exact evaluations underpin applications in series expansions and probability, while the integral forms ensure consistent computation for larger n or verification through quadrature, maintaining high precision due to the rapid decay of $1/n!.

Applications

In Numerical Computation

In numerical computations, the reciprocal gamma function $1/\Gamma(z) is often preferred over direct evaluation of \Gamma(z) because it is an that vanishes precisely at the poles of the (non-positive integers), thereby avoiding and potential overflow issues near those points. This property ensures , particularly for complex arguments or values close to the poles, where \Gamma(z) can become extremely large. For instance, evaluating $1/\Gamma(z) prevents underflow or overflow in when \Gamma(z) exceeds the representable range. Series and product expansions of $1/\Gamma(z) are commonly employed for its computation due to their convergence properties and inherent stability. The Taylor series expansion around z=0, given by $1/\Gamma(z) = \sum_{n=0}^{\infty} a_n z^n with coefficients a_n computable via recurrence relations, converges everywhere and requires approximately O(p / \log p) terms to achieve p-bit . Infinite product representations, such as the Weierstrass form $1/\Gamma(z) = z e^{\gamma z} \prod_{n=1}^{\infty} (1 + z/n) e^{-z/n}, can be truncated for approximation; Spouge's method refines this by selecting an optimal truncation point a and precomputing parameters c_k to yield a stable approximation with explicit error bounds of order O(e^{-2\pi a}) for \operatorname{Re}(z) > 0. These approaches maintain accuracy without the exponential growth issues of direct gamma evaluations. Major numerical libraries provide dedicated implementations of the reciprocal gamma function to leverage these stability benefits. The GNU Scientific Library (GSL) computes $1/\Gamma(x) for real x > 0 using the , a continued-fraction method adapted for the reciprocal, achieving double-precision relative accuracy of approximately $10^{-16}. Similarly, 's scipy.special.rgamma function evaluates $1/\Gamma(z) for real or complex z, recommending its use near poles to sidestep overflow in the standard gamma routine, with underflow to zero for large positive inputs (e.g., z = 179 yields exactly 0 in double precision). These implementations often combine series for small |z| and asymptotic methods for larger arguments. Error analysis for reciprocal gamma computations emphasizes rigorous bounds to ensure reliability, especially in . For the , coefficient bounds satisfy |a_n| \leq e^{\pi R/2} R^{1/2 + R - n} with near-optimal R = n/8, and truncation errors are controlled by \leq 8 \max(1/2, |z|) |b_N| |z|^N for |z| \leq 20 and N \leq 1000, enabling certified precision up to thousands of bits. For large or arguments, asymptotic expansions of $1/\Gamma(z), derived inversely from Stirling's series, provide rapid with relative errors decaying factorially, typically requiring fewer than 20 terms for double precision even at |z| > 100. These methods ensure high accuracy across the while minimizing computational cost.

In Fractional Calculus

The reciprocal gamma function serves as a key constant in the definitions of classical fractional operators, ensuring their proper scaling and consistency with integer-order calculus. In the Riemann-Liouville fractional of order \alpha, where n-1 < \alpha \leq n and n is a positive integer, the operator is defined as {}_aD_x^\alpha f(x) = \frac{1}{\Gamma(n-\alpha)} \frac{d^n}{dx^n} \int_a^x (x-t)^{n-\alpha-1} f(t) \, dt. This formulation incorporates the reciprocal gamma function to the fractional integral component, facilitating the generalization of differentiation to non-integer orders. Similar roles appear in other foundational fractional derivatives. The Caputo derivative, which modifies the Riemann-Liouville form to align better with initial value problems, is given by {}_a^C D_x^\alpha f(x) = \frac{1}{\Gamma(n-\alpha)} \int_a^x (x-t)^{n-\alpha-1} f^{(n)}(t) \, dt, where the reciprocal gamma again provides the necessary scaling for the kernel. The Grünwald-Letnikov derivative, defined as the limit D^\alpha f(x) = \lim_{h \to 0^+} h^{-\alpha} \sum_{k=0}^\infty (-1)^k \binom{\alpha}{k} f(x - kh), equivalently incorporates the reciprocal gamma through the gamma-based binomial coefficients \binom{\alpha}{k}, serving as a normalization across these operators. This consistent use ensures that as \alpha approaches an integer m, the fractional derivative reduces to the classical m-th derivative, preserving foundational properties of calculus. Beyond derivatives, the reciprocal gamma extends to fractional integrals, where the Riemann-Liouville integral of order \alpha > 0 is {}_a I_x^\alpha f(x) = \frac{1}{\Gamma(\alpha)} \int_a^x (x-t)^{\alpha-1} f(t) \, dt, directly employing $1/\Gamma(\alpha) for normalization to match repeated integrations when \alpha is an . In the theory of central to , the reciprocal gamma appears in the denominator of the series, E_{\alpha,\beta}(z) = \sum_{k=0}^\infty \frac{z^k}{\Gamma(\alpha k + \beta)}, which generalizes solutions to fractional equations and relies on the reciprocal gamma for convergence and . These extensions highlight the reciprocal gamma's foundational role in unifying and fractional operators.

References

  1. [1]
    Regularized Integral Representations of the Reciprocal Gamma ...
    The reciprocal Gamma function is a normalization constant in all of the classical fractional derivative operators: the Riemann–Liouville, Caputo, and Grünwald– ...
  2. [2]
    Introduction to the Gamma Function
    F. W. Newman (1848) studied the reciprocal of the gamma function and found that it is an entire function and has the following product representation valid for ...
  3. [3]
    On the Power Series Expansion of the Reciprocal Gamma Function
    Jul 22, 2014 · Using the reflection formula of the Gamma function, we derive a new formula for the Taylor coefficients of the reciprocal Gamma function. The ...
  4. [4]
    DLMF: Chapter 5 Gamma Function
    Chapter 5 Gamma Function · Notation. 5.1 Special Notation · Properties. 5.2 Definitions · 5.3 Graphics · 5.4 Special Values and Extrema · 5.5 Functional Relations ...Missing: "handbook | Show results with:"handbook
  5. [5]
    (PDF) Gauss's definition of the gamma function - ResearchGate
    PDF | The present paper gives a historical account on extending the factorial function to complex numbers by Gauss. | Find, read and cite all the research ...<|control11|><|separator|>
  6. [6]
    [PDF] arXiv:2011.12140v1 [math.HO] 22 Nov 2020
    Nov 22, 2020 · Weierstrass “factorielle” function. Apparently ([16] p.862), Weierstrass pre- ferred to work with the function Fc(u) = 1/Γ(1 ...
  7. [7]
    [PDF] A Historical Profile of the Gamma Function - OSU Math
    It shows immediately that the reciprocal of the gamma function is a much less difficult function to deal with than the gamma function itself. It is an entire.<|control11|><|separator|>
  8. [8]
    [PDF] Weierstrass and Hadamard Factorization of Entire Functions
    We have seen the infinite product expansion of the trigonometric sine function and the infinite product expansion of the reciprocal of the Gamma function. The.
  9. [9]
    [PDF] A course of modern analysis; an introduction to the general theory of ...
    WHITTAKER, Sc.D., F.R.S.. PROFESSOR OF MATHEMATICS IN THE UNIVERSITY OF EDINBURGH. AND. G. N. WATSON, Sc. ... Gamma Function. 235. The Zeta Function of Riemann.
  10. [10]
    [PDF] arXiv:1407.5983v4 [math.NT] 13 Jan 2017
    Jan 13, 2017 · However, one can use the approximation (3.21) to easily prove that the order of the reciprocal gamma function is 1 and that its type is maximal.
  11. [11]
    246B, Notes 1: Zeroes, poles, and factorisation of meromorphic ...
    Dec 23, 2020 · Hadamard's theorem also tells us that any other entire function of order ... {\Gamma} is the unique reciprocal of an entire function of order {1} ...
  12. [12]
    Gamma Function -- from Wolfram MathWorld
    The (complete) gamma function Gamma(n) is defined to be an extension of the factorial to complex and real number arguments.
  13. [13]
    Gamma function - MATLAB - MathWorks
    The function does not have any zeros. Conversely, the reciprocal gamma function has zeros at all negative integer arguments (as well as 0). fplot(@gamma) ...
  14. [14]
    None
    ### Weierstrass Infinite Product for the Gamma Function and Its Reciprocal
  15. [15]
    [PDF] Series expansion of the Gamma function and its reciprocal
    Dec 3, 2021 · Abstract: In this paper we give representations for the coefficients of the Maclaurin series for. Γ(z + 1) and its reciprocal (where Γ is ...
  16. [16]
    5.11 Asymptotic Expansions ‣ Properties ‣ Chapter 5 Gamma ...
    The scaled gamma function Γ ∗ ⁡ ( z ) is defined in (5.11.3) and its main property is Γ ∗ ⁡ ( z ) ∼ 1 as z → ∞ in the sector | ph ⁡ z | ≤ π − δ.
  17. [17]
    Asymptotic expansions for the reciprocal of the gamma function
    Oct 30, 2013 · Asymptotic expansions are derived for the reciprocal of the gamma function. We show that the coefficients of the expansion are the same, up to a ...
  18. [18]
    [PDF] the asymptotic expansion of the incomplete gamma functions
    remainder of the asymptotic expansion of the reciprocal gamma function. 1/f(x) for real x. In § 5 the results are extended to complex values of a and x. 2 ...
  19. [19]
    [PDF] arXiv:1310.0166v2 [math.CA] 20 Mar 2014
    Mar 20, 2014 · In the next theorem we give exponentially improved asymptotic expansions for the gamma function and its reciprocal. The expansion for the gamma ...
  20. [20]
    [PDF] Computing the gamma function using contour integrals and rational ...
    The reciprocal gamma function is a standard example for this technique presented in this and many other textbooks. We keep the details to a minimum and follow ...<|control11|><|separator|>
  21. [21]
    A Short Note on Integral Transformations and Conversion Formulas ...
    Sep 11, 2018 · We prove two variants of the OGF-to-EGF transformation integrals from the Hankel loop contour for the reciprocal gamma function and from ...<|control11|><|separator|>
  22. [22]
    Regularized integral representations of the reciprocal Gamma function
    Oct 27, 2018 · This paper establishes a real integral representation of the reciprocal \Gamma function in terms of a regularized hypersingular integral. The ...<|control11|><|separator|>
  23. [23]
    DLMF: §5.2 Definitions ‣ Properties ‣ Chapter 5 Gamma Function
    When R ⁡ z ≤ 0 , Γ ⁡ ( z ) is defined by analytic continuation. It is a meromorphic function with no zeros, and with simple poles of residue.
  24. [24]
    Differential Equations - Table Of Laplace Transforms
    Nov 16, 2022 · This section is the table of Laplace Transforms that we'll be using in the material. We give as wide a variety of Laplace transforms as ...
  25. [25]
    [PDF] Arbitrary-precision computation of the gamma function - Hal-Inria
    Sep 16, 2021 · The reciprocal gamma function 1/Γ(z), which is an entire function and avoids issues with division by zero at the poles of Γ(z) at z = 0, −1,....
  26. [26]
    scipy.special.rgamma — SciPy v1.16.2 Manual
    Reciprocal of the gamma function. Defined as 1 / Γ ( z ) , where Γ is the gamma function. For more on the gamma function see gamma . Parameters:.
  27. [27]
    Special Functions — GSL 2.8 documentation - GNU.org
    These routines compute the reciprocal of the gamma function, 1/\Gamma(x) using the real Lanczos method. int gsl_sf_lngamma_complex_e(double zr, double zi ...
  28. [28]