Search Results for ""

Find the surface enclosing the maximum volume per unit surface area, I=V/S. The solution is a sphere, which has I_(sphere)=(4/3pir^3)/(4pir^2)=1/3r. The fact that a sphere ...

A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...

Jessen's orthogonal icosahedron is a concave shaky polyhedron constructed by replacing six pairs of adjacent triangles in an icosahedron (whose edges form a skew ...

A semiprime which English economist and logician William Stanley Jevons incorrectly believed no one else would be able to factor. According to Jevons (1874, p. 123), "Can the ...

For positive integer n, the K-function is defined by K(n) = 1^12^23^3...(n-1)^(n-1) (1) = H(n-1), (2) where the numbers H(n)=K(n+1) are called hyperfactorials by Sloane and ...

Given a knot diagram, it is possible to construct a collection of variables and equations, and given such a collection, a group naturally arises that is known as the group of ...

The function f_theta(z)=z/((1+e^(itheta)z)^2) (1) defined on the unit disk |z|<1. For theta in [0,2pi), the Köbe function is a schlicht function f(z)=z+sum_(j=2)^inftya_jz^j ...

A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...

The Kreisel conjecture is a conjecture in proof theory that postulates that, if phi(x) is a formula in the language of arithmetic for which there exists a nonnegative integer ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...