About the Project

quintuple product identity

AdvancedHelp

(0.002 seconds)

21—30 of 259 matching pages

21: 16.12 Products
§16.12 Products
For further identities see Goursat (1883) and Erdélyi et al. (1953a, §4.3).
22: 26.10 Integer Partitions: Other Restrictions
The set { n 1 | n ± j ( mod k ) } is denoted by A j , k . …
26.10.2 n = 0 p ( 𝒟 , n ) q n = j = 1 ( 1 + q j ) = j = 1 1 1 q 2 j 1 = 1 + m = 1 q m ( m + 1 ) / 2 ( 1 q ) ( 1 q 2 ) ( 1 q m ) = 1 + m = 1 q m ( 1 + q ) ( 1 + q 2 ) ( 1 + q m 1 ) ,
26.10.5 n = 0 p ( S , n ) q n = j S 1 1 q j .
§26.10(iv) Identities
Equations (26.10.13) and (26.10.14) are the Rogers–Ramanujan identities. …
23: 17.14 Constant Term Identities
§17.14 Constant Term Identities
17.14.1 ( q ; q ) a 1 + a 2 + + a n ( q ; q ) a 1 ( q ; q ) a 2 ( q ; q ) a n =  coeff. of  x 1 0 x 2 0 x n 0  in  1 j < k n ( x j x k ; q ) a j ( q x k x j ; q ) a k .
Rogers–Ramanujan Constant Term Identities
24: 20.7 Identities
§20.7 Identities
§20.7(iv) Reduction Formulas for Products
§20.7(v) Watson’s Identities
This reference also gives the eleven additional identities for the permutations of the four theta functions. …
§20.7(ix) Addendum to 20.7(iv) Reduction Formulas for Products
25: 26.13 Permutations: Cycle Notation
See §26.8 for generating functions, recurrence relations, identities, and asymptotic approximations. … Every permutation is a product of transpositions. … Every transposition is the product of adjacent transpositions. If j < k , then ( j , k ) is a product of 2 k 2 j 1 adjacent transpositions: …Every permutation is a product of adjacent transpositions. …
26: 1.3 Determinants, Linear Operators, and Spectral Expansions
If two rows (columns) of a determinant are identical, then the determinant is zero. … The determinant of an upper or lower triangular, or diagonal, square matrix 𝐀 is the product of the diagonal elements det ( 𝐀 ) = i = 1 n a i i . …
1.3.14 det [ 1 a j b k ] = ( 1 ) n ( n 1 ) / 2 1 j < k n ( a k a j ) ( b k b j ) / j , k = 1 n ( a j b k ) .
The adjoint of a matrix 𝐀 is the matrix 𝐀 such that 𝐀 𝐚 , 𝐛 = 𝐚 , 𝐀 𝐛 for all 𝐚 , 𝐛 𝐄 n . …
1.3.20 𝐮 = i = 1 n c i 𝐚 i , c i = 𝐮 , 𝐚 i .
27: 24.14 Sums
In the following two identities, valid for n 2 , the sums are taken over all nonnegative integers j , k , with j + k + = n . … In the next identity, valid for n 4 , the sum is taken over all positive integers j , k , , m with j + k + + m = n . … These identities can be regarded as higher-order recurrences. …
24.14.11 det [ B r + s ] = ( 1 ) n ( n + 1 ) / 2 ( k = 1 n k ! ) 6 / ( k = 1 2 n + 1 k ! ) ,
24.14.12 det [ E r + s ] = ( 1 ) n ( n + 1 ) / 2 ( k = 1 n k ! ) 2 .
28: 31.17 Physical Applications
The problem of adding three quantum spins 𝐬 , 𝐭 , and 𝐮 can be solved by the method of separation of variables, and the solution is given in terms of a product of two Heun functions. …
𝐉 2 Ψ ( 𝐱 ) ( 𝐬 + 𝐭 + 𝐮 ) 2 Ψ ( 𝐱 ) = j ( j + 1 ) Ψ ( 𝐱 ) ,
𝐻 s Ψ ( 𝐱 ) ( 2 𝐬 𝐭 ( 2 / a ) 𝐬 𝐮 ) Ψ ( 𝐱 ) = h s Ψ ( 𝐱 ) ,
29: 4.21 Identities
§4.21 Identities
§4.21(ii) Squares and Products
4.21.35 sin ( n z ) = 2 n 1 k = 0 n 1 sin ( z + k π n ) , n = 1 , 2 , 3 , .
30: 27.9 Quadratic Characters
If p does not divide n , then ( n | p ) has the value 1 when the quadratic congruence x 2 n ( mod p ) has a solution, and the value 1 when this congruence has no solution. … If an odd integer P has prime factorization P = r = 1 ν ( n ) p r a r , then the Jacobi symbol ( n | P ) is defined by ( n | P ) = r = 1 ν ( n ) ( n | p r ) a r , with ( n | 1 ) = 1 . …