About the Project

sums%20or%20differences%20of%20squares

AdvancedHelp

(0.004 seconds)

11—20 of 42 matching pages

11: 3.4 Differentiation
B 2 5 = 1 120 ( 6 10 t 15 t 2 + 20 t 3 5 t 4 ) ,
B 3 6 = 1 720 ( 12 8 t 45 t 2 + 20 t 3 + 15 t 4 6 t 5 ) ,
B 2 6 = 1 60 ( 9 9 t 30 t 2 + 20 t 3 + 5 t 4 3 t 5 ) ,
B 2 6 = 1 60 ( 9 + 9 t 30 t 2 20 t 3 + 5 t 4 + 3 t 5 ) ,
For additional formulas involving values of 2 u and 4 u on square, triangular, and cubic grids, see Collatz (1960, Table VI, pp. 542–546). …
12: 26.10 Integer Partitions: Other Restrictions
p ( 𝒟 k , n ) denotes the number of partitions of n into parts with difference at least k . p ( 𝒟 3 , n ) denotes the number of partitions of n into parts with difference at least 3, except that multiples of 3 must differ by at least 6. … where the last right-hand side is the sum over m 0 of the generating functions for partitions into distinct parts with largest part equal to m . … where the inner sum is the sum of all positive odd divisors of t . … where the inner sum is the sum of all positive divisors of t that are in S . …
13: 25.12 Polylogarithms
25.12.7 Li 2 ( e i θ ) = n = 1 cos ( n θ ) n 2 + i n = 1 sin ( n θ ) n 2 .
The cosine series in (25.12.7) has the elementary sum
See accompanying text
Figure 25.12.1: Dilogarithm function Li 2 ( x ) , 20 x < 1 . Magnify
See accompanying text
Figure 25.12.2: Absolute value of the dilogarithm function | Li 2 ( x + i y ) | , 20 x 20 , 20 y 20 . … Magnify 3D Help
25.12.10 Li s ( z ) = n = 1 z n n s .
14: 2.11 Remainder Terms; Stokes Phenomenon
Two different asymptotic expansions in terms of elementary functions, (2.11.6) and (2.11.7), are available for the generalized exponential integral in the sector 1 2 π < ph z < 3 2 π . … We now compute the forward differences Δ j , j = 0 , 1 , 2 , , of the moduli of the rounded values of the first 6 neglected terms: …Multiplying these differences by ( 1 ) j 2 j 1 and summing, we obtain …Subtraction of this result from the sum of the first 5 terms in (2.11.25) yields 0. … For example, using double precision d 20 is found to agree with (2.11.31) to 13D. …
15: 26.3 Lattice Paths: Binomial Coefficients
26.3.3 n = 0 m ( m n ) x n = ( 1 + x ) m , m = 0 , 1 , ,
26.3.4 m = 0 ( m + n m ) x m = 1 ( 1 x ) n + 1 , | x | < 1 .
26.3.7 ( m + 1 n + 1 ) = k = n m ( k n ) , m n 0 ,
26.3.8 ( m n ) = k = 0 n ( m n 1 + k k ) , m n 0 .
26.3.10 ( m n ) = k = 0 n ( 1 ) n k ( m + 1 k ) , m n 0 ,
16: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
Table 26.4.1: Multinomials and partitions.
n m λ M 1 M 2 M 3
5 2 2 1 , 3 1 10 20 10
5 3 1 2 , 3 1 20 20 10
26.4.9 ( x 1 + x 2 + + x k ) n = ( n n 1 , n 2 , , n k ) x 1 n 1 x 2 n 2 x k n k ,
26.4.10 ( n 1 + n 2 + + n m n 1 , n 2 , , n m ) = k = 1 m ( n 1 + n 2 + + n m 1 n 1 , n 2 , , n k 1 , n k 1 , n k + 1 , , n m ) , n 1 , n 2 , , n m 1 .
17: 24.2 Definitions and Generating Functions
24.2.1 t e t 1 = n = 0 B n t n n ! , | t | < 2 π .
24.2.5 B n ( x ) = k = 0 n ( n k ) B k x n k .
24.2.10 E n ( x ) = k = 0 n ( n k ) E k 2 k ( x 1 2 ) n k .
Table 24.2.5: Coefficients b n , k of the Bernoulli polynomials B n ( x ) = k = 0 n b n , k x k .
k
Table 24.2.6: Coefficients e n , k of the Euler polynomials E n ( x ) = k = 0 n e n , k x k .
k
18: 11.6 Asymptotic Expansions
11.6.1 𝐊 ν ( z ) 1 π k = 0 Γ ( k + 1 2 ) ( 1 2 z ) ν 2 k 1 Γ ( ν + 1 2 k ) , | ph z | π δ ,
11.6.2 𝐌 ν ( z ) 1 π k = 0 ( 1 ) k + 1 Γ ( k + 1 2 ) ( 1 2 z ) ν 2 k 1 Γ ( ν + 1 2 k ) , | ph z | 1 2 π δ .
11.6.3 0 z 𝐊 0 ( t ) d t 2 π ( ln ( 2 z ) + γ ) 2 π k = 1 ( 1 ) k + 1 ( 2 k ) ! ( 2 k 1 ) ! ( k ! ) 2 ( 2 z ) 2 k , | ph z | π δ ,
11.6.4 0 z 𝐌 0 ( t ) d t + 2 π ( ln ( 2 z ) + γ ) 2 π k = 1 ( 2 k ) ! ( 2 k 1 ) ! ( k ! ) 2 ( 2 z ) 2 k , | ph z | 1 2 π δ ,
c 3 ( λ ) = 20 λ 6 4 λ 4 ,
19: 19.36 Methods of Computation
Numerical differences between the variables of a symmetric integral can be reduced in magnitude by successive factors of 4 by repeated applications of the duplication theorem, as shown by (19.26.18). When the differences are moderately small, the iteration is stopped, the elementary symmetric functions of certain differences are calculated, and a polynomial consisting of a fixed number of terms of the sum in (19.19.7) is evaluated. … The reductions in §19.29(i) represent x , y , z as squares, for example x = U 12 2 in (19.29.4). … The cases k c 2 / 2 p < and < p < k c 2 / 2 require different treatment for numerical purposes, and again precautions are needed to avoid cancellations. … For computation of Legendre’s integral of the third kind, see Abramowitz and Stegun (1964, §§17.7 and 17.8, Examples 15, 17, 19, and 20). …
20: 18.40 Methods of Computation
Usually, however, other methods are more efficient, especially the numerical solution of difference equations (§3.6) and the application of uniform asymptotic expansions (when available) for OP’s of large degree. …
18.40.5 F N ( z ) = 1 μ 0 n = 1 N w n z x n .
Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . …
18.40.7 μ N ( x ) = n = 1 N w n H ( x x n ) , x ( a , b ) ,