Search Results for ""

The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...

The word polytope is used to mean a number of related, but slightly different mathematical objects. A convex polytope may be defined as the convex hull of a finite set of ...

In a given circle, find an isosceles triangle whose legs pass through two given points inside the circle. This can be restated as: from two points in the plane of a circle, ...

A game played with two dice. If the total is 7 or 11 (a "natural"), the thrower wins and retains the dice for another throw. If the total is 2, 3, or 12 ("craps"), the ...

Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...

The elliptic lambda function lambda(tau) is a lambda-modular function defined on the upper half-plane by lambda(tau)=(theta_2^4(0,q))/(theta_3^4(0,q)), (1) where tau is the ...

Let E_1(x) be the En-function with n=1, E_1(x) = int_1^infty(e^(-tx)dt)/t (1) = int_x^infty(e^(-u)du)/u. (2) Then define the exponential integral Ei(x) by E_1(x)=-Ei(-x), (3) ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

The unique (modulo rotations) scalene triangle formed from three vertices of a regular heptagon, having vertex angles pi/7, 2pi/7, and 4pi/7. There are a number of amazing ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...