recurrence relation

  • 81List of basic discrete mathematics topics — Discrete mathematics, also called finite mathematics, is the study of mathematical structures that are fundamentally , in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite… …

    Wikipedia

  • 82Fractal — A fractal is generally a rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced size copy of the whole, [cite book last = Mandelbrot first = B.B. title = The Fractal Geometry of… …

    Wikipedia

  • 83Polygamma function — In mathematics, the polygamma function of order m is defined as the ( m + 1)th derivative of the logarithm of the gamma function::psi^{(m)}(z) = left(frac{d}{dz} ight)^m psi(z) = left(frac{d}{dz} ight)^{m+1} lnGamma(z).Here :psi(z) =psi^{(0)}(z) …

    Wikipedia

  • 84Formula for primes — In mathematics, a formula for primes is a formula generating the prime numbers, exactly and without exception. No easily computable such formula is known. A great deal is known about what, more precisely, such a formula can and cannot be.Prime… …

    Wikipedia

  • 85Silver ratio — The silver ratio is a mathematical constant. Its name is an allusion to the golden ratio; analogously to the way the golden ratio is the limiting ratio of consecutive Fibonacci numbers, the silver ratio is the limiting ratio of consecutive Pell… …

    Wikipedia

  • 86Inverse quadratic interpolation — In numerical analysis, inverse quadratic interpolation is a root finding algorithm, meaning that it is an algorithm for solving equations of the form f ( x ) = 0. The idea is to use quadratic interpolation to approximate the inverse of f . This… …

    Wikipedia

  • 87Stiff equation — In mathematics, a stiff equation is a differential equation for which certain numerical methods for solving the equation are numerically unstable, unless the step size is taken to be extremely small. It has proven difficult to formulate a precise …

    Wikipedia

  • 88Boustrophedon transform — In mathematics, the boustrophedon transform is a procedure which maps one sequence to another. The transformed sequence is computed by filling a triangle in boustrophedon (zig zag) manner.DefinitionGiven a sequence (a 0, a 1, a 2, ldots), the… …

    Wikipedia

  • 89Thue–Morse sequence — See also: Prouhet–Thue–Morse constant 5 logical matrices that give the beginning of the T. M. sequence, when read line by line Either in set A (vertical index) …

    Wikipedia

  • 90Mersenne twister — The Mersenne twister is a pseudorandom number generator developed in 1997 by Makoto Matsumoto (松本 眞?) and Takuji Nishimura (西村 拓士?)[1] …

    Wikipedia