About the Project

.中国韩国世界杯3月__『wn4.com_』_邯郸看世界杯的好地方_w6n2c9o_2022年11月28日21时26分39秒_znlrjd1fz.com

AdvancedHelp

(0.011 seconds)

11—20 of 817 matching pages

11: 4.17 Special Values and Limits
Table 4.17.1: Trigonometric functions: values at multiples of 1 12 π .
θ sin θ cos θ tan θ csc θ sec θ cot θ
π / 3 1 2 3 1 2 3 2 3 3 2 1 3 3
11 π / 12 1 4 2 ( 3 1 ) 1 4 2 ( 3 + 1 ) ( 2 3 ) 2 ( 3 + 1 ) 2 ( 3 1 ) ( 2 + 3 )
4.17.1 lim z 0 sin z z = 1 ,
4.17.2 lim z 0 tan z z = 1 .
4.17.3 lim z 0 1 cos z z 2 = 1 2 .
12: 22.9 Cyclic Identities
These identities are cyclic in the sense that each of the indices m , n in the first product of, for example, the form s m , p ( 4 ) s n , p ( 4 ) are simultaneously permuted in the cyclic order: m m + 1 m + 2 p 1 2 m 1 ; n n + 1 n + 2 p 1 2 n 1 . …
§22.9(iii) Typical Identities of Rank 3
22.9.22 s 1 , 3 ( 2 ) c 1 , 3 ( 2 ) d 2 , 3 ( 2 ) d 3 , 3 ( 2 ) + s 2 , 3 ( 2 ) c 2 , 3 ( 2 ) d 3 , 3 ( 2 ) d 1 , 3 ( 2 ) + s 3 , 3 ( 2 ) c 3 , 3 ( 2 ) d 1 , 3 ( 2 ) d 2 , 3 ( 2 ) = κ 2 + k 2 1 1 κ 2 ( s 1 , 3 ( 2 ) c 1 , 3 ( 2 ) + s 2 , 3 ( 2 ) c 2 , 3 ( 2 ) + s 3 , 3 ( 2 ) c 3 , 3 ( 2 ) ) ,
22.9.23 s 1 , 3 ( 4 ) d 1 , 3 ( 4 ) c 2 , 3 ( 4 ) c 3 , 3 ( 4 ) + s 2 , 3 ( 4 ) d 2 , 3 ( 4 ) c 3 , 3 ( 4 ) c 1 , 3 ( 4 ) + s 3 , 3 ( 4 ) d 3 , 3 ( 4 ) c 1 , 3 ( 4 ) c 2 , 3 ( 4 ) = κ 2 1 κ 2 ( s 1 , 3 ( 4 ) d 1 , 3 ( 4 ) + s 2 , 3 ( 4 ) d 2 , 3 ( 4 ) + s 2 , 3 ( 4 ) d 2 , 3 ( 4 ) ) .
13: 26.16 Multiset Permutations
The number of elements in 𝔖 S is the multinomial coefficient (§26.4) ( a 1 + a 2 + + a n a 1 , a 2 , , a n ) . … The definitions of inversion number and major index can be extended to permutations of a multiset such as 351322453154 𝔖 { 1 2 , 2 2 , 3 3 , 4 2 , 5 3 } . Thus inv ( 351322453154 ) = 4 + 8 + 0 + 3 + 1 + 1 + 2 + 3 + 1 + 0 + 1 = 24 , and maj ( 351322453154 ) = 2 + 4 + 8 + 9 + 11 = 34 . The q -multinomial coefficient is defined in terms of Gaussian polynomials (§26.9(ii)) by …and again with S = { 1 a 1 , 2 a 2 , , n a n } we have …
14: 23.7 Quarter Periods
23.7.1 ( 1 2 ω 1 ) = e 1 + ( e 1 e 3 ) ( e 1 e 2 ) = e 1 + ω 1 2 ( K ( k ) ) 2 k ,
23.7.2 ( 1 2 ω 2 ) = e 2 i ( e 1 e 2 ) ( e 2 e 3 ) = e 2 i ω 1 2 ( K ( k ) ) 2 k k ,
23.7.3 ( 1 2 ω 3 ) = e 3 ( e 1 e 3 ) ( e 2 e 3 ) = e 3 ω 1 2 ( K ( k ) ) 2 k ,
15: 23.5 Special Lattices
Then Δ > 0 and the parallelogram with vertices at 0 , 2 ω 1 , 2 ω 1 + 2 ω 3 , 2 ω 3 is a rectangle. … Also, e 2 and g 3 have opposite signs unless ω 3 = i ω 1 , in which event both are zero. As functions of ω 3 , e 1 and e 2 are decreasing and e 3 is increasing. … The parallelogram 0 , 2 ω 1 , 2 ω 1 + 2 ω 3 , 2 ω 3 is a square, and … The parallelogram 0 , 2 ω 1 2 ω 3 , 2 ω 1 , 2 ω 3 , is a rhombus: see Figure 23.5.1. …
16: 23.9 Laurent and Other Power Series
Let z 0 ( 0 ) be the nearest lattice point to the origin, and define …Explicit coefficients c n in terms of c 2 and c 3 are given up to c 19 in Abramowitz and Stegun (1964, p. 636). For j = 1 , 2 , 3 , and with e j as in §23.3(i), … where a 0 , 0 = 1 , a m , n = 0 if either m or n < 0 , and …For a m , n with m = 0 , 1 , , 12 and n = 0 , 1 , , 8 , see Abramowitz and Stegun (1964, p. 637).
17: 27.15 Chinese Remainder Theorem
The Chinese remainder theorem states that a system of congruences x a 1 ( mod m 1 ) , , x a k ( mod m k ) , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod m ), where m is the product of the moduli. … Choose four relatively prime moduli m 1 , m 2 , m 3 , and m 4 of five digits each, for example 2 16 3 , 2 16 1 , 2 16 + 1 , and 2 16 + 3 . …By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod m 1 ), (mod m 2 ), (mod m 3 ), and (mod m 4 ), respectively. Because each residue has no more than five digits, the arithmetic can be performed efficiently on these residues with respect to each of the moduli, yielding answers a 1 ( mod m 1 ) , a 2 ( mod m 2 ) , a 3 ( mod m 3 ) , and a 4 ( mod m 4 ) , where each a j has no more than five digits. …
18: 16.6 Transformations of Variable
16.6.1 F 2 3 ( a , b , c a b + 1 , a c + 1 ; z ) = ( 1 z ) a F 2 3 ( a b c + 1 , 1 2 a , 1 2 ( a + 1 ) a b + 1 , a c + 1 ; 4 z ( 1 z ) 2 ) .
16.6.2 F 2 3 ( a , 2 b a 1 , 2 2 b + a b , a b + 3 2 ; z 4 ) = ( 1 z ) a F 2 3 ( 1 3 a , 1 3 a + 1 3 , 1 3 a + 2 3 b , a b + 3 2 ; 27 z 4 ( 1 z ) 3 ) .
For Kummer-type transformations of F 2 2 functions see Miller (2003) and Paris (2005a), and for further transformations see Erdélyi et al. (1953a, §4.5), Miller and Paris (2011), Choi and Rathie (2013) and Wang and Rathie (2013).
19: 26.9 Integer Partitions: Restricted Number and Part Size
p k ( n ) denotes the number of partitions of n into at most k parts. See Table 26.9.1. … It follows that p k ( n ) also equals the number of partitions of n into parts that are less than or equal to k . p k ( m , n ) is the number of partitions of n into at most k parts, each less than or equal to m . …
20: 23.3 Differential Equations
and are denoted by e 1 , e 2 , e 3 . … Let g 2 3 27 g 3 2 , or equivalently Δ be nonzero, or e 1 , e 2 , e 3 be distinct. …Similarly for ζ ( z ; g 2 , g 3 ) and σ ( z ; g 2 , g 3 ) . As functions of g 2 and g 3 , ( z ; g 2 , g 3 ) and ζ ( z ; g 2 , g 3 ) are meromorphic and σ ( z ; g 2 , g 3 ) is entire. Conversely, g 2 , g 3 , and the set { e 1 , e 2 , e 3 } are determined uniquely by the lattice 𝕃 independently of the choice of generators. …