About the Project

.韩国兰芝岛世界杯公园_『网址:68707.vip』篮球世界杯竞猜_b5p6v3_pr7bnb1nb.com

AdvancedHelp

(0.004 seconds)

31—40 of 765 matching pages

31: 10.71 Integrals
In the following equations f ν , g ν is any one of the four ordered pairs given in (10.63.1), and f ^ ν , g ^ ν is either the same ordered pair or any other ordered pair in (10.63.1). …
10.71.3 x ( f ν g ^ ν g ν f ^ ν ) d x = x 2 2 ( f ^ ν ( f ν + 1 + g ν + 1 ) g ^ ν ( f ν + 1 g ν + 1 ) f ν ( f ^ ν + 1 + g ^ ν + 1 ) + g ν ( f ^ ν + 1 g ^ ν + 1 ) ) = 1 2 x ( f ν f ^ ν f ν f ^ ν + g ν g ^ ν g ν g ^ ν ) ,
10.71.5 x ( f ν 2 + g ν 2 ) d x = x ( f ν g ν f ν g ν ) = x 2 ( f ν f ν + 1 + g ν g ν + 1 f ν g ν + 1 + f ν + 1 g ν ) ,
10.71.6 x f ν g ν d x = 1 4 x 2 ( 2 f ν g ν f ν 1 g ν + 1 f ν + 1 g ν 1 ) ,
where M ν ( x ) and N ν ( x ) are the modulus functions introduced in §10.68(i). …
32: 19.19 Taylor and Related Series
where the summation extends over all nonnegative integers m 1 , , m n whose sum is N . … Define the elementary symmetric function E s ( 𝐳 ) by …where M = j = 1 n m j and the summation extends over all nonnegative integers m 1 , , m n such that j = 1 n j m j = N . This form of T N can be applied to (19.16.14)–(19.16.18) and (19.16.20)–(19.16.23) if we use …The number of terms in T N can be greatly reduced by using variables 𝐙 = 𝟏 ( 𝐳 / A ) with A chosen to make E 1 ( 𝐙 ) = 0 . …
33: 3.10 Continued Fractions
For instance, if none of the u n vanish, then we can define … The first two columns in this table are defined by …where the c n ( 0 ) appear in (3.10.7). … The A n and B n of (3.10.2) can be computed by means of three-term recurrence relations (1.12.5). … Then u 0 = C n . …
34: 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. …
35: 17.11 Transformations of q -Appell Functions
17.11.1 Φ ( 1 ) ( a ; b , b ; c ; q ; x , y ) = ( a , b x , b y ; q ) ( c , x , y ; q ) ϕ 2 3 ( c / a , x , y b x , b y ; q , a ) ,
17.11.2 Φ ( 2 ) ( a ; b , b ; c , c ; q ; x , y ) = ( b , a x ; q ) ( c , x ; q ) n , r 0 ( a , b ; q ) n ( c / b , x ; q ) r b r y n ( q , c ; q ) n ( q ; q ) r ( a x ; q ) n + r ,
17.11.3 Φ ( 3 ) ( a , a ; b , b ; c ; q ; x , y ) = ( a , b x ; q ) ( c , x ; q ) n , r 0 ( a , b ; q ) n ( x ; q ) r ( c / a ; q ) n + r a r y n ( q , c / a ; q ) n ( q , b x ; q ) r .
17.11.4 m 1 , , m n 0 ( a ; q ) m 1 + m 2 + + m n ( b 1 ; q ) m 1 ( b 2 ; q ) m 2 ( b n ; q ) m n x 1 m 1 x 2 m 2 x n m n ( q ; q ) m 1 ( q ; q ) m 2 ( q ; q ) m n ( c ; q ) m 1 + m 2 + + m n = ( a , b 1 x 1 , b 2 x 2 , , b n x n ; q ) ( c , x 1 , x 2 , , x n ; q ) ϕ n n + 1 ( c / a , x 1 , x 2 , , x n b 1 x 1 , b 2 x 2 , , b n x n ; q , a ) .
36: 10.58 Zeros
For n 0 the m th positive zeros of 𝗃 n ( x ) , 𝗃 n ( x ) , 𝗒 n ( x ) , and 𝗒 n ( x ) are denoted by a n , m , a n , m , b n , m , and b n , m , respectively, except that for n = 0 we count x = 0 as the first zero of 𝗃 0 ( x ) . …
a n , m = j n + 1 2 , m ,
b n , m = y n + 1 2 , m ,
Hence properties of a n , m and b n , m are derivable straightforwardly from results given in §§10.21(i)10.21(iii), 10.21(vi)10.21(viii), and 10.21(x). …For some properties of a n , m and b n , m , including asymptotic expansions, see Olver (1960, pp. xix–xxi). …
37: 28.1 Special Notation
The functions Mc n ( j ) ( z , h ) and Ms n ( j ) ( z , h ) are also known as the radial Mathieu functions. …
g e , n ( h ) ,
g o , n ( h ) ,
f e , n ( h ) ,
The radial functions Mc n ( j ) ( z , h ) and Ms n ( j ) ( z , h ) are denoted by Mc n ( j ) ( z , q ) and Ms n ( j ) ( z , q ) , respectively.
38: 32.7 Bäcklund Transformations
Let w j ( z j ) = w ( z j ; α j , β j , γ j , δ j ) , j = 0 , 1 , 2 , be solutions of P V  with … satisfies P V  with … Let w j ( z j ) = w j ( z j ; α j , β j , γ j , δ j ) , j = 0 , 1 , 2 , 3 , be solutions of P VI  with … P VI  also has quadratic and quartic transformations. …Also, …
39: 3.11 Approximation Techniques
Beginning with u n + 1 = 0 , u n = c n , we apply … With b 0 = 1 , the last q equations give b 1 , , b q as the solution of a system of linear equations. … (3.11.29) is a system of n + 1 linear equations for the coefficients a 0 , a 1 , , a n . … With this choice of a k and f j = f ( x j ) , the corresponding sum (3.11.32) vanishes. … Two are endpoints: ( x 0 , y 0 ) and ( x 3 , y 3 ) ; the other points ( x 1 , y 1 ) and ( x 2 , y 2 ) are control points. …
40: 22.7 Landen Transformations
22.7.2 sn ( z , k ) = ( 1 + k 1 ) sn ( z / ( 1 + k 1 ) , k 1 ) 1 + k 1 sn 2 ( z / ( 1 + k 1 ) , k 1 ) ,
22.7.4 dn ( z , k ) = dn 2 ( z / ( 1 + k 1 ) , k 1 ) ( 1 k 1 ) 1 + k 1 dn 2 ( z / ( 1 + k 1 ) , k 1 ) .
k 2 = 2 k 1 + k ,
k 2 = 1 k 1 + k ,
22.7.8 dn ( z , k ) = ( 1 k 2 ) ( dn 2 ( z / ( 1 + k 2 ) , k 2 ) + k 2 ) k 2 2 dn ( z / ( 1 + k 2 ) , k 2 ) .