Search Results for ""

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 ...

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 ...

Lambda_0(phi|m)=(F(phi|1-m))/(K(1-m))+2/piK(m)Z(phi|1-m), where phi is the Jacobi amplitude, m is the parameter, Z is the Jacobi zeta function, and F(phi|m^') and K(m) are ...

A flexagon made by folding a strip into adjacent equilateral triangles. The number of states possible in a hexaflexagon is the Catalan number C_5=42.

Let 1/p+1/q=1 (1) with p, q>1. Then Hölder's inequality for integrals states that int_a^b|f(x)g(x)|dx<=[int_a^b|f(x)|^pdx]^(1/p)[int_a^b|g(x)|^qdx]^(1/q), (2) with equality ...