About the Project

sums or differences of squares

AdvancedHelp

(0.003 seconds)

11—20 of 380 matching pages

11: 6.15 Sums
§6.15 Sums
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).
12: 1.7 Inequalities
§1.7(i) Finite Sums
Cauchy–Schwarz Inequality
Minkowski’s Inequality
Cauchy–Schwarz Inequality
Minkowski’s Inequality
13: 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 ,
14: 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 ,
15: 16.20 Integrals and Series
16: 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 .
17: 1.2 Elementary Algebra
If m 1 , m 2 , , m n are positive integers and deg f < j = 1 n m j , then there exist polynomials f j ( x ) , deg f j < m j , such that … If det ( 𝐀 ) = 0 then, depending on 𝐜 , there is either no solution or there are infinitely many solutions, being the sum of a particular solution of (1.2.61) and any solution of 𝐀 𝐛 = 𝟎 . … Nonzero vectors 𝐯 1 , , 𝐯 n are linearly independent if i = 1 n c i 𝐯 i = 𝟎 implies that all coefficients c i are zero. …The sum of all multiplicities is n . … Thus tr ( 𝐀 ) is the sum of the (counted according to their multiplicities) eigenvalues of 𝐀 . …
18: 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 .
19: 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). …
20: 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