About the Project

.今年世界杯对阵__『wn4.com_』_巴西世界杯梅西金球奖_w6n2c9o_2022年11月30日8时7分_lvhhtouai.com

AdvancedHelp

(0.009 seconds)

31—40 of 783 matching pages

31: 17.12 Bailey Pairs
β n = j = 0 n α j u n j v n + j ,
γ n = j = n δ j u j n v j + n .
A sequence of pairs of rational functions of several variables ( α n , β n ) , n = 0 , 1 , 2 , , is called a Bailey pair provided that for each n 0 If ( α n , β n ) is a Bailey pair, then … If ( α n , β n ) is a Bailey pair, then so is ( α n , β n ) , where …
32: 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. …
33: 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 ,
34: 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). …
35: 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 . …
36: 3.7 Ordinary Differential Equations
The path is partitioned at P + 1 points labeled successively z 0 , z 1 , , z P , with z 0 = a , z P = b . … Write τ j = z j + 1 z j , j = 0 , 1 , , P , expand w ( z ) and w ( z ) in Taylor series (§1.10(i)) centered at z = z j , and apply (3.7.2). … If, for example, β 0 = β 1 = 0 , then on moving the contributions of w ( z 0 ) and w ( z P ) to the right-hand side of (3.7.13) the resulting system of equations is not tridiagonal, but can readily be made tridiagonal by annihilating the elements of 𝐀 P that lie below the main diagonal and its two adjacent diagonals. … The values λ k are the eigenvalues and the corresponding solutions w k of the differential equation are the eigenfunctions. … where h = z n + 1 z n and …
37: 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 . …
38: 10.75 Tables
  • Achenbach (1986) tabulates J 0 ( x ) , J 1 ( x ) , Y 0 ( x ) , Y 1 ( x ) , x = 0 ( .1 ) 8 , 20D or 18–20S.

  • Zhang and Jin (1996, p. 199) tabulates the real and imaginary parts of the first 15 conjugate pairs of complex zeros of Y 0 ( z ) , Y 1 ( z ) , Y 1 ( z ) and the corresponding values of Y 1 ( z ) , Y 0 ( z ) , Y 1 ( z ) , respectively, 10D.

  • Abramowitz and Stegun (1964, Chapter 11) tabulates 0 x J 0 ( t ) d t , 0 x Y 0 ( t ) d t , x = 0 ( .1 ) 10 , 10D; 0 x t 1 ( 1 J 0 ( t ) ) d t , x t 1 Y 0 ( t ) d t , x = 0 ( .1 ) 5 , 8D.

  • Zhang and Jin (1996, p. 270) tabulates 0 x J 0 ( t ) d t , 0 x t 1 ( 1 J 0 ( t ) ) d t , 0 x Y 0 ( t ) d t , x t 1 Y 0 ( t ) d t , x = 0 ( .1 ) 1 ( .5 ) 20 , 8D.

  • Achenbach (1986) tabulates I 0 ( x ) , I 1 ( x ) , K 0 ( x ) , K 1 ( x ) , x = 0 ( .1 ) 8 , 19D or 19–21S.

  • 39: 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. …
    40: 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 ) .