Search Results for ""

A nowhere-neat dissection in which squares of the same size are not allowed to share any part of a side.

A nonempty set is a set containing one or more elements. Any set other than the empty set emptyset is therefore a nonempty set. Nonempty sets are sometimes also called ...

If A=>!B and B=>!A (i.e., (A=>!B) ^ (B=>!A), where !A denotes NOT, => denotes implies, and ^ denotes AND), then A and B are said to be inequivalent, a relationship which is ...

A subset E of a topological space S is said to be nonmeager if E is of second category in S, i.e., if E cannot be written as the countable union of subsets which are nowhere ...

An impartial game in which the last player wins. In normal-form games, the nim-value of the sum of two games is the nim-sum of their nim-values.

Given a convex plane region with area A and perimeter p, A-1/2p<N<=A+1/2p+1, where N is the number of enclosed lattice points (Nosarzewska 1948). This improves on Jarnick's ...

A nowhere-neat dissection is a dissection of an area into polygons such that no two polygons have a side in common. A nowhere-neat dissection in which squares of the same ...

Place 2n balls in a bag and number them 1 to 2n, then pick half of them at random. The number of different possible sums for n=1, 2, 3, ... are then 2, 5, 10, 17, 26, ... ...

Numerical stability refers to how a malformed input affects the execution of an algorithm. In a numerically stable algorithm, errors in the input lessen in significance as ...

The study of numbers for the supposed purpose of predicting future events or seeking connections with the occult.