Search Results for ""

By asking a small number of innocent-sounding questions about an unknown number, it is possible to reconstruct the number with absolute certainty (assuming that the questions ...

A nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...

If A, B, and C are three points on one line, D, E, and F are three points on another line, and AE meets BD at X, AF meets CD at Y, and BF meets CE at Z, then the three points ...

The Paris-Harrington theorem is a strengthening of the finite Ramsey's theorem by requiring that the homogeneous set be large enough so that cardH>=minH. Clearly, the ...

Two losing gambling games can be set up so that when they are played one after the other, they become winning. There are many ways to construct such scenarios, the simplest ...

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

A perfect cuboid is a cuboid having integer side lengths, integer face diagonals d_(ab) = sqrt(a^2+b^2) (1) d_(ac) = sqrt(a^2+c^2) (2) d_(bc) = sqrt(b^2+c^2), (3) and an ...

Plücker's conoid is a ruled surface sometimes also called the cylindroid, conical wedge, or conocuneus of Wallis. von Seggern (1993, p. 288) gives the general functional form ...

The illusion that the two ends of a straight line segment passing behind an obscuring rectangle are offset when, in fact, they are aligned. The Poggendorff illusion was ...

In the case of a general surface, the distance between two points measured along the surface is known as a geodesic. For example, the shortest distance between two points on ...