TOPICS
Search

Search Results for ""


2451 - 2460 of 13134 for Extremal graph theorySearch Results
If there is an integer x such that x^3=q (mod p), then q is said to be a cubic residue (mod p). If not, q is said to be a cubic nonresidue (mod p).
A linear code C is cyclic if for every codeword (c_0,c_1,...,c_(n-1)) in C, the codeword (c_(n-1),c_0,c_1,...,c_(n-2)) is also in C.
Given any real number theta and any positive integer N, there exist integers h and k with 0<k<=N such that |ktheta-h|<1/N. A slightly weaker form of the theorem states that ...
If, for n and d integers, the ratio n/d is itself an integer, then d is said to divide n. This relationship is written d|n, read "d divides n." In this case, n is also said ...
A term in social choice theory meaning each alternative receives equal weight for a single vote.
For any two ergodic measure-preserving transformations on nonatomic probability spaces, there is an isomorphism between the two probability spaces carrying orbits onto orbits.
If x is a member of a set A, then x is said to be an element of A, written x in A. If x is not an element of A, this is written x not in A. The term element also refers to a ...
A number which can be specified implicitly or explicitly by exponential, logarithmic, and algebraic operations.
A morphism f:Y->X in a category is an epimorphism if, for any two morphisms u,v:X->Z, uf=vf implies u=v. In the categories of sets, groups, modules, etc., an epimorphism is ...
A more common way to describe a Euclidean ring.
1 ... 243|244|245|246|247|248|249 ... 1314 Previous Next

...