About the Project

cash app phone number +1(888‒481‒4477)

AdvancedHelp

(0.012 seconds)

31—40 of 61 matching pages

31: 10.72 Mathematical Applications
In regions in which (10.72.1) has a simple turning point z 0 , that is, f ( z ) and g ( z ) are analytic (or with weaker conditions if z = x is a real variable) and z 0 is a simple zero of f ( z ) , asymptotic expansions of the solutions w for large u can be constructed in terms of Airy functions or equivalently Bessel functions or modified Bessel functions of order 1 3 9.6(i)). … If f ( z ) has a double zero z 0 , or more generally z 0 is a zero of order m , m = 2 , 3 , 4 , , then uniform asymptotic approximations (but not expansions) can be constructed in terms of Bessel functions, or modified Bessel functions, of order 1 / ( m + 2 ) . The number m can also be replaced by any real constant λ ( > 2 ) in the sense that ( z z 0 ) λ f ( z ) is analytic and nonvanishing at z 0 ; moreover, g ( z ) is permitted to have a single or double pole at z 0 . The order of the approximating Bessel functions, or modified Bessel functions, is 1 / ( λ + 2 ) , except in the case when g ( z ) has a double pole at z 0 . … In regions in which the function f ( z ) has a simple pole at z = z 0 and ( z z 0 ) 2 g ( z ) is analytic at z = z 0 (the case λ = 1 in §10.72(i)), asymptotic expansions of the solutions w of (10.72.1) for large u can be constructed in terms of Bessel functions and modified Bessel functions of order ± 1 + 4 ρ , where ρ is the limiting value of ( z z 0 ) 2 g ( z ) as z z 0 . …
32: 26.1 Special Notation
( m n ) binomial coefficient.
m n Eulerian number.
B ( n ) Bell number.
C ( n ) Catalan number.
Other notations for s ( n , k ) , the Stirling numbers of the first kind, include S n ( k ) (Abramowitz and Stegun (1964, Chapter 24), Fort (1948)), S n k (Jordan (1939), Moser and Wyman (1958a)), ( n 1 k 1 ) B n k ( n ) (Milne-Thomson (1933)), ( 1 ) n k S 1 ( n 1 , n k ) (Carlitz (1960), Gould (1960)), ( 1 ) n k [ n k ] (Knuth (1992), Graham et al. (1994), Rosen et al. (2000)). Other notations for S ( n , k ) , the Stirling numbers of the second kind, include 𝒮 n ( k ) (Fort (1948)), 𝔖 n k (Jordan (1939)), σ n k (Moser and Wyman (1958b)), ( n k ) B n k ( k ) (Milne-Thomson (1933)), S 2 ( k , n k ) (Carlitz (1960), Gould (1960)), { n k } (Knuth (1992), Graham et al. (1994), Rosen et al. (2000)), and also an unconventional symbol in Abramowitz and Stegun (1964, Chapter 24).
33: 25.11 Hurwitz Zeta Function
25.11.28 ζ ( s , a ) = 1 2 a s + a 1 s s 1 + k = 1 n B 2 k ( 2 k ) ! ( s ) 2 k 1 a 1 s 2 k + 1 Γ ( s ) 0 ( 1 e x 1 1 x + 1 2 k = 1 n B 2 k ( 2 k ) ! x 2 k 1 ) x s 1 e a x d x , s > ( 2 n + 1 ) , s 1 , a > 0 .
25.11.32 0 a x n ψ ( x ) d x = ( 1 ) n 1 ζ ( n ) + ( 1 ) n H n B n + 1 n + 1 k = 0 n ( 1 ) k ( n k ) H k B k + 1 ( a ) k + 1 a n k + k = 0 n ( 1 ) k ( n k ) ζ ( k , a ) a n k , n = 1 , 2 , , a > 0 ,
25.11.34 n 0 a ζ ( 1 n , x ) d x = ζ ( n , a ) ζ ( n ) + B n + 1 B n + 1 ( a ) n ( n + 1 ) , n = 1 , 2 , , a > 0 .
25.11.44 ζ ( 1 , a ) 1 12 + 1 4 a 2 ( 1 12 1 2 a + 1 2 a 2 ) ln a k = 1 B 2 k + 2 ( 2 k + 2 ) ( 2 k + 1 ) 2 k a 2 k ,
25.11.45 ζ ( 2 , a ) 1 12 a + 1 9 a 3 ( 1 6 a 1 2 a 2 + 1 3 a 3 ) ln a k = 1 2 B 2 k + 2 ( 2 k + 2 ) ( 2 k + 1 ) 2 k ( 2 k 1 ) a ( 2 k 1 ) .
34: 24.10 Arithmetic Properties
24.10.1 B 2 n + ( p 1 ) | 2 n 1 p = integer ,
24.10.5 E n E n + p 1 ( mod p ) ,
35: 26.12 Plane Partitions
An equivalent definition is that a plane partition is a finite subset of × × with the property that if ( r , s , t ) π and ( 1 , 1 , 1 ) ( h , j , k ) ( r , s , t ) , then ( h , j , k ) must be an element of π . … The number of plane partitions of n is denoted by pp ( n ) , with pp ( 0 ) = 1 . … in B ( 2 r + 1 , 2 s , 2 t ) it is …in B ( 2 r + 1 , 2 s + 1 , 2 t ) it is … in B ( 2 r + 1 , 2 r + 1 , 2 t ) it is …
36: 4.19 Maclaurin Series and Laurent Series
4.19.5 sec z = 1 + z 2 2 + 5 24 z 4 + 61 720 z 6 + + ( 1 ) n E 2 n ( 2 n ) ! z 2 n + , | z | < 1 2 π ,
37: 24.7 Integral Representations
24.7.1 B 2 n = ( 1 ) n + 1 4 n 1 2 1 2 n 0 t 2 n 1 e 2 π t + 1 d t = ( 1 ) n + 1 2 n 1 2 1 2 n 0 t 2 n 1 e π t sech ( π t ) d t ,
24.7.2 B 2 n = ( 1 ) n + 1 4 n 0 t 2 n 1 e 2 π t 1 d t = ( 1 ) n + 1 2 n 0 t 2 n 1 e π t csch ( π t ) d t ,
24.7.3 B 2 n = ( 1 ) n + 1 π 1 2 1 2 n 0 t 2 n sech 2 ( π t ) d t ,
24.7.4 B 2 n = ( 1 ) n + 1 π 0 t 2 n csch 2 ( π t ) d t ,
38: 24.6 Explicit Formulas
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.12 E 2 n = k = 0 2 n 1 2 k j = 0 k ( 1 ) j ( k j ) ( 1 + 2 j ) 2 n .
39: 27.2 Functions
27.2.13 λ ( n ) = { 1 , n = 1 , ( 1 ) a 1 + + a ν ( n ) , n > 1 .
40: 20.14 Methods of Computation
In theory, starting from any value of τ , a finite number of applications of the transformations τ τ + 1 and τ 1 / τ will result in a value of τ with τ 3 / 2 ; see §23.18. …