About the Project
NIST

Jordan function

AdvancedHelp

(0.001 seconds)

1—10 of 11 matching pages

1: 27.2 Functions
27.2.11 J k ( n ) = ( ( d 1 , , d k ) , n ) = 1 1 ,
This is Jordan’s function. …
2: 27.6 Divisor Sums
27.6.7 d | n μ ( d ) ( n d ) k = J k ( n ) ,
27.6.8 d | n J k ( d ) = n k .
3: 5.16 Sums
§5.16 Sums
5.16.2 k = 1 1 k ψ ( k + 1 ) = ζ ( 3 ) = - 1 2 ψ ′′ ( 1 ) .
For further sums involving the psi function see Hansen (1975, pp. 360–367). For sums of gamma functions see Andrews et al. (1999, Chapters 2 and 3) and §§15.2(i), 16.2. For related sums involving finite field analogs of the gamma and beta functions (Gauss and Jacobi sums) see Andrews et al. (1999, Chapter 1) and Terras (1999, pp. 90, 149).
4: 4.18 Inequalities
Jordan’s Inequality
5: 27.3 Multiplicative Properties
27.3.4 J k ( n ) = n k p | n ( 1 - p - k ) ,
6: Peter L. Walker
Walker’s published work has been mainly in real and complex analysis, with excursions into analytic number theory and geometry, the latter in collaboration with Professor Mowaffaq Hajja of the University of Jordan. Walker’s books are An Introduction to Complex Analysis, published by Hilger in 1974, The Theory of Fourier Series and Integrals, published by Wiley in 1986, Elliptic Functions. A Constructive Approach, published by Wiley in 1996, and Examples and Theorems in Analysis, published by Springer in 2004. …
  • 7: 24.17 Mathematical Applications
    Then with the notation of §24.2(iii)See Milne-Thomson (1933), Nörlund (1924), or Jordan (1965). …
    §24.17(ii) Spline Functions
    The functions
    Bernoulli Monosplines
    8: Bibliography J
  • D. L. Jagerman (1974) Some properties of the Erlang loss function. Bell System Tech. J. 53, pp. 525–551.
  • D. S. Jones (2001) Asymptotics of the hypergeometric function. Math. Methods Appl. Sci. 24 (6), pp. 369–389.
  • D. S. Jones (2006) Parabolic cylinder functions of large order. J. Comput. Appl. Math. 190 (1-2), pp. 453–469.
  • C. Jordan (1939) Calculus of Finite Differences. Hungarian Agent Eggenberger Book-Shop, Budapest.
  • C. Jordan (1965) Calculus of Finite Differences. 3rd edition, AMS Chelsea, Providence, RI.
  • 9: 26.8 Set Partitions: Stirling Numbers
    §26.8(ii) Generating Functions
    26.8.8 n = 0 s ( n , k ) x n n ! = ( ln ( 1 + x ) ) k k ! , | x | < 1 ,
    26.8.13 n , k = 0 S ( n , k ) x n n ! y k = exp ( y ( e x - 1 ) ) .
    10: 26.1 Special Notation
    (For other notation see Notation for the Special Functions.) … The main functions treated in this chapter are:
    ( m n )

    binomial coefficient.

    p ( n )

    number of partitions of n .

    Other notations for s ( n , k ) , the Stirling numbers of the first kind, include S n ( k ) (Abramowitz and Stegun (1964, Chapter 24), Fort (1948)), S n k (Jordan (1939), Moser and Wyman (1958a)), ( n - 1 k - 1 ) B n - k ( n ) (Milne-Thomson (1933)), ( - 1 ) n - k S 1 ( n - 1 , n - k ) (Carlitz (1960), Gould (1960)), ( - 1 ) n - k [ n k ] (Knuth (1992), Graham et al. (1994), Rosen et al. (2000)). Other notations for S ( n , k ) , the Stirling numbers of the second kind, include 𝒮 n ( k ) (Fort (1948)), 𝔖 n k (Jordan (1939)), σ n k (Moser and Wyman (1958b)), ( n k ) B n - k ( - k ) (Milne-Thomson (1933)), S 2 ( k , n - k ) (Carlitz (1960), Gould (1960)), { n k } (Knuth (1992), Graham et al. (1994), Rosen et al. (2000)), and also an unconventional symbol in Abramowitz and Stegun (1964, Chapter 24).