mathematics algorithms


  • chebyshev distance

    In mathematics, Chebyshev distance (or Tchebychev distance ), maximum metric, or L metric is a metric defined on a vector space where the distance between two vectors is the greatest of their differences along any coordinate dimension. It is named ...

  • convex hull

    Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science . In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, ...

  • derivative

    The derivative of a function of a real variable measures the sensitivity to change of a quantity (a function value or dependent variable ) which is determined by another quantity (the independent variable ). Derivatives are a fundamental tool of ...

  • egyptian fractions

    An Egyptian fraction is a finite series of distinct unit fractions, such as. That is, each fraction in the expression has a numerator equal to 1 and a denominator that is a positive integer, and all the denominators differ from each other. The value ...

  • euclidean distance

    In mathematics, the Euclidean distance or Euclidean metric is the ordinary (i.e straight line) distance between two points in Euclidean space. With this distance, Euclidean space becomes a metric space. The associated norm is called the Euclidean ...

  • factorial

    In mathematics, the factorial of a non-negative integer n, denoted by n !, is the product of all positive integers less than or equal to n. For example, The value of 0! is 1, according to the convention for an empty product. The factorial ...