About the Project

%E4%BA%94%E5%AD%90%E6%A3%8B%E6%B8%B8%E6%88%8F%E5%A4%A7%E5%8E%85,%E7%BD%91%E4%B8%8A%E4%BA%94%E5%AD%90%E6%A3%8B%E6%B8%B8%E6%88%8F%E8%A7%84%E5%88%99,%E3%80%90%E5%A4%8D%E5%88%B6%E6%89%93%E5%BC%80%E7%BD%91%E5%9D%80%EF%BC%9A33kk55.com%E3%80%91%E6%AD%A3%E8%A7%84%E5%8D%9A%E5%BD%A9%E5%B9%B3%E5%8F%B0,%E5%9C%A8%E7%BA%BF%E8%B5%8C%E5%8D%9A%E5%B9%B3%E5%8F%B0,%E4%BA%94%E5%AD%90%E6%A3%8B%E6%B8%B8%E6%88%8F%E7%8E%A9%E6%B3%95%E4%BB%8B%E7%BB%8D,%E7%9C%9F%E4%BA%BA%E4%BA%94%E5%AD%90%E6%A3%8B%E6%B8%B8%E6%88%8F%E8%A7%84%E5%88%99,%E7%BD%91%E4%B8%8A%E7%9C%9F%E4%BA%BA%E6%A3%8B%E7%89%8C%E6%B8%B8%E6%88%8F%E5%B9%B3%E5%8F%B0,%E7%9C%9F%E4%BA%BA%E5%8D%9A%E5%BD%A9%E6%B8%B8%E6%88%8F%E5%B9%B3%E5%8F%B0%E7%BD%91%E5%9D%80YyMsyAAMsACBVXCh

AdvancedHelp

(0.073 seconds)

21—30 of 674 matching pages

21: 2.10 Sums and Sequences
For extensions to α 0 , higher terms, and other examples, see Olver (1997b, Chapter 8). … Hence … For generalizations and other examples see Olver (1997b, Chapter 8), Ford (1960), and Berndt and Evans (1984). … For examples see Olver (1997b, Chapters 8, 9). … For other examples and extensions see Olver (1997b, Chapter 8), Olver (1970), Wong (1989, Chapter 2), and Wong and Wyman (1974). …
22: Bibliography K
  • K. W. J. Kadell (1994) A proof of the q -Macdonald-Morris conjecture for B C n . Mem. Amer. Math. Soc. 108 (516), pp. vi+80.
  • M. Kaneko (1997) Poly-Bernoulli numbers. J. Théor. Nombres Bordeaux 9 (1), pp. 221–228.
  • R. B. Kearfott (1996) Algorithm 763: INTERVAL_ARITHMETIC: A Fortran 90 module for an interval data type. ACM Trans. Math. Software 22 (4), pp. 385–392.
  • T. H. Koornwinder (1992) Askey-Wilson Polynomials for Root Systems of Type B C . In Hypergeometric Functions on Domains of Positivity, Jack Polynomials, and Applications (Tampa, FL, 1991), Contemp. Math., Vol. 138, pp. 189–204.
  • E. Kreyszig (1957) On the zeros of the Fresnel integrals. Canad. J. Math. 9, pp. 118–131.
  • 23: 18.38 Mathematical Applications
    For the generalized hypergeometric function F 2 3 see (16.2.1). … See, for example, Andrews et al. (1999, Chapter 9). … The 3 j symbol (34.2.6), with an alternative expression as a terminating F 2 3 of unit argument, can be expressed in terms of Hahn polynomials (18.20.5) or, by (18.21.1), dual Hahn polynomials. … The 6 j symbol (34.4.3), with an alternative expression as a terminating balanced F 3 4 of unit argument, can be expressend in terms of Racah polynomials (18.26.3). … The abstract associative algebra with generators K 0 , K 1 , K 2 and relations (18.38.4), (18.38.6) and with the constants B , C 0 , C 1 , D 0 , D 1 in (18.38.6) not yet specified, is called the Zhedanov algebra or Askey–Wilson algebra AW(3). …
    24: 27.2 Functions
    27.2.9 d ( n ) = d | n 1
    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. …Note that σ 0 ( n ) = d ( n ) . … Table 27.2.2 tabulates the Euler totient function ϕ ( n ) , the divisor function d ( n ) ( = σ 0 ( n ) ), and the sum of the divisors σ ( n ) ( = σ 1 ( n ) ), for n = 1 ( 1 ) 52 . …
    Table 27.2.2: Functions related to division.
    n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n )
    10 4 4 18 23 22 2 24 36 12 9 91 49 42 3 57
    25: 23.20 Mathematical Applications
    An algebraic curve that can be put either into the form … Given P , calculate 2 P , 4 P , 8 P by doubling as above. …If any of 2 P , 4 P , 8 P is not an integer, then the point has infinite order. Otherwise observe any equalities between P , 2 P , 4 P , 8 P , and their negatives. The order of a point (if finite and not already determined) can have only the values 3, 5, 6, 7, 9, 10, or 12, and so can be found from 2 P = P , 4 P = P , 4 P = 2 P , 8 P = P , 8 P = P , 8 P = 2 P , or 8 P = 4 P . …
    26: 3.5 Quadrature
    If in addition f is periodic, f C k ( ) , and the integral is taken over a period, then … If f C 2 m + 2 [ a , b ] , then the remainder E n ( f ) in (3.5.2) can be expanded in the form … About 2 9 = 512 function evaluations are needed. … For further information, see Mason and Handscomb (2003, Chapter 8), Davis and Rabinowitz (1984, pp. 74–92), and Clenshaw and Curtis (1960). … For C functions Gauss quadrature can be very efficient. …
    27: Software Index
    28: 19.37 Tables
    Tabulated for ϕ = 0 ( 5 ) 90 , k 2 = 0 ( .01 ) 1 to 10D by Fettis and Caslin (1964). Tabulated for ϕ = 0 ( 1 ) 90 , k 2 = 0 ( .01 ) 1 to 7S by Beli͡akov et al. (1962). … Tabulated for ϕ = 0 ( 5 ) 90 , k = 0 ( .01 ) 1 to 10D by Fettis and Caslin (1964). Tabulated for ϕ = 0 ( 5 ) 90 , arcsin k = 0 ( 1 ) 90 to 6D by Byrd and Friedman (1971), for ϕ = 0 ( 5 ) 90 , arcsin k = 0 ( 2 ) 90 and 5 ( 10 ) 85 to 8D by Abramowitz and Stegun (1964, Chapter 17), and for ϕ = 0 ( 10 ) 90 , arcsin k = 0 ( 5 ) 90 to 9D by Zhang and Jin (1996, pp. 674–675). … Tabulated for ϕ = 5 ( 5 ) 80 ( 2.5 ) 90 , α 2 = 1 ( .1 ) 0.1 , 0.1 ( .1 ) 1 , k 2 = 0 ( .05 ) 0.9 ( .02 ) 1 to 10D by Fettis and Caslin (1964) (and warns of inaccuracies in Selfridge and Maxfield (1958) and Paxton and Rollin (1959)). …
    29: 18.6 Symmetry, Special Values, and Limits to Monomials
    Table 18.6.1: Classical OP’s: symmetry and special values.
    p n ( x ) p n ( x ) p n ( 1 ) p 2 n ( 0 ) p 2 n + 1 ( 0 )
    C n ( λ ) ( x ) ( 1 ) n C n ( λ ) ( x ) ( 2 λ ) n / n ! ( 1 ) n ( λ ) n / n ! 2 ( 1 ) n ( λ ) n + 1 / n !
    18.6.4 lim λ C n ( λ ) ( x ) C n ( λ ) ( 1 ) = x n ,
    30: 26.3 Lattice Paths: Binomial Coefficients
    Table 26.3.1: Binomial coefficients ( m n ) .
    m n
    0 1 2 3 4 5 6 7 8 9 10
    8 1 8 28 56 70 56 28 8 1
    9 1 9 36 84 126 126 84 36 9 1
    Table 26.3.2: Binomial coefficients ( m + n m ) for lattice paths.
    m n
    1 1 2 3 4 5 6 7 8 9
    8 1 9 45 165 495 1287 3003 6435 12870