About the Project

Schr%C3%order%20numbers

AdvancedHelp

(0.007 seconds)

1—10 of 434 matching pages

1: 28.12 Definitions and Basic Properties
The introduction to the eigenvalues and the functions of general order proceeds as in §§28.2(i), 28.2(ii), and 28.2(iii), except that we now restrict ν ^ 0 , 1 ; equivalently ν n . …
§28.12(ii) Eigenfunctions me ν ( z , q )
For q = 0 , …
2: 28.2 Definitions and Basic Properties
§28.2(vi) Eigenfunctions
3: 24.1 Special Notation
Bernoulli Numbers and Polynomials
The origin of the notation B n , B n ( x ) , is not clear. …
Euler Numbers and Polynomials
Its coefficients were first studied in Euler (1755); they were called Euler numbers by Raabe in 1851. The notations E n , E n ( x ) , as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …
4: 18.42 Software
For another listing of Web-accessible software for the functions in this chapter, see GAMS (class C3). …
5: Bibliography S
  • L. Z. Salchev and V. B. Popov (1976) A property of the zeros of cross-product Bessel functions of different orders. Z. Angew. Math. Mech. 56 (2), pp. 120–121.
  • B. Simon (1982) Large orders and summability of eigenvalue perturbation theory: A mathematical overview. Int. J. Quantum Chem. 21, pp. 3–25.
  • G. Szegő (1933) Asymptotische Entwicklungen der Jacobischen Polynome. Schr. der König. Gelehr. Gesell. Naturwiss. Kl. 10, pp. 33–112.
  • R. Szmytkowski (2009) On the derivative of the associated Legendre function of the first kind of integer degree with respect to its order (with applications to the construction of the associated Legendre function of the second kind of integer degree and order). J. Math. Chem. 46 (1), pp. 231–260.
  • R. Szmytkowski (2011) On the derivative of the associated Legendre function of the first kind of integer order with respect to its degree (with applications to the construction of the associated Legendre function of the second kind of integer degree and order). J. Math. Chem. 49 (7), pp. 1436–1477.
  • 6: 27.2 Functions
    Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … (See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) … …It is the special case k = 2 of the function d k ( n ) that counts the number of ways of expressing n as the product of k factors, with the order of factors taken into account. …
    §27.2(ii) Tables
    7: 26.14 Permutations: Order Notation
    §26.14 Permutations: Order Notation
    The set 𝔖 n 26.13) can be viewed as the collection of all ordered lists of elements of { 1 , 2 , , n } : { σ ( 1 ) σ ( 2 ) σ ( n ) } . … The Eulerian number, denoted n k , is the number of permutations in 𝔖 n with exactly k descents. …
    §26.14(iii) Identities
    8: 26.13 Permutations: Cycle Notation
    In cycle notation, the elements in each cycle are put inside parentheses, ordered so that σ ( j ) immediately follows j or, if j is the last listed element of the cycle, then σ ( j ) is the first element of the cycle. … The Stirling cycle numbers of the first kind, denoted by [ n k ] , count the number of permutations of { 1 , 2 , , n } with exactly k cycles. They are related to Stirling numbers of the first kind by …See §26.8 for generating functions, recurrence relations, identities, and asymptotic approximations. … The derangement number, d ( n ) , is the number of elements of 𝔖 n with no fixed points: …
    9: 6.16 Mathematical Applications
    §6.16(ii) Number-Theoretic Significance of li ( x )
    If we assume Riemann’s hypothesis that all nonreal zeros of ζ ( s ) have real part of 1 2 25.10(i)), then
    6.16.5 li ( x ) π ( x ) = O ( x ln x ) , x ,
    where π ( x ) is the number of primes less than or equal to x . …
    See accompanying text
    Figure 6.16.2: The logarithmic integral li ( x ) , together with vertical bars indicating the value of π ( x ) for x = 10 , 20 , , 1000 . Magnify
    10: 26.2 Basic Definitions
    Given a finite set S with permutation σ , a cycle is an ordered equivalence class of elements of S where j is equivalent to k if there exists an = ( j , k ) such that j = σ ( k ) , where σ 1 = σ and σ is the composition of σ with σ 1 . It is ordered so that σ ( j ) follows j . … The total number of partitions of n is denoted by p ( n ) . …
    Table 26.2.1: Partitions p ( n ) .
    n p ( n ) n p ( n ) n p ( n )
    3 3 20 627 37 21637