Search Results for ""

The expected number of trials needed to collect a complete set of n different objects when picked at random with repetition is nH_n (Havil 2003, p. 131). For n=1, 2, ..., the ...

The phrase "convergence in mean" is used in several branches of mathematics to refer to a number of different types of sequential convergence. In functional analysis, ...

A notation for polyhedra which begins by specifying a "seed" polyhedron using a capital letter. The Platonic solids are denoted T (tetrahedron), O (octahedron), C (cube), I ...

A covering map (also called a covering or projection) is a surjective open map f:X->Y that is locally a homeomorphism, meaning that each point in X has a neighborhood that is ...

Let F be the Maclaurin series of a meromorphic function f with a finite or infinite number of poles at points z_k, indexed so that 0<|z_1|<=|z_2|<=|z_3|<=..., then a pole ...

There are a number of attractive cube 20-compounds that can be constructed by taking the duals of the octahedra in the two octahedron 20-compounds. The second of these was ...

There are a number of attractive cube 25-compounds. One can be constructed from the vertices of the second dodecahedron 6-compound (or second tetrahedron 50-compound) and ...

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

Given a polygon with an even number of sides, the derived polygon is obtained by joining the points which are a fractional distance r along each side. If r=1/2, then the ...

Consider the length of the diagonal of a unit square as approximated by piecewise linear steps that may only be taken in the right and up directions. Obviously, the length so ...