Search Results for ""
2551 - 2560 of 13135 for random number generatorSearch Results
Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...
A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...
A number of attractive tetrahedron 6-compounds can be constructed. The first compound (left figures) is obtained by combining three stella octangula. A second can be obtained ...
If f(omega) is square integrable over the real omega-axis, then any one of the following implies the other two: 1. The Fourier transform F(t)=F_omega[f(omega)](t) is 0 for ...
The interior of the triangle is the set of all points inside a triangle, i.e., the set of all points in the convex hull of the triangle's vertices. The simplest way to ...
A triangle tiling is a tiling of the plane by identical triangles. Any triangle tiles the plane (Wells 1991, p. 208). The total number of triangles (including inverted ones) ...
Given a triangle center X=l:m:n, the line mnalpha+nlbeta+lmgamma=0, where alpha:beta:gamma are trilinear coordinates, is called the trilinear polar (Kimberling 1998, p. 38). ...
The universal product code (UPC) is a 12-digit number and associated machine-readable bar code used to identify products being purchased in grocery stores. UPCs encode an ...
Let [arg(f(z))] denote the change in the complex argument of a function f(z) around a contour gamma. Also let N denote the number of roots of f(z) in gamma and P denote the ...
A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...
...
View search results from all Wolfram sites (185340 matches)

