About the Project

体育赛事运作管理刘清早【AG真人官方qee9.com】6tTg

AdvancedHelp

(0.002 seconds)

21—30 of 255 matching pages

21: 5 Gamma Function
22: 16.7 Relations to Other Functions
For 3 j , 6 j , 9 j symbols see Chapter 34. …
23: 35.11 Tables
Tables of zonal polynomials are given in James (1964) for | κ | 6 , Parkhurst and James (1974) for | κ | 12 , and Muirhead (1982, p. 238) for | κ | 5 . …
24: 26.13 Permutations: Cycle Notation
26.13.2 [ 1 2 3 4 5 6 7 8 3 5 2 4 7 8 1 6 ]
is ( 1 , 3 , 2 , 5 , 7 ) ( 4 ) ( 6 , 8 ) in cycle notation. …In consequence, (26.13.2) can also be written as ( 1 , 3 , 2 , 5 , 7 ) ( 6 , 8 ) . … For the example (26.13.2), this decomposition is given by ( 1 , 3 , 2 , 5 , 7 ) ( 6 , 8 ) = ( 1 , 3 ) ( 2 , 3 ) ( 2 , 5 ) ( 5 , 7 ) ( 6 , 8 ) . Again, for the example (26.13.2) a minimal decomposition into adjacent transpositions is given by ( 1 , 3 , 2 , 5 , 7 ) ( 6 , 8 ) = ( 2 , 3 ) ( 1 , 2 ) ( 4 , 5 ) ( 3 , 4 ) ( 2 , 3 ) ( 3 , 4 ) ( 4 , 5 ) ( 6 , 7 ) ( 5 , 6 ) ( 7 , 8 ) ( 6 , 7 ) : inv ( ( 1 , 3 , 2 , 5 , 7 ) ( 6 , 8 ) ) = 11 .
25: 26.2 Basic Definitions
If, for example, a permutation of the integers 1 through 6 is denoted by 256413 , then the cycles are ( 1 , 2 , 5 ) , ( 3 , 6 ) , and ( 4 ) . …The function σ also interchanges 3 and 6, and sends 4 to itself. … As an example, { 1 , 3 , 4 } , { 2 , 6 } , { 5 } is a partition of { 1 , 2 , 3 , 4 , 5 , 6 } . …
Table 26.2.1: Partitions p ( n ) .
n p ( n ) n p ( n ) n p ( n )
6 11 23 1255 40 37338
26: 24.2 Definitions and Generating Functions
Table 24.2.3: Bernoulli numbers B n = N / D .
n N D B n
2 1 6 1.66666 6667 ×10⁻¹
6 1 42 2.38095 2381 ×10⁻²
14 7 6 1.16666 6667
26 85 53103 6 1.42551 7167 ×10⁶
Table 24.2.4: Euler numbers E n .
n E n
6 61
27: 26.3 Lattice Paths: Binomial Coefficients
Table 26.3.1: Binomial coefficients ( m n ) .
m n
4 1 4 6 4 1
6 1 6 15 20 15 6 1
Table 26.3.2: Binomial coefficients ( m + n m ) for lattice paths.
m n
0 1 2 3 4 5 6 7 8
1 1 2 3 4 5 6 7 8 9
2 1 3 6 10 15 21 28 36 45
28: 6.8 Inequalities
6.8.3 x ( x + 3 ) x 2 + 4 x + 2 < x e x E 1 ( x ) < x 2 + 5 x + 2 x 2 + 6 x + 6 .
29: Nico M. Temme
  • In November 2015, Temme was named Senior Associate Editor of the DLMF and Associate Editor for Chapters 3, 6, 7, and 12.
    30: 3.4 Differentiation
    B 1 3 = 1 6 ( 2 6 t + 3 t 2 ) ,
    B 3 6 = 1 720 ( 12 8 t 45 t 2 + 20 t 3 + 15 t 4 6 t 5 ) ,
    B 1 6 = 1 48 ( 36 72 t 39 t 2 + 52 t 3 + 5 t 4 6 t 5 ) ,
    B 1 6 = 1 48 ( 36 + 72 t 39 t 2 52 t 3 + 5 t 4 + 6 t 5 ) ,
    B 3 6 = 1 720 ( 12 + 8 t 45 t 2 20 t 3 + 15 t 4 + 6 t 5 ) .