About the Project

Pfaff–Saalschütz balanced sum

AdvancedHelp

(0.002 seconds)

21—30 of 375 matching pages

21: 15.15 Sums
§15.15 Sums
β–Ί
15.15.1 𝐅 ⁑ ( a , b c ; 1 z ) = ( 1 z 0 z ) a ⁒ s = 0 ( a ) s s ! ⁒ 𝐅 ⁑ ( s , b c ; 1 z 0 ) ⁒ ( 1 z z 0 ) s .
β–ΊFor compendia of finite sums and infinite series involving hypergeometric functions see Prudnikov et al. (1990, §§5.3 and 6.7) and Hansen (1975).
22: 6.15 Sums
§6.15 Sums
β–Ί
6.15.1 n = 1 Ci ⁑ ( Ο€ ⁒ n ) = 1 2 ⁒ ( ln ⁑ 2 Ξ³ ) ,
β–Ί
6.15.2 n = 1 si ⁑ ( Ο€ ⁒ n ) n = 1 2 ⁒ Ο€ ⁒ ( ln ⁑ Ο€ 1 ) ,
β–Ί
6.15.3 n = 1 ( 1 ) n ⁒ Ci ⁑ ( 2 ⁒ Ο€ ⁒ n ) = 1 ln ⁑ 2 1 2 ⁒ Ξ³ ,
β–ΊFor further sums see Fempl (1960), Hansen (1975, pp. 423–424), Harris (2000), Prudnikov et al. (1986b, vol. 2, pp. 649–650), and SlaviΔ‡ (1974).
23: 1.7 Inequalities
β–Ί
§1.7(i) Finite Sums
β–Ί
Cauchy–Schwarz Inequality
β–Ί
Minkowski’s Inequality
β–Ί
Cauchy–Schwarz Inequality
β–Ί
Minkowski’s Inequality
24: 27.6 Divisor Sums
§27.6 Divisor Sums
β–ΊSums of number-theoretic functions extended over divisors are of special interest. … β–Ί
27.6.1 d | n Ξ» ⁑ ( d ) = { 1 , n ⁒  is a square , 0 , otherwise .
β–ΊGenerating functions, Euler products, and Möbius inversion are used to evaluate many sums extended over divisors. … β–Ί
27.6.6 d | n Ο• k ⁑ ( d ) ⁒ ( n d ) k = 1 k + 2 k + β‹― + n k ,
25: 24.6 Explicit Formulas
β–Ί
24.6.1 B 2 ⁒ n = k = 2 2 ⁒ n + 1 ( 1 ) k 1 k ⁒ ( 2 ⁒ n + 1 k ) ⁒ j = 1 k 1 j 2 ⁒ n ,
β–Ί
24.6.2 B n = 1 n + 1 ⁒ k = 1 n j = 1 k ( 1 ) j ⁒ j n ⁒ ( n + 1 k j ) / ( n k ) ,
β–Ί
24.6.3 B 2 ⁒ n = k = 1 n ( k 1 ) ! ⁒ k ! ( 2 ⁒ k + 1 ) ! ⁒ j = 1 k ( 1 ) j 1 ⁒ ( 2 ⁒ k k + j ) ⁒ j 2 ⁒ n .
β–Ί
24.6.4 E 2 ⁒ n = k = 1 n 1 2 k 1 ⁒ j = 1 k ( 1 ) j ⁒ ( 2 ⁒ k k j ) ⁒ j 2 ⁒ n ,
β–Ί
24.6.9 B n = k = 0 n 1 k + 1 ⁒ j = 0 k ( 1 ) j ⁒ ( k j ) ⁒ j n ,
26: 16.20 Integrals and Series
β–Ί
27: 27.1 Special Notation
β–Ί β–Ίβ–Ίβ–Ίβ–Ίβ–Ίβ–Ί
d , k , m , n positive integers (unless otherwise indicated).
d | n , d | n sum, product taken over divisors of n .
( m , n ) = 1 sum taken over m , 1 m n and m relatively prime to n .
p , p sum, product extended over all primes.
n x n = 1 x .
28: 27.7 Lambert Series as Generating Functions
β–Ί
27.7.1 n = 1 f ⁑ ( n ) ⁒ x n 1 x n .
β–ΊIf | x | < 1 , then the quotient x n / ( 1 x n ) is the sum of a geometric series, and when the series (27.7.1) converges absolutely it can be rearranged as a power series: β–Ί
27.7.2 n = 1 f ⁑ ( n ) ⁒ x n 1 x n = n = 1 d | n f ⁑ ( d ) ⁒ x n .
β–Ί
27.7.5 n = 1 n Ξ± ⁒ x n 1 x n = n = 1 Οƒ Ξ± ⁑ ( n ) ⁒ x n ,
β–Ί
27.7.6 n = 1 λ ⁑ ( n ) ⁒ x n 1 x n = n = 1 x n 2 .
29: 34.13 Methods of Computation
β–ΊMethods of computation for 3 ⁒ j and 6 ⁒ j symbols include recursion relations, see Schulten and Gordon (1975a), Luscombe and Luban (1998), and Edmonds (1974, pp. 42–45, 48–51, 97–99); summation of single-sum expressions for these symbols, see Varshalovich et al. (1988, §§8.2.6, 9.2.1) and Fang and Shriner (1992); evaluation of the generalized hypergeometric functions of unit argument that represent these symbols, see Srinivasa Rao and Venkatesh (1978) and Srinivasa Rao (1981). β–ΊFor 9 ⁒ j symbols, methods include evaluation of the single-sum series (34.6.2), see Fang and Shriner (1992); evaluation of triple-sum series, see Varshalovich et al. (1988, §10.2.1) and Srinivasa Rao et al. (1989). …
30: 10.44 Sums
§10.44 Sums
β–Ί
§10.44(i) Multiplication Theorem
β–Ί
§10.44(ii) Addition Theorems
β–Ί
§10.44(iii) Neumann-Type Expansions
β–Ί
§10.44(iv) Compendia