Search Results for ""

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...

The Rhind papyrus is a famous document from the Egyptian Middle Kingdom that dates to 1650 BC. It was purchased by Henry Rhind in Egypt in 1858, and placed in the British ...

Any four mutually tangent spheres determine six points of tangency. A pair of tangencies (t_i,t_j) is said to be opposite if the two spheres determining t_i are distinct from ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...

The twin primes constant Pi_2 (sometimes also denoted C_2) is defined by Pi_2 = product_(p>2; p prime)[1-1/((p-1)^2)] (1) = product_(p>2; p prime)(p(p-2))/((p-1)^2) (2) = ...

Two trains are on the same track a distance 100 km apart heading towards one another, each at a speed of 50 km/h. A fly starting out at the front of one train, flies towards ...

Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...

Given a homogeneous linear second-order ordinary differential equation, y^('')+P(x)y^'+Q(x)y=0, (1) call the two linearly independent solutions y_1(x) and y_2(x). Then ...