multiplication formula

SearchAdvancedHelp

(0.001 seconds)

1—10 of 27 matching pages

1: 5.5 Functional Relations

… ►

§5.5(iii) Multiplication

… ►

Gauss’s Multiplication Formula

… ►

5.5.7 $$\prod _{k=1}^{n-1}\mathrm{\Gamma }\left(\frac{k}{n}\right)={(2\pi )}^{(n-1)/2}{n}^{-1/2}.$$

ⓘ

Symbols:

$\mathrm{\Gamma }\left(z\right)$: gamma function, $\pi$: the ratio of the circumference of a circle to its diameter, $n$: nonnegative integer and $k$: nonnegative integer

Permalink:

http://dlmf.nist.gov/5.5.E7

Encodings:

pMML, png, TeX

See also:

Annotations for §5.5(iii), §5.5(iii), §5.5 and Ch.5

…

2: 24.4 Basic Properties

… ►

§24.4(v) Multiplication Formulas

… ►Next, …

3: 3.8 Nonlinear Equations

§3.8 Nonlinear Equations

… ►

§3.8(iv) Zeros of Polynomials

… ►has $n$ zeros in $ℂ$, counting each zero according to its multiplicity. …No explicit general formulas exist when $n\ge 5$. … ►The method converges locally and quadratically, except when the wanted quadratic factor is a multiple factor of $q(z)$. …

4: Bibliography O

… ►

Connection formulas for second-order differential equations with multiple turning points. SIAM J. Math. Anal. 8 (1), pp. 127–154.

ⓘ

External Links:

Document, MathReview (Anthony Leung), ZentralBlatt

Referenced by:

§2.8(v), (9.13.13), (9.13.17), §9.13(i), §9.13(i).

Encodings:

BibTeX

►

Connection formulas for second-order differential equations having an arbitrary number of turning points of arbitrary multiplicities. SIAM J. Math. Anal. 8 (4), pp. 673–700.

ⓘ

External Links:

Document, MathReview (W. Wasow), ZentralBlatt

Referenced by:

§2.8(v).

Encodings:

BibTeX

…

5: 27.20 Methods of Computation: Other Number-Theoretic Functions

… ►To calculate a multiplicative function it suffices to determine its values at the prime powers and then use (27.3.2). For a completely multiplicative function we use the values at the primes together with (27.3.10). ►The recursion formulas (27.14.6) and (27.14.7) can be used to calculate the partition function $p\left(n\right)$ for . … ►A recursion formula obtained by differentiating (27.14.18) can be used to calculate Ramanujan’s function $\tau \left(n\right)$, and the values can be checked by the congruence (27.14.20). …

6: 2.8 Differential Equations with a Parameter

… ►

§2.8(v) Multiple and Fractional Turning Points

►The approach used in preceding subsections for equation (2.8.1) also succeeds when $z_0$ is a multiple or fractional turning point. For the former $f(z)$ has a zero of multiplicity $\lambda =2,3,4,\mathrm{\dots }$ and $g(z)$ is analytic. …For results, including error bounds, see Olver (1977c). ►For connection formulas for Liouville–Green approximations across these transition points see Olver (1977b, a, 1978). …

7: Bibliography S

… ►

Algorithm 786: Multiple-precision complex arithmetic and functions. ACM Trans. Math. Software 24 (4), pp. 359–367.

ⓘ

External Links:

ISSN 0098-3500, Document, GAMS (module 786; package TOMS), ZentralBlatt

Referenced by:

4th item.

Encodings:

BibTeX

… ►

Efficient multiple-precision evaluation of elementary functions. Math. Comp. 52 (185), pp. 131–134.

ⓘ

External Links:

ISSN 0025-5718, FullText, MathReview (Menachem Dishon), ZentralBlatt

Referenced by:

§4.45(i).

Encodings:

BibTeX

►

Algorithm 693: A FORTRAN package for floating-point multiple-precision arithmetic. ACM Trans. Math. Software 17 (2), pp. 273–283.

ⓘ

Notes:

Multiple-precision Fortran.

External Links:

ISSN 0098-3500, Document, GAMS (module 693; package TOMS), ZentralBlatt

Referenced by:

2nd item.

Encodings:

BibTeX

… ►

Multiplicative processes and power laws. Phys. Rev. E 57 (4), pp. 4811–4813.

ⓘ

External Links:

Document

Referenced by:

§8.24(i).

Encodings:

BibTeX

… ►

Approximate Calculation of Multiple Integrals. Prentice-Hall Inc., Englewood Cliffs, N.J..

ⓘ

External Links:

ISBN 0130438936;978-0130438935, MathReview (R. D. Riess), ZentralBlatt

Referenced by:

§3.5(x).

Encodings:

BibTeX

…

8: 18.18 Sums

… ►

§18.18(iii) Multiplication Theorems

… ►

§18.18(v) Linearization Formulas

… ►Formula (18.18.27) is known as the Hille–Hardy formula. … ►Formula (18.18.28) is known as the Mehler formula. …

9: 18.28 Askey–Wilson Class

… ►

18.28.26 $$\underset{\lambda \to 0}{lim}{r}_n(x/(2\lambda );\lambda ,qa{\lambda }^{-1},qc{\lambda }^{-1},b{c}^{-1}\lambda |q)=P_n(x;a,b,c;q).$$

ⓘ

Symbols:

$P_n(x;a,b,c;q)$: big $q$-Jacobi polynomial, ${(a_1,a_2,\mathrm{\dots },a_r;q)}_n$: multiple $q$-Pochhammer symbol, $z$: complex variable, $q$: real variable, $\mathrm{\ell }$: nonnegative integer, $n$: nonnegative integer and $x$: real variable

Source:

Koekoek et al. (2010, (14.1.18))

Proof sketch:

In the terminating $q$-hypergeometric series which defines the ${}_4{}^{}\varphi _3^{}$ in (18.28.1_5), with ${(az{q}^{\mathrm{\ell }},a{z}^{-1}{q}^{\mathrm{\ell }};q)}_{\mathrm{\ell }}$ written as ${\prod }_{j=0}^{\mathrm{\ell }-1}(1-2a{q}^{j}x+a^2{q}^{2j})$, substitute for $x$ and the parameters according to the left-hand side of the present formula, take the limit, and obtain the ${}_3{}^{}\varphi _2^{}$ as in (18.27.5).

Referenced by:

(18.28.27), (18.28.28), §18.28(x)

Permalink:

http://dlmf.nist.gov/18.28.E26

Encodings:

pMML, png, TeX

See also:

Annotations for §18.28(x), §18.28(x), §18.28 and Ch.18

…

10: 27.5 Inversion Formulas

§27.5 Inversion Formulas

… ►The multiplicative functions are a subgroup of this group. …which, in turn, is the basis for the Möbius inversion formula relating sums over divisors: … ►Special cases of Möbius inversion pairs are: … ►Other types of Möbius inversion formulas include: …