TOPICS
Search

Search Results for ""


2051 - 2060 of 4217 for Strong Lawof Small NumbersSearch Results
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 ...
Let f(z) be an analytic function in an angular domain W:|argz|<alphapi/2. Suppose there is a constant M such that for each epsilon>0, each finite boundary point has a ...
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, ...
Consider n intersecting ellipses. The maximal number of regions into which these divide the plane are N(n)=2n^2-2n+2=2(n^2-n+1), giving values for n=1, 2, ... of 2, 6, 14, ...
A positive matrix is a real or integer matrix (a)_(ij) for which each matrix element is a positive number, i.e., a_(ij)>0 for all i, j. Positive matrices are therefore a ...
If f(x) is a nonconstant integer polynomial and c is an integer such that f(c) is divisible by the prime p, that p is called a prime divisor of the polynomial f(x) (Nagell ...
A set A of integers is productive if there exists a partial recursive function f such that, for any x, the following holds: If the domain of phi_x is a subset of A, then f(x) ...
For a quadratic form Q in the canonical form Q=y_1^2+y_2^2+...+y_p^2-y_(p+1)^2-y_(p+2)^2-...-y_r^2, the rank is the total number r of square terms (both positive and ...
On a three-dimensional lattice, a random walk has less than unity probability of reaching any point (including the starting point) as the number of steps approaches infinity. ...
Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...
1 ... 203|204|205|206|207|208|209 ... 422 Previous Next

...