About the Project

Fibonacci%20numbers

AdvancedHelp

(0.001 seconds)

11—20 of 274 matching pages

11: 26.13 Permutations: Cycle Notation
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: … A permutation is even or odd according to the parity of the number of transpositions. …
12: 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. …
  • 13: 20 Theta Functions
    Chapter 20 Theta Functions
    14: 18.5 Explicit Representations
    In (18.5.4_5) see §26.11 for the Fibonacci numbers F n . …
    T 5 ( x ) = 16 x 5 20 x 3 + 5 x ,
    L 6 ( x ) = 1 720 x 6 1 20 x 5 + 5 8 x 4 10 3 x 3 + 15 2 x 2 6 x + 1 .
    15: 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
    16: Bibliography H
  • K. Horata (1989) An explicit formula for Bernoulli numbers. Rep. Fac. Sci. Technol. Meijo Univ. 29, pp. 1–6.
  • K. Horata (1991) On congruences involving Bernoulli numbers and irregular primes. II. Rep. Fac. Sci. Technol. Meijo Univ. 31, pp. 1–8.
  • F. T. Howard (1996a) Explicit formulas for degenerate Bernoulli numbers. Discrete Math. 162 (1-3), pp. 175–185.
  • F. T. Howard (1996b) Sums of powers of integers via generating functions. Fibonacci Quart. 34 (3), pp. 244–256.
  • I. Huang and S. Huang (1999) Bernoulli numbers and polynomials via residues. J. Number Theory 76 (2), pp. 178–193.
  • 17: Tom M. Apostol
    Apostol was born on August 20, 1923. … He was internationally known for his textbooks on calculus, analysis, and analytic number theory, which have been translated into five languages, and for creating Project MATHEMATICS!, a series of video programs that bring mathematics to life with computer animation, live action, music, and special effects. … In 1998, the Mathematical Association of America (MAA) awarded him the annual Trevor Evans Award, presented to authors of an exceptional article that is accessible to undergraduates, for his piece entitled “What Is the Most Surprising Result in Mathematics?” (Answer: the prime number theorem). …
  • 18: 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
    19: 26.9 Integer Partitions: Restricted Number and Part Size
    §26.9 Integer Partitions: Restricted Number and Part Size
    p k ( n ) denotes the number of partitions of n into at most k parts. See Table 26.9.1. … It follows that p k ( n ) also equals the number of partitions of n into parts that are less than or equal to k . …
    20: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
    ( n n 1 , n 2 , , n k ) is the number of ways of placing n = n 1 + n 2 + + n k distinct objects into k labeled boxes so that there are n j objects in the j th box. It is also the number of k -dimensional lattice paths from ( 0 , 0 , , 0 ) to ( n 1 , n 2 , , n k ) . … M 2 is the number of permutations of { 1 , 2 , , n } with a 1 cycles of length 1, a 2 cycles of length 2, , and a n cycles of length n :
    26.4.7 M 2 = n ! 1 a 1 ( a 1 ! )  2 a 2 ( a 2 ! ) n a n ( a n ! ) .
    M 3 is the number of set partitions of { 1 , 2 , , n } with a 1 subsets of size 1, a 2 subsets of size 2, , and a n subsets of size n : …