About the Project

sums or differences of squares

AdvancedHelp

(0.002 seconds)

31—40 of 380 matching pages

31: 24.5 Recurrence Relations
24.5.1 k = 0 n 1 ( n k ) B k ( x ) = n x n 1 , n = 2 , 3 , ,
a n = k = 0 n ( n k ) b n k k + 1 ,
b n = k = 0 n ( n k ) B k a n k .
a n = k = 0 n / 2 ( n 2 k ) b n 2 k ,
b n = k = 0 n / 2 ( n 2 k ) E 2 k a n 2 k .
32: 1.18 Linear Second Order Differential Operators and Eigenfunction Expansions
where the infinite sum means convergence in norm, … The sum of the kinetic and potential energies give the quantum Hamiltonian, or energy operator; often also referred to as a Schrödinger operator. … Should an eigenvalue correspond to more than a single linearly independent eigenfunction, namely a multiplicity greater than one, all such eigenfunctions will always be implied as being part of any sums or integrals over the spectrum. … Spectral expansions of T , and of functions F ( T ) of T , these being expansions of T and F ( T ) in terms of the eigenvalues and eigenfunctions summed over the spectrum, then follow: … In what follows, integrals over the continuous parts of the spectrum will be denoted by 𝝈 c , and sums over the discrete spectrum by 𝝈 p , with 𝝈 = 𝝈 c 𝝈 p denoting the full spectrum. …
33: 10.60 Sums
§10.60 Sums
§10.60(i) Addition Theorems
§10.60(ii) Duplication Formulas
For further sums of series of spherical Bessel functions, or modified spherical Bessel functions, see §6.10(ii), Luke (1969b, pp. 55–58), Vavreck and Thompson (1984), Harris (2000), and Rottbrand (2000).
§10.60(iv) Compendia
34: 26.10 Integer Partitions: Other Restrictions
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 sum is over nonnegative integer values of k for which n 1 2 ( 3 k 2 ± k ) 0 . … where the sum is over nonnegative integer values of k for which n ( 3 k 2 ± k ) 0 . … where the inner sum is the sum of all positive divisors of t that are in S . …
35: 30.4 Functions of the First Kind
30.4.4 𝖯𝗌 n m ( x , γ 2 ) = ( 1 x 2 ) 1 2 m k = 0 g k x k , 1 x 1 ,
30.4.9 lim N 1 1 | f ( x ) n = m N c n 𝖯𝗌 n m ( x , γ 2 ) | 2 d x = 0 .
It is also equiconvergent with its expansion in Ferrers functions (as in (30.4.2)), that is, the difference of corresponding partial sums converges to 0 uniformly for 1 x 1 . …
36: 14.28 Sums
§14.28 Sums
14.28.1 P ν ( z 1 z 2 ( z 1 2 1 ) 1 / 2 ( z 2 2 1 ) 1 / 2 cos ϕ ) = P ν ( z 1 ) P ν ( z 2 ) + 2 m = 1 ( 1 ) m Γ ( ν m + 1 ) Γ ( ν + m + 1 ) P ν m ( z 1 ) P ν m ( z 2 ) cos ( m ϕ ) ,
14.28.2 n = 0 ( 2 n + 1 ) Q n ( z 1 ) P n ( z 2 ) = 1 z 1 z 2 , z 1 1 , z 2 2 ,
§14.28(iii) Other Sums
37: 27.14 Unrestricted Partitions
A fundamental problem studies the number of ways n can be written as a sum of positive integers n , that is, the number of solutions of … and s ( h , k ) is a Dedekind sum given by
27.14.11 s ( h , k ) = r = 1 k 1 r k ( h r k h r k 1 2 ) .
Dedekind sums occur in the transformation theory of the Dedekind modular function η ( τ ) , defined by …where ε = exp ( π i ( ( ( a + d ) / ( 12 c ) ) s ( d , c ) ) ) and s ( d , c ) is given by (27.14.11). …
38: 31.14 General Fuchsian Equation
31.14.1 d 2 w d z 2 + ( j = 1 N γ j z a j ) d w d z + ( j = 1 N q j z a j ) w = 0 , j = 1 N q j = 0 .
α + β + 1 = j = 1 N γ j ,
α β = j = 1 N a j q j .
31.14.4 d 2 W d z 2 = j = 1 N ( γ ~ j ( z a j ) 2 + q ~ j z a j ) W , j = 1 N q ~ j = 0 ,
q ~ j = 1 2 k = 1 k j N γ j γ k a j a k q j ,
39: 6.6 Power Series
6.6.1 Ei ( x ) = γ + ln x + n = 1 x n n ! n , x > 0 .
6.6.2 E 1 ( z ) = γ ln z n = 1 ( 1 ) n z n n ! n .
6.6.4 Ein ( z ) = n = 1 ( 1 ) n 1 z n n ! n ,
6.6.5 Si ( z ) = n = 0 ( 1 ) n z 2 n + 1 ( 2 n + 1 ) ! ( 2 n + 1 ) ,
40: 10.53 Power Series
10.53.1 𝗃 n ( z ) = z n k = 0 ( 1 2 z 2 ) k k ! ( 2 n + 2 k + 1 ) !! ,
10.53.2 𝗒 n ( z ) = 1 z n + 1 k = 0 n ( 2 n 2 k 1 ) !! ( 1 2 z 2 ) k k ! + ( 1 ) n + 1 z n + 1 k = n + 1 ( 1 2 z 2 ) k k ! ( 2 k 2 n 1 ) !! .
10.53.3 𝗂 n ( 1 ) ( z ) = z n k = 0 ( 1 2 z 2 ) k k ! ( 2 n + 2 k + 1 ) !! ,
10.53.4 𝗂 n ( 2 ) ( z ) = ( 1 ) n z n + 1 k = 0 n ( 2 n 2 k 1 ) !! ( 1 2 z 2 ) k k ! + 1 z n + 1 k = n + 1 ( 1 2 z 2 ) k k ! ( 2 k 2 n 1 ) !! .