Search Results for ""

A cryptarithmetic in which the letters used to represent distinct digits are derived from related words or meaningful phrases. The term was coined by Hunter in 1955 (Madachy ...

There exists a system of distinct representatives for a family of sets S_1, S_2, ..., S_m iff the union of any k of these sets contains at least k elements for all k from 1 ...

Two numbers are heterogeneous if their prime factors are distinct. For example, 6=2·3 and 24=2^3·3 are not heterogeneous since their factors are each (2, 3).

Let S={x_1,...,x_n} be a set of n distinct positive integers. Then the matrix [S]_n having the least common multiple LCM(x_i,x_j) of x_i and x_j as its i,jth entry is called ...

The term "nonisomorphic" means "not having the same form" and is used in many branches of mathematics to identify mathematical objects which are structurally distinct. ...

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

Three point geometry is a finite geometry subject to the following four axioms: 1. There exist exactly three points. 2. Two distinct points are on exactly one line. 3. Not ...

A graph G having chromatic number gamma(G)=k is called a k-chromatic graph (Harary 1994, p. 127). In contrast, a graph having gamma(G)<=k is said to be a k-colorable graph. A ...

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...