enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Catalan number - Wikipedia

    en.wikipedia.org/wiki/Catalan_number

    On the one hand, the recurrence relation uniquely determines the Catalan numbers; on the other hand, interpreting xc 2 − c + 1 = 0 as a quadratic equation of c and using the quadratic formula, the generating function relation can be algebraically solved to yield two solution possibilities

  3. Fuss–Catalan number - Wikipedia

    en.wikipedia.org/wiki/Fuss–Catalan_number

    Whilst the above is a concrete example Catalan numbers, similar problems can be evaluated using Fuss-Catalan formula: Computer Stack: ways of arranging and completing a computer stack of instructions, each time step 1 instruction is processed and p new instructions arrive randomly. If at the beginning of the sequence there are r instructions ...

  4. Cassini and Catalan identities - Wikipedia

    en.wikipedia.org/wiki/Cassini_and_Catalan_identities

    Cassini's formula was discovered in 1680 by Giovanni Domenico Cassini, then director of the Paris Observatory, and independently proven by Robert Simson (1753). [1] However Johannes Kepler presumably knew the identity already in 1608. [2] Catalan's identity is named after Eugène Catalan (1814–1894). It can be found in one of his private ...

  5. Catalan's triangle - Wikipedia

    en.wikipedia.org/wiki/Catalan's_triangle

    Catalan's trapezoids are a countable set of number trapezoids which generalize Catalan’s triangle. Catalan's trapezoid of order m = 1, 2, 3, ... is a number trapezoid whose entries (,) give the number of strings consisting of n X-s and k Y-s such that in every initial segment of the string the number of Y-s does not exceed the number of X-s by m or more. [6]

  6. Generating function - Wikipedia

    en.wikipedia.org/wiki/Generating_function

    6.2.1 Example: Generating function for the Catalan numbers 6.2.2 Example: Spanning trees of fans and convolutions of convolutions 6.3 Implicit generating functions and the Lagrange inversion formula

  7. Bijective proof - Wikipedia

    en.wikipedia.org/wiki/Bijective_proof

    Robinson-Schensted algorithm, giving a proof of Burnside's formula for the symmetric group. Conjugation of Young diagrams, giving a proof of a classical result on the number of certain integer partitions. Bijective proofs of the pentagonal number theorem. Bijective proofs of the formula for the Catalan numbers.

  8. List of mathematical series - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_series

    See Faulhaber's formula. ... , generating function of the Catalan numbers [3] = =, ... in constant time even when the series contains a large number of ...

  9. Catalan's constant - Wikipedia

    en.wikipedia.org/wiki/Catalan's_constant

    In number theory, Catalan's constant appears in a conjectured formula for the asymptotic number of primes of the form + according to Hardy and Littlewood's Conjecture F. However, it is an unsolved problem (one of Landau's problems) whether there are even infinitely many primes of this form. [9]