Search Results for ""

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

Let a_n>=0 and suppose sum_(n=1)^inftya_ne^(-an)∼1/a as a->0^+. Then sum_(n<=x)a_n∼x as x->infty. This theorem is a step in the proof of the prime number theorem, but has ...

There are 432 enantiomorphous and 415 chiral fully supported stellations of the icosidodecahedron. Using Miller's rules gives 7071672 enantiomorphous stellations and an ...

Let S be a nonempty set of real numbers that has an upper bound. Then a number c is called the least upper bound (or the supremum, denoted supS) for S iff it satisfies the ...

A longimeter is a transparent sheet of plastic with a regular grid of lines inclined at an angle of 30 degrees to the sides of the sheet. By counting the number of squares ...

The term Nasik cube can refer to a number of different sorts of magic cubes. In particular, a Nasik cube is a magic cube in which additionally 1. The broken space diagonals ...

A number of fractal curves are associated with Peano. The Peano curve is the fractal curve illustrated above which can be written as a Lindenmayer system. The nth iteration ...

Consider n intersecting circles. The maximal number of regions into which these divide the plane are N(n)=n^2-n+2, giving values for n=1, 2, ... of 2, 4, 8, 14, 22, 32, 44, ...

The number of regions into which space can be divided by n mutually intersecting spheres is N=1/3n(n^2-3n+8), giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ...