About the Project

Cash App Wallet Phone☎️+1(888‒481‒4477)☎️ "Number"

AdvancedHelp

(0.002 seconds)

31—40 of 224 matching pages

31: 26.17 The Twelvefold Way
The twelvefold way gives the number of mappings f from set N of n objects to set K of k objects (putting balls from set N into boxes in set K ). …In this table ( k ) n is Pochhammer’s symbol, and S ( n , k ) and p k ( n ) are defined in §§26.8(i) and 26.9(i). …
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 )
32: Bibliography F
  • H. E. Fettis and J. C. Caslin (1964) Tables of Elliptic Integrals of the First, Second, and Third Kind. Technical report Technical Report ARL 64-232, Aerospace Research Laboratories, Wright-Patterson Air Force Base, Ohio.
  • H. E. Fettis and J. C. Caslin (1969) A Table of the Complete Elliptic Integral of the First Kind for Complex Values of the Modulus. Part I. Technical report Technical Report ARL 69-0172, Aerospace Research Laboratories, Office of Aerospace Research, Wright-Patterson Air Force Base, Ohio.
  • S. Fillebrown (1992) Faster computation of Bernoulli numbers. J. Algorithms 13 (3), pp. 431–445.
  • Y. V. Fyodorov (2005) Introduction to the Random Matrix Theory: Gaussian Unitary Ensemble and Beyond. In Recent Perspectives in Random Matrix Theory and Number Theory, London Math. Soc. Lecture Note Ser., Vol. 322, pp. 31–78.
  • 33: 24.20 Tables
    §24.20 Tables
    Wagstaff (1978) gives complete prime factorizations of N n and E n for n = 20 ( 2 ) 60 and n = 8 ( 2 ) 42 , respectively. …
    34: 24.9 Inequalities
    §24.9 Inequalities
    24.9.1 | B 2 n | > | B 2 n ( x ) | , 1 > x > 0 ,
    24.9.2 ( 2 2 1 2 n ) | B 2 n | | B 2 n ( x ) B 2 n | , 1 x 0 .
    24.9.3 4 n | E 2 n | > ( 1 ) n E 2 n ( x ) > 0 ,
    24.9.6 5 π n ( n π e ) 2 n > ( 1 ) n + 1 B 2 n > 4 π n ( n π e ) 2 n ,
    35: 4.19 Maclaurin Series and Laurent Series
    In (4.19.3)–(4.19.9), B n are the Bernoulli numbers and E n are the Euler numbers (§§24.2(i)24.2(ii)).
    4.19.3 tan z = z + z 3 3 + 2 15 z 5 + 17 315 z 7 + + ( 1 ) n 1 2 2 n ( 2 2 n 1 ) B 2 n ( 2 n ) ! z 2 n 1 + , | z | < 1 2 π ,
    4.19.4 csc z = 1 z + z 6 + 7 360 z 3 + 31 15120 z 5 + + ( 1 ) n 1 2 ( 2 2 n 1 1 ) B 2 n ( 2 n ) ! z 2 n 1 + , 0 < | z | < π ,
    4.19.5 sec z = 1 + z 2 2 + 5 24 z 4 + 61 720 z 6 + + ( 1 ) n E 2 n ( 2 n ) ! z 2 n + , | z | < 1 2 π ,
    4.19.6 cot z = 1 z z 3 z 3 45 2 945 z 5 ( 1 ) n 1 2 2 n B 2 n ( 2 n ) ! z 2 n 1 , 0 < | z | < π ,
    36: 27.16 Cryptography
    §27.16 Cryptography
    The primes are kept secret but their product n = p q , an 800-digit number, is made public. …With the most efficient computer techniques devised to date (2010), factoring an 800-digit number may require billions of years on a single computer. For this reason, the codes are considered unbreakable, at least with the current state of knowledge on factoring large numbers. … Thus, y x r ( mod n ) and 1 y < n . …
    37: 27.21 Tables
    §27.21 Tables
    Bressoud and Wagon (2000, pp. 103–104) supplies tables and graphs that compare π ( x ) , x / ln x , and li ( x ) . … Lehmer (1941) gives a comprehensive account of tables in the theory of numbers, including virtually every table published from 1918 to 1941. … No sequel to Lehmer (1941) exists to date, but many tables of functions of number theory are included in Unpublished Mathematical Tables (1944).
    38: 24.4 Basic Properties
    §24.4(iv) Finite Expansions
    24.4.15 B 2 n = 2 n 2 2 n ( 2 2 n 1 ) k = 0 n 1 ( 2 n 1 2 k ) E 2 k ,
    24.4.16 E 2 n = 1 2 n + 1 k = 1 n ( 2 n 2 k 1 ) 2 2 k ( 2 2 k 1 1 ) B 2 k k ,
    §24.4(ix) Relations to Other Functions
    For the relation of Bernoulli numbers to the Riemann zeta function see §25.6, and to the Eulerian numbers see (26.14.11).
    39: 24.2 Definitions and Generating Functions
    §24.2 Definitions and Generating Functions
    §24.2(i) Bernoulli Numbers and Polynomials
    §24.2(ii) Euler Numbers and Polynomials
    Table 24.2.1: Bernoulli and Euler numbers.
    n B n E n
    40: 27.14 Unrestricted Partitions
    Euler’s pentagonal number theorem states that …where the exponents 1 , 2 , 5 , 7 , 12 , 15 , are the pentagonal numbers, defined by … For example, the Ramanujan identity …
    §27.14(vi) Ramanujan’s Tau Function