Search Results for ""

An alternative term for a binomial coefficient, in which (n; k) is read as "n choose k." R. K. Guy suggested this pronunciation around 1950, when the notations ^nC_r and ...

Erdős proved that there exist at least one prime of the form 4k+1 and at least one prime of the form 4k+3 between n and 2n for all n>6.

The locus of the point at which two given circles possess the same circle power is a straight line perpendicular to the line joining the midpoints of the circle and is known ...

A Chu space is a binary relation from a set A to an antiset X which is defined as a set which transforms via converse functions.

A gambling game played at carnivals in which a player may bet on any one of the numbers 1 through 6. Three dice are then rolled and, if his number appears, he receives back a ...

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

It is possible to place 7 cigarettes in such a way that each touches every other if l/d>7sqrt(3)/2 (Gardner 1959, p. 115).

The encrypted form of a plaintext.

An ellipse intersects a circle in 0, 1, 2, 3, or 4 points. The points of intersection of a circle of center (x_0,y_0) and radius r with an ellipse of semi-major and ...

Taking the locus of midpoints from a fixed point to a circle of radius r results in a circle of radius r/2. This follows trivially from r(theta) = [-x; 0]+1/2([rcostheta; ...