TOPICS
Search

Search Results for ""


2571 - 2580 of 2823 for Unit distance graphSearch Results
An n-fold multimagic cube is a magic cube that remains magic when each element is squared, cubed, etc., up to nth power. (Of course, when the elements of a cube are taken to ...
The multinomial coefficients (n_1,n_2,...,n_k)!=((n_1+n_2+...+n_k)!)/(n_1!n_2!...n_k!) (1) are the terms in the multinomial series expansion. In other words, the number of ...
A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...
A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...
By way of analogy with the eban numbers, oban numbers are defined as numbers whose English names do not contain the letter "o" (i.e., "o" is banned). Note that this ...
A linkage invented in 1630 by Christoph Scheiner for making a scaled copy of a given figure. The linkage is pivoted at O; hinges are denoted circledot . By placing a pencil ...
Two lines in two-dimensional Euclidean space are said to be parallel if they do not intersect. In three-dimensional Euclidean space, parallel lines not only fail to ...
A permutation of n distinct, ordered items in which none of the items is in its original ordered position is known as a derangement. If some, but not necessarily all, of the ...
A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...
A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...
1 ... 255|256|257|258|259|260|261 ... 283 Previous Next

...