Search Results for ""

A number which can be represented by a finite number of additions, subtractions, multiplications, divisions, and finite square root extractions of integers. Such numbers ...

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

A sequence is said to be convergent if it approaches some limit (D'Angelo and West 2000, p. 259). Formally, a sequence S_n converges to the limit S lim_(n->infty)S_n=S if, ...

The automorphism group Co_1 of the Leech lattice modulo a center of order two is called "the" Conway group. There are 15 exceptional conjugacy classes of the Conway group. ...

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...

Define the correlation integral as C(epsilon)=lim_(N->infty)1/(N^2)sum_(i,j=1; i!=j)^inftyH(epsilon-|x_i-x_j|), (1) where H is the Heaviside step function. When the below ...

For a subgroup H of a group G and an element x of G, define xH to be the set {xh:h in H} and Hx to be the set {hx:h in H}. A subset of G of the form xH for some x in G is ...

The cototient of a positive number n is defined as n-phi(n), where n is the totient function. It is therefore the number of positive integers <=n that have at least one prime ...

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess countable monotonicity provided that, whenever a set E in S is covered by ...

Any set which can be put in a one-to-one correspondence with the natural numbers (or integers) so that a prescription can be given for identifying its members one at a time ...