recurrence relation

  • 91Tower of Hanoi — The Tower of Hanoi or Towers of Hanoi (also known as The Towers of Bramha) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks neatly …

    Wikipedia

  • 92Chebyshev equation — Chebyshev s equation is the second order linear differential equation where p is a real constant. The equation is named after Russian mathematician Pafnuty Chebyshev. The solutions are obtained by power series: where the coefficients obey the… …

    Wikipedia

  • 93Symbolic combinatorics — in mathematics is a technique of analytic combinatorics that uses symbolic representations of combinatorial classes to derive their generating functions. The underlying mathematics, including the Pólya enumeration theorem, are explained on the… …

    Wikipedia

  • 94Hypercube — This article is about the mathematical concept. For the film, see Cube 2: Hypercube. Perspective projections Cube (3 cube) Tesseract (4 cube) In geometry, a hypercube is an n dimensional analogue of a …

    Wikipedia

  • 95Dyadic transformation — xy plot where x = x0 ∈ [0, 1] is rational and y = xn for all n. The dyadic transformation (also known as the dyadic map, bit shift map, 2x mod 1 map, Bernoulli map, doubling map or sawtooth… …

    Wikipedia

  • 96Fundamental theorem of combinatorial enumeration — The fundamental theorem of combinatorial enumeration is a theorem in combinatorics that solves the enumeration problem of labelled and unlabelled combinatorial classes. The unlabelled case is based on the Pólya enumeration theorem.This theorem is …

    Wikipedia

  • 97Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …

    Wikipedia

  • 98Discrete mathematics — For the mathematics journal, see Discrete Mathematics (journal). Graphs like this are among the objects studied by discrete mathematics, for their interesting mathematical properties, their usefulness as models of real world problems, and their… …

    Wikipedia

  • 99Pell's equation — is any Diophantine equation of the form:x^2 ny^2=1,where n is a nonsquare integer and x and y are integers. Trivially, x = 1 and y = 0 always solve this equation. Lagrange proved that for any natural number n that is not a perfect square there… …

    Wikipedia

  • 100List of dynamical systems and differential equations topics — This is a list of dynamical system and differential equation topics, by Wikipedia page. See also list of partial differential equation topics, list of equations. Contents 1 Dynamical systems, in general 2 Abstract dynamical systems 3 …

    Wikipedia