summation

SearchAdvancedHelp

(0.001 seconds)

11—20 of 54 matching pages

11: 1.6 Vectors and Vector-Valued Functions

… ►

Einstein Summation Convention

►Much vector algebra involves summation over suffices of products of vector components. In almost all cases of repeated suffices, we can suppress the summation notation entirely, if it is understood that an implicit sum is to be taken over any repeated suffix. … ► …

12: 3.11 Approximation Techniques

… ►When $n>0$ and $0\le j\le n$, $0\le k\le n$, … ►Here the single prime on the summation symbol means that the first term is to be halved. … ►

Summation of Chebyshev Series: Clenshaw’s Algorithm

… ►Now suppose that $X_{k\mathrm{\ell }}=0$ when $k\ne \mathrm{\ell }$, that is, the functions ${\varphi }_k(x)$ are orthogonal with respect to weighted summation on the discrete set $x_1,x_2,\mathrm{\dots },x_J$. … …

13: 19.19 Taylor and Related Series

… ►where the summation extends over all nonnegative integers $m_1,\mathrm{\dots },m_n$ whose sum is $N$. … ►where $M={\sum }_{j=1}^n{m}_j$ and the summation extends over all nonnegative integers $m_1,\mathrm{\dots },m_n$ such that ${\sum }_{j=1}^{n}j{m}_j=N$. …

14: 34.4 Definition: $\mathit{6}j$ Symbol

… ►where the summation is taken over all admissible values of the $m$’s and $m^{\prime }$’s for each of the four $\mathit{3}j$ symbols; compare (34.2.2) and (34.2.3). … ►where the summation is over all nonnegative integers $s$ such that the arguments in the factorials are nonnegative. …

15: 23.18 Modular Transformations

… ►

23.18.7 $$s(d,c)=\sum _{r=1}^{c-1}\frac{r}{c}\left(\frac{dr}{c}-\lfloor \frac{dr}{c}\rfloor -\frac{1}{2}\right),$$ $c>0$.

ⓘ

Symbols:

$\lfloor x\rfloor$: floor of $x$ , $\left(m,n\right)$: greatest common divisor (gcd), $c$: integer and $d$: integer

Referenced by:

§23.18, Erratum (V1.0.11) for Equation (23.18.7)

Permalink:

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

Encodings:

pMML, png, TeX

Errata (effective with 1.0.11):

Originally the sum ${\sum }_{r=1}^{c-1}$ was written with an additional constraint on the summation, that $\left(r,c\right)=1$. This additional condition was incorrect and has been removed.

Reported 2015-10-05 by Howard Cohl and Tanay Wakhare

See also:

Annotations for §23.18, §23.18 and Ch.23

…

16: 35.4 Partitions and Zonal Polynomials

… ►

Summation

…

17: 2.10 Sums and Sequences

… ►

§2.10(ii) Summation by Parts

►The formula for summation by parts is …

18: 24.10 Arithmetic Properties

… ►where the summation is over all $p$ such that $p-1$ divides $2n$. …

19: 25.8 Sums

… ►

25.8.3 $$\sum _{k=0}^{\mathrm{\infty }}\frac{{\left(s\right)}_k\zeta \left(s+k\right)}{k!2^{s+k}}=(1-2^{-s})\zeta \left(s\right),$$ $s\ne 1$.

ⓘ

Symbols:

$\mathrm{\Gamma }\left(z\right)$: gamma function, ${\left(a\right)}_n$: Pochhammer’s symbol (or shifted factorial), $\zeta \left(s\right)$: Riemann zeta function, $!$: factorial (as in $n!$), $k$: nonnegative integer and $s$: complex variable

Keywords:

infinite series

Source:

Srivastava (1988, (2.6), p. 131); with $k=0$ term

Referenced by:

§25.11(iv), Erratum (V1.0.9) for Chapters 7, 25

Permalink:

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

Encodings:

pMML, png, TeX

Notational Change (effective with 1.0.9):

We have rewritten the original summation ${\sum }_{k=0}^{\mathrm{\infty }}\frac{\mathrm{\Gamma }\left(s+k\right)\zeta \left(s+k\right)}{k!\mathrm{\Gamma }\left(s\right)2^{s+k}}$ more concisely as ${\sum }_{k=0}^{\mathrm{\infty }}\frac{{\left(s\right)}_k\zeta \left(s+k\right)}{k!2^{s+k}}$ using the Pochhammer symbol.

See also:

Annotations for §25.8 and Ch.25

…

20: 26.7 Set Partitions: Bell Numbers

… ►

26.7.6 $$B\left(n+1\right)=\sum _{k=0}^n\left(\genfrac{}{}{0.0pt}{}{n}{k}\right)B\left(k\right).$$

ⓘ

Symbols:

$B\left(n\right)$: Bell number, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $k$: nonnegative integer and $n$: nonnegative integer

Referenced by:

Erratum (V1.0.1) for Equation (26.7.6)

Permalink:

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

Encodings:

pMML, png, TeX

Errata (effective with 1.0.1):

Originally appeared with $B\left(n\right)$ in the summation, instead of $B\left(k\right)$:

$$B\left(n+1\right)=\sum _{k=0}^n\left(\genfrac{}{}{0.0pt}{}{n}{k}\right)B\left(n\right)$$

Reported 2010-11-07 by Layne Watson

See also:

Annotations for §26.7(iii), §26.7 and Ch.26

…