About the Project

products

AdvancedHelp

(0.001 seconds)

21—30 of 182 matching pages

21: 27.3 Multiplicative Properties
27.3.2 f ( n ) = r = 1 ν ( n ) f ( p r a r ) .
27.3.3 ϕ ( n ) = n p | n ( 1 p 1 ) ,
27.3.4 J k ( n ) = n k p | n ( 1 p k ) ,
27.3.5 d ( n ) = r = 1 ν ( n ) ( 1 + a r ) ,
27.3.10 f ( n ) = r = 1 ν ( n ) ( f ( p r ) ) a r .
22: 27.5 Inversion Formulas
If a Dirichlet series F ( s ) generates f ( n ) , and G ( s ) generates g ( n ) , then the product F ( s ) G ( s ) generates
27.5.1 h ( n ) = d | n f ( d ) g ( n d ) ,
called the Dirichlet product (or convolution) of f and g . …
27.5.8 g ( n ) = d | n f ( d ) f ( n ) = d | n ( g ( n d ) ) μ ( d ) .
23: 23.1 Special Notation
𝕃 lattice in .
G × H Cartesian product of groups G and H , that is, the set of all pairs of elements ( g , h ) with group operation ( g 1 , h 1 ) + ( g 2 , h 2 ) = ( g 1 + g 2 , h 1 + h 2 ) .
24: 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. … Their product m has 20 digits, twice the number of digits in the data. …
25: 1.3 Determinants, Linear Operators, and Spectral Expansions
The determinant of an upper or lower triangular, or diagonal, square matrix 𝐀 is the product of the diagonal elements det ( 𝐀 ) = i = 1 n a i i . …
1.3.14 det [ 1 a j b k ] = ( 1 ) n ( n 1 ) / 2 1 j < k n ( a k a j ) ( b k b j ) / j , k = 1 n ( a j b k ) .
1.3.17 det [ t j k ] = 1 j < k n ( x j x k ) 2 j k n ( b j a k ) .
The adjoint of a matrix 𝐀 is the matrix 𝐀 such that 𝐀 𝐚 , 𝐛 = 𝐚 , 𝐀 𝐛 for all 𝐚 , 𝐛 𝐄 n . …
1.3.20 𝐮 = i = 1 n c i 𝐚 i , c i = 𝐮 , 𝐚 i .
26: 16.18 Special Cases
16.18.1 F q p ( a 1 , , a p b 1 , , b q ; z ) = ( k = 1 q Γ ( b k ) / k = 1 p Γ ( a k ) ) G p , q + 1 1 , p ( z ; 1 a 1 , , 1 a p 0 , 1 b 1 , , 1 b q ) = ( k = 1 q Γ ( b k ) / k = 1 p Γ ( a k ) ) G q + 1 , p p , 1 ( 1 z ; 1 , b 1 , , b q a 1 , , a p ) .
27: 24.19 Methods of Computation
24.19.1 N 2 n = 2 ( 2 n ) ! ( 2 π ) 2 n ( p 1 | 2 n p ) ( p p 2 n p 2 n 1 ) ,
D 2 n = p 1 | 2 n p ,
If N ~ 2 n denotes the right-hand side of (24.19.1) but with the second product taken only for p ( π e ) 1 2 n + 1 , then N 2 n = N ~ 2 n for n 2 . …
28: 10.5 Wronskians and Cross-Products
§10.5 Wronskians and Cross-Products
29: 25.15 Dirichlet L -functions
25.15.2 L ( s , χ ) = p ( 1 χ ( p ) p s ) 1 , s > 1 ,
with the product taken over all primes p , beginning with p = 2 . …
25.15.3 L ( s , χ ) = k s r = 1 k 1 χ ( r ) ζ ( s , r k ) ,
25.15.4 L ( s , χ ) = L ( s , χ 0 ) p | k ( 1 χ 0 ( p ) p s ) ,
30: 31.16 Mathematical Applications
§31.16(ii) Heun Polynomial Products
Expansions of Heun polynomial products in terms of Jacobi polynomial (§18.3) products are derived in Kalnins and Miller (1991a, b, 1993) from the viewpoint of interrelation between two bases in a Hilbert space: …