Search Results for ""

Assume that n numbered pancakes are stacked, and that a spatula can be used to reverse the order of the top k pancakes for 2<=k<=n. Then the pancake sorting problem asks how ...

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...

Greater than any assignable quantity of the sort in question. In mathematics, the concept of the infinite is made more precise through the notion of an infinite set.

A prime factorization algorithm.

A q-analog of Zeilberger's algorithm.

A lag system, introduced by Wang (1963), is a sort of opposite to a tag system. Lag systems allow dependence on more than just the first element, but remove only the first ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

A definition assigns properties to some sort of mathematical object. For example, Euclid's Elements starts with a number of definitions, such as "a line is a breadthless ...

The sum of the first n odd numbers is a square number, sum_(k=1)^n(2k-1)=n^2. A sort of converse also exists, namely the difference of the nth and (n-1)st square numbers is ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...