Search Results for ""
1441 - 1450 of 2728 for Poincare Recurrence TheoremSearch Results
A statement, also known as an axiom, which is taken to be true without proof. Postulates are the basic structure from which lemmas and theorems are derived. The whole of ...
The Schnirelmann density of a set of nonnegative integers is the greatest lower bound of the fractions A(n)/n where A(n) is the number of terms in the set <=n.
Assemble six 1×2×2 blocks and three 1×1×1 blocks into a 3×3×3 cube.
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
The bound for the number of colors which are sufficient for map coloring on a surface of genus g, gamma(g)=|_1/2(7+sqrt(48g+1))_| is the best possible, where |_x_| is the ...
The alternating factorial is defined as the sum of consecutive factorials with alternating signs, a(n)=sum_(k=1)^n(-1)^(n-k)k!. (1) They can be given in closed form as ...
An alternating permutation is an arrangement of the elements c_1, ..., c_n such that no element c_i has a magnitude between c_(i-1) and c_(i+1) is called an alternating (or ...
The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...
A puzzle involving disentangling a set of rings from a looped double rod, originally used by French peasants to lock chests (Steinhaus 1999). The word "baguenaudier" means ...
A Bessel function Z_n(x) is a function defined by the recurrence relations Z_(n+1)+Z_(n-1)=(2n)/xZ_n (1) and Z_(n+1)-Z_(n-1)=-2(dZ_n)/(dx). (2) The Bessel functions are more ...
...
View search results from all Wolfram sites (8962 matches)

