Search Results for ""

The great rhombic triacontahedron, also called the great stellated triacontahedron, is the dual of great icosidodecahedron uniform polyhedron. It is a zonohedron and a ...

For any positive integer k, there exists a prime arithmetic progression of length k. The proof is an extension of Szemerédi's theorem.

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...

With three cuts, dissect an equilateral triangle into a square. The problem was first proposed by Dudeney in 1902, and subsequently discussed in Dudeney (1958), and Gardner ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

An elliptic function can be characterized by its real and imaginary half-periods omega_1 and omega_2 (Whittaker and Watson 1990, p. 428), sometimes also denoted ...

Let F(m,n) be the number of m×n (0,1)-matrices with no adjacent 1s (in either columns or rows). For n=1, 2, ..., F(n,n) is given by 2, 7, 63, 1234, ... (OEIS A006506). The ...

The haversine, also called the haversed sine, is a little-used entire trigonometric function defined by hav(z) = 1/2vers(z) (1) = 1/2(1-cosz) (2) = sin^2(1/2z), (3) where ...

A fair coin is tossed an even 2n number of times. Let D=|H-T| be the absolute difference in the number of heads and tails obtained. Then the probability distribution is given ...

In elliptic cylindrical coordinates, the scale factors are h_u=h_v=sqrt(sinh^2u+sin^2v), h_z=1, and the separation functions are f_1(u)=f_2(v)=f_3(z)=1, giving a Stäckel ...