n-tuple formulas

SearchAdvancedHelp

(0.003 seconds)

1—10 of 243 matching pages

1: 23.10 Addition Theorems and Other Identities

… ►

§23.10(ii) Duplication Formulas

… ►

§23.10(iii) $n$-Tuple Formulas

…

2: 19.29 Reduction of General Elliptic Integrals

… ►Cubic cases of these formulas are obtained by setting one of the factors in (19.29.3) equal to 1. … ►(19.29.7) subsumes all 72 formulas in Gradshteyn and Ryzhik (2000, 3.168), and its cubic cases similarly replace the $18+36+18=72$ formulas in Gradshteyn and Ryzhik (2000, 3.133, 3.142, and 3.141(1-18)). … ►where ${𝐞}_j$ is an $n$-tuple with 1 in the $j$th position and 0’s elsewhere. … ►The first choice gives a formula that includes the 18+9+18 = 45 formulas in Gradshteyn and Ryzhik (2000, 3.133, 3.156, 3.158), and the second choice includes the 8+8+8+12 = 36 formulas in Gradshteyn and Ryzhik (2000, 3.151, 3.149, 3.137, 3.157) (after setting $x^2=t$ in some cases). … ►The first formula replaces (19.14.4)–(19.14.10). …

3: 19.19 Taylor and Related Series

… ►and define the $n$-tuple $\frac{\mathrm{𝟏}}{\mathrm{𝟐}}=(\frac{1}{2},\mathrm{\dots },\frac{1}{2})$. …

4: 19.18 Derivatives and Differential Equations

… ►Let ${\partial }_j=\partial /\partial z_j$, and ${𝐞}_j$ be an $n$-tuple with 1 in the $j$th place and 0’s elsewhere. …

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

… ►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: Howard S. Cohl

… ►Howard is the project leader for the NIST Digital Repository of Mathematical Formulae seeding and development projects. In this regard, he has been exploring mathematical knowledge management and the digital expression of mostly unambiguous context-free full semantic information for mathematical formulae.

7: Preface

… ►Abramowitz and Stegun’s Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables is being completely rewritten with regard to the needs of today. …The authors will review the relevant published literature and produce approximately twice the number of formulas that were contained in the original Handbook. …

8: 5.5 Functional Relations

… ►

§5.5(ii) Reflection

►

5.5.3 $$\mathrm{\Gamma }\left(z\right)\mathrm{\Gamma }\left(1-z\right)=\pi /\sin \left(\pi z\right),$$ $z\ne 0,\pm 1,\mathrm{\dots }$,

ⓘ

Symbols:

$\mathrm{\Gamma }\left(z\right)$: gamma function, $\pi$: the ratio of the circumference of a circle to its diameter, $\sin z$: sine function and $z$: complex variable

A&S Ref:

6.1.17 (without the condition on $z$.)

Referenced by:

§10.19(i), §15.4(ii), §15.8(ii), (25.9.2), §5.21, (9.10.18), (9.12.15)

Permalink:

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

Encodings:

pMML, png, TeX

See also:

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

… ►

§5.5(iii) Multiplication

►

Duplication Formula

… ►

Gauss’s Multiplication Formula

…

9: 24.6 Explicit Formulas

§24.6 Explicit Formulas

… ►

24.6.6 $$E_{2n}=\sum _{k=1}^{2n}\frac{{(-1)}^k}{2^{k-1}}\left(\genfrac{}{}{0pt}{}{2n+1}{k+1}\right)\sum _{j=0}^{\lfloor \frac{1}{2}k-\frac{1}{2}\rfloor }\left(\genfrac{}{}{0pt}{}{k}{j}\right){(k-2j)}^{2n}.$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $\lfloor x\rfloor$: floor of $x$ , $j$: integer, $k$: integer and $n$: integer

Referenced by:

§24.6

Permalink:

http://dlmf.nist.gov/24.6.E6

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

►

24.6.7 $$B_n\left(x\right)=\sum _{k=0}^n\frac{1}{k+1}\sum _{j=0}^k{(-1)}^j\left(\genfrac{}{}{0pt}{}{k}{j}\right){(x+j)}^n,$$

ⓘ

Symbols:

$B_n\left(x\right)$: Bernoulli polynomials, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $j$: integer, $k$: integer, $n$: integer and $x$: real or complex

Referenced by:

§24.6, §24.6

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

… ►

24.6.12 $$E_{2n}=\sum _{k=0}^{2n}\frac{1}{2^k}\sum _{j=0}^k{(-1)}^j\left(\genfrac{}{}{0pt}{}{k}{j}\right){(1+2j)}^{2n}.$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $j$: integer, $k$: integer and $n$: integer

Referenced by:

§24.6, §24.6

Permalink:

http://dlmf.nist.gov/24.6.E12

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

10: 27.5 Inversion Formulas

§27.5 Inversion Formulas

… ►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: …