Search Results for ""

An integer-relation algorithm which is based on a partial sum of squares approach, from which the algorithm takes its name.

The P versus NP problem is the determination of whether all NP-problems are actually P-problems. If P and NP are not equivalent, then the solution of NP-problems requires (in ...

The placement of objects so that they touch in some specified manner, often inside a container with specified properties. For example, one could consider a sphere packing, ...

A set of two numbers or objects linked in some way is said to be a pair. The pair a and b is usually denoted (a, b), and is generally considered to be ordered, making it a ...

The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...

Given any set B, the associated pair groupoid is the set B×B with the maps alpha(a,b)=a and beta(a,b)=b, and multiplication (a,b)·(b,c)=(a,c). The inverse is ...

Given two paired sets X_i and Y_i of n measured values, the paired t-test determines whether they differ from each other in a significant way under the assumptions that the ...

Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...

A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...

A pandiagonal perfect magic cube is a perfect magic cube that remains perfect when any single orthogonal section is "restacked" cyclically so that the ordering of any set of ...