Search Results for ""

A primitive Pythagorean triple is a Pythagorean triple (a,b,c) such that GCD(a,b,c)=1, where GCD is the greatest common divisor. A right triangle whose side lengths give a ...

A primitive right triangle is a right triangle having integer sides a, b, and c such that GCD(a,b,c)=1, where GCD(a,b,c) is the greatest common divisor. The set of values ...

Prince Rupert's cube is the largest cube that can be made to pass through a given cube. In other words, the cube having a side length equal to the side length of the largest ...

The probability Q_delta that a random sample from an infinite normally distributed universe will have a mean m within a distance |delta| of the mean mu of the universe is ...

The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...

Proper covers are defined as covers of a set X which do not contain the entire set X itself as a subset (Macula 1994). Of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

A subfield which is strictly smaller than the field in which it is contained. The field of rationals Q is a proper subfield of the field of real numbers R which, in turn, is ...

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

The case of the Weierstrass elliptic function with invariants g_2=-1 and g_3=0. The half-periods for this case are L(1+i)/4 and L(-1+i)/4, where L is the lemniscate constant ...

A pseudotree is a connected pseudoforest, i.e., an undirected connected graph that contains at most one graph cycle. Connected acyclic graphs (i.e., trees), are therefore ...