Search Results for ""
41 - 50 of 196 for researchSearch Results

What is the largest number of subcubes (not necessarily different) into which a cube cannot be divided by plane cuts? The answer is 47 (Gardner 1992, pp. 297-298). The ...
Radial line segments whose inward-pointing end produce the illusion of a circle or other figure. The apparent figure has the same color as the background, but appears ...
Let S_n be the sum of n random variates X_i with a Bernoulli distribution with P(X_i=1)=p_i. Then sum_(k=0)^infty|P(S_n=k)-(e^(-lambda)lambda^k)/(k!)|<2sum_(i=1)^np_i^2, ...
Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...
Let E be the largest and e the smallest power of l in the HOMFLY polynomial of an oriented link, and i be the braid index. Then the Morton-Franks-Williams inequality holds, ...
A prime-distance graph is a distance graph with distance set given by the set of prime numbers.
The pseudosmarandache function Z(n) is the smallest integer such that sum_(k=1)^(Z(n))k=1/2Z(n)[Z(n)+1] is divisible by n. The values for n=1, 2, ... are 1, 3, 2, 7, 4, 3, 6, ...
R(X_1,...X_n)=sum_(i=1)^nH(X_i)-H(X_1,...,X_n), where H(x_i) is the entropy and H(X_1,...,X_n) is the joint entropy. Linear redundancy is defined as ...
The Ricci flow equation is the evolution equation d/(dt)g_(ij)(t)=-2R_(ij) for a Riemannian metric g_(ij), where R_(ij) is the Ricci curvature tensor. Hamilton (1982) showed ...
In n dimensions for n>=5 the arrangement of hyperspheres whose convex hull has minimal content is always a "sausage" (a set of hyperspheres arranged with centers along a ...

...