Search Results for ""
1581 - 1590 of 2001 for Dominating Unique GraphsSearch Results

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...
Find the m×n array of single digits which contains the maximum possible number of primes, where allowable primes may lie along any horizontal, vertical, or diagonal line. For ...
The snub cube, also called the cubus simus (Kepler 1619, Weissbach and Martini 2002) or snub cuboctahedron, is an Archimedean solid having 38 faces (32 triangular and 6 ...
A square root of x is a number r such that r^2=x. When written in the form x^(1/2) or especially sqrt(x), the square root of x may also be called the radical or surd. The ...
The Steiner circumellipse is the circumellipse that is the isotomic conjugate of the line at infinity and the isogonal conjugate of the Lemoine axis. It has circumconic ...
Thurston's conjecture proposed a complete characterization of geometric structures on three-dimensional manifolds. Before stating Thurston's geometrization conjecture in ...
The trefoil knot 3_1, also called the threefoil knot or overhand knot, is the unique prime knot with three crossings. It is a (3, 2)-torus knot and has braid word sigma_1^3. ...
The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...
Pre-Algebra
The nth k-statistic k_n is the unique symmetric unbiased estimator of the cumulant kappa_n of a given statistical distribution, i.e., k_n is defined so that <k_n>=kappa_n, ...

...