About the Project

zelle support number +1(888‒858‒1410)

AdvancedHelp

Did you mean zelene support number +1(888‒858‒1410) ?

(0.011 seconds)

1—10 of 83 matching pages

1: 31.14 General Fuchsian Equation
The general second-order Fuchsian equation with N + 1 regular singularities at z = a j , j = 1 , 2 , , N , and at , is given by
31.14.1 d 2 w d z 2 + ( j = 1 N γ j z a j ) d w d z + ( j = 1 N q j z a j ) w = 0 , j = 1 N q j = 0 .
31.14.3 w ( z ) = ( j = 1 N ( z a j ) γ j / 2 ) W ( z ) ,
31.14.4 d 2 W d z 2 = j = 1 N ( γ ~ j ( z a j ) 2 + q ~ j z a j ) W , j = 1 N q ~ j = 0 ,
2: Customize DLMF
Note: Javascript and Cookies must be enabled to support customizations.
3: 31.15 Stieltjes Polynomials
31.15.2 j = 1 N γ j / 2 z k a j + j = 1 j k n 1 z k z j = 0 , k = 1 , 2 , , n .
31.15.3 j = 1 N γ j t k a j + j = 1 n 1 1 t k z j = 0 .
31.15.6 a j < a j + 1 , j = 1 , 2 , , N 1 ,
31.15.8 S 𝐦 ( z 1 ) S 𝐦 ( z 2 ) S 𝐦 ( z N 1 ) , z j ( a j , a j + 1 ) ,
4: About MathML
, built-in to the browser) support for MathML is growing, (see Browsers supporting MathML). …
Browsers supporting MathML
The Firefox browser has traditionally had the strongest support for MathML and its native MathML is used by default. Recent enhancements to the WebKit engine now provide support for MathML Core. … Most modern browsers support ‘Web Fonts’, fonts that are effectively included with a web site. …
5: 26.17 The Twelvefold Way
Table 26.17.1: The twelvefold way.
elements of N elements of K f unrestricted f one-to-one f onto
labeled labeled k n ( k n + 1 ) n k ! S ( n , k )
labeled unlabeled S ( n , 1 ) + S ( n , 2 ) + + S ( n , k ) { 1 n k 0 n > k S ( n , k )
6: 26.11 Integer Partitions: Compositions
For example, there are eight compositions of 4: 4 , 3 + 1 , 1 + 3 , 2 + 2 , 2 + 1 + 1 , 1 + 2 + 1 , 1 + 1 + 2 , and 1 + 1 + 1 + 1 . c ( n ) denotes the number of compositions of n , and c m ( n ) is the number of compositions into exactly m parts. c ( T , n ) is the number of compositions of n with no 1’s, where again T = { 2 , 3 , 4 , } . … The Fibonacci numbers are determined recursively by … Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).
7: 26.5 Lattice Paths: Catalan Numbers
26.5.1 C ( n ) = 1 n + 1 ( 2 n n ) = 1 2 n + 1 ( 2 n + 1 n ) = ( 2 n n ) ( 2 n n 1 ) = ( 2 n 1 n ) ( 2 n 1 n + 1 ) .
26.5.3 C ( n + 1 ) = k = 0 n C ( k ) C ( n k ) ,
26.5.4 C ( n + 1 ) = 2 ( 2 n + 1 ) n + 2 C ( n ) ,
26.5.5 C ( n + 1 ) = k = 0 n / 2 ( n 2 k ) 2 n 2 k C ( k ) .
26.5.7 lim n C ( n + 1 ) C ( n ) = 4 .
8: 27.18 Methods of Computation: Primes
These algorithms are used for testing primality of Mersenne numbers, 2 n 1 , and Fermat numbers, 2 2 n + 1 . …
9: Viewing DLMF Interactive 3D Graphics
WebGL is supported in the current versions of most common web browsers. … 1, some advanced features of X3DOM are currently not fully supported (see x3dom.org). …If you have trouble viewing the WebGL visualizations in your web browser, see x3dom.org or caniuse.com/webgl for information on WebGL browser support. … Please see caniuse.com/webgl or x3dom.org for information on WebGL browser support.
10: 35 Functions of Matrix Argument