About the Project

.世界杯各队主教练年薪『网址:mxsty.cc』.世界杯季军怎么算-m6q3s2-2022年12月1日13时59分20秒

AdvancedHelp

(0.005 seconds)

21—30 of 837 matching pages

21: 24.2 Definitions and Generating Functions
B 2 n + 1 = 0 ,
( 1 ) n + 1 B 2 n > 0 , n = 1 , 2 , .
E 2 n + 1 = 0 ,
( 1 ) n E 2 n > 0 .
E ~ n ( x ) = E n ( x ) , 0 x < 1 ,
22: 5.17 Barnes’ G -Function (Double Gamma Function)
G ( 1 ) = 1 ,
5.17.3 G ( z + 1 ) = ( 2 π ) z / 2 exp ( 1 2 z ( z + 1 ) 1 2 γ z 2 ) k = 1 ( ( 1 + z k ) k exp ( z + z 2 2 k ) ) .
5.17.4 Ln G ( z + 1 ) = 1 2 z ln ( 2 π ) 1 2 z ( z + 1 ) + z Ln Γ ( z + 1 ) 0 z Ln Γ ( t + 1 ) d t .
5.17.5 Ln G ( z + 1 ) 1 4 z 2 + z Ln Γ ( z + 1 ) ( 1 2 z ( z + 1 ) + 1 12 ) ln z ln A + k = 1 B 2 k + 2 2 k ( 2 k + 1 ) ( 2 k + 2 ) z 2 k .
5.17.7 C = lim n ( k = 1 n k ln k ( 1 2 n 2 + 1 2 n + 1 12 ) ln n + 1 4 n 2 ) = γ + ln ( 2 π ) 12 ζ ( 2 ) 2 π 2 = 1 12 ζ ( 1 ) ,
23: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
For k = 0 , 1 , the multinomial coefficient is defined to be 1 . … M 1 is the multinominal coefficient (26.4.2): … M 2 is the number of permutations of { 1 , 2 , , n } with a 1 cycles of length 1, a 2 cycles of length 2, , and a n cycles of length n : … M 3 is the number of set partitions of { 1 , 2 , , n } with a 1 subsets of size 1, a 2 subsets of size 2, , and a n subsets of size n : …For each n all possible values of a 1 , a 2 , , a n are covered. …
24: 26.6 Other Lattice Path Numbers
D ( m , n ) is the number of paths from ( 0 , 0 ) to ( m , n ) that are composed of directed line segments of the form ( 1 , 0 ) , ( 0 , 1 ) , or ( 1 , 1 ) . … M ( n ) is the number of lattice paths from ( 0 , 0 ) to ( n , n ) that stay on or above the line y = x and are composed of directed line segments of the form ( 2 , 0 ) , ( 0 , 2 ) , or ( 1 , 1 ) . … N ( n , k ) is the number of lattice paths from ( 0 , 0 ) to ( n , n ) that stay on or above the line y = x , are composed of directed line segments of the form ( 1 , 0 ) or ( 0 , 1 ) , and for which there are exactly k occurrences at which a segment of the form ( 0 , 1 ) is followed by a segment of the form ( 1 , 0 ) . … r ( n ) is the number of paths from ( 0 , 0 ) to ( n , n ) that stay on or above the diagonal y = x and are composed of directed line segments of the form ( 1 , 0 ) , ( 0 , 1 ) , or ( 1 , 1 ) . …
26.6.10 D ( m , n ) = D ( m , n 1 ) + D ( m 1 , n ) + D ( m 1 , n 1 ) , m , n 1 ,
25: 18.41 Tables
Abramowitz and Stegun (1964, Tables 22.4, 22.6, 22.11, and 22.13) tabulates T n ( x ) , U n ( x ) , L n ( x ) , and H n ( x ) for n = 0 ( 1 ) 12 . The ranges of x are 0.2 ( .2 ) 1 for T n ( x ) and U n ( x ) , and 0.5 , 1 , 3 , 5 , 10 for L n ( x ) and H n ( x ) . …
26: Bibliography G
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:120:21.
  • W. Groenevelt (2007) Fourier transforms related to a root system of rank 1. Transform. Groups 12 (1), pp. 77–116.
  • V. I. Gromak (1976) The solutions of Painlevé’s fifth equation. Differ. Uravn. 12 (4), pp. 740–742 (Russian).
  • V. I. Gromak (1978) One-parameter systems of solutions of Painlevé equations. Differ. Uravn. 14 (12), pp. 2131–2135 (Russian).
  • J. H. Gunn (1967) Algorithm 300: Coulomb wave functions. Comm. ACM 10 (4), pp. 244–245.
  • 27: 26.9 Integer Partitions: Restricted Number and Part Size
    The conjugate to the example in Figure 26.9.1 is 6 + 5 + 4 + 2 + 1 + 1 + 1 . … It is also equal to the number of lattice paths from ( 0 , 0 ) to ( m , k ) that have exactly n vertices ( h , j ) , 1 h m , 1 j k , above and to the left of the lattice path. …
    p 3 ( n ) = 1 + n 2 + 6 n 12 .
    It is also assumed everywhere that | q | < 1 . … Also, when | x q | < 1
    28: 18.40 Methods of Computation
    Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . … Equation (18.40.7) provides step-histogram approximations to a x d μ ( x ) , as shown in Figure 18.40.1 for N = 12 and 120 , shown here for the repulsive Coulomb–Pollaczek OP’s of Figure 18.39.2, with the parameters as listed therein. … Results similar to these appear in Langhoff et al. (1976) in methods developed for physics applications, and which includes treatments of systems with discontinuities in μ ( x ) , using what is referred to as the Stieltjes derivative which may be traced back to Stieltjes, as discussed by Deltour (1968, Eq. 12). … where the coefficients are defined recursively via a 1 = x 1 , N x 2 , N 1 , and … This is a challenging case as the desired w RCP ( x ) on [ 1 , 1 ] has an essential singularity at x = 1 . …
    29: 5.23 Approximations
    Cody and Hillstrom (1967) gives minimax rational approximations for ln Γ ( x ) for the ranges 0.5 x 1.5 , 1.5 x 4 , 4 x 12 ; precision is variable. Hart et al. (1968) gives minimax polynomial and rational approximations to Γ ( x ) and ln Γ ( x ) in the intervals 0 x 1 , 8 x 1000 , 12 x 1000 ; precision is variable. … Luke (1969b) gives the coefficients to 20D for the Chebyshev-series expansions of Γ ( 1 + x ) , 1 / Γ ( 1 + x ) , Γ ( x + 3 ) , ln Γ ( x + 3 ) , ψ ( x + 3 ) , and the first six derivatives of ψ ( x + 3 ) for 0 x 1 . …Clenshaw (1962) also gives 20D Chebyshev-series coefficients for Γ ( 1 + x ) and its reciprocal for 0 x 1 . …
    30: 23.14 Integrals
    23.14.2 2 ( z ) d z = 1 6 ( z ) + 1 12 g 2 z ,
    For further integrals see Gröbner and Hofreiter (1949, Vol. 1, pp. 161–162), Gradshteyn and Ryzhik (2000, p. 622), and Prudnikov et al. (1990, pp. 51–52).