Search Results for ""

Some computations allow shortcuts which can be used to speed them up. Consider the operation of raising a number to a positive integer power. It is possible, for example, to ...

Condorcet's jury theorem states that given a group of voters (a "jury") independently choosing by majority vote between a correct outcome with probability 0<=p<=1 and an ...

There are at least two meanings on the word congruent in mathematics. Two geometric figures are said to be congruent if one can be transformed into the other by an isometry ...

Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...

A product of ANDs, denoted ^ _(k=1)^nA_k. The conjunctions of a Boolean algebra A of subsets of cardinality p are the 2^p functions A_lambda= union _(i in lambda)A_i, where ...

A topological space decomposes into its connected components. The connectedness relation between two pairs of points satisfies transitivity, i.e., if a∼b and b∼c then a∼c. ...

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 ...