Search Results for ""
6821 - 6830 of 13135 for Combinatorial MathematicsSearch Results
Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...
An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...
An even permutation is a permutation obtainable from an even number of two-element swaps, i.e., a permutation with permutation symbol equal to +1. For initial set {1,2,3,4}, ...
A functor between categories of groups or modules is called exact if it preserves the exactness of sequences, or equivalently, if it transforms short exact sequences into ...
A shuffle of a deck of cards obtained by successively exchanging the cards in position 1, 2, ..., n with cards in randomly chosen positions. For 4<=n<=17, the most frequent ...
A theorem stating the existence of an object, such as the solution to a problem or equation. Strictly speaking, it need not tell how many such objects there are, nor give ...
In predicate calculus, an existential formula is a prenex normal form formula (i.e., a formula written as a string of quantifiers and bound variables followed by a ...
An existential sentence is a statement claiming the existence of an object with given properties. In the language of set theory it can be formulated as follows, exists x in U ...
A subset F subset R of the real numbers is said to be an F_sigma set provided F is the countable union of closed sets. The name F_sigma comes from French: The F stands for ...
A variation of chess involving a change in the form of the board, the rules of play, or the pieces used. For example, the normal rules of chess can be used but with a ...
...
View search results from all Wolfram sites (60124 matches)

