TOPICS
Search

Search Results for ""


1661 - 1670 of 1873 for inline 11Search Results
A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...
The Sierpiński gasket graph of order n is the graph obtained from the connectivity of the Sierpiński sieve. The first few Sierpiński gasket graphs are illustrated above. S_2 ...
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 ...
To pick a random point on the surface of a unit sphere, it is incorrect to select spherical coordinates theta and phi from uniform distributions theta in [0,2pi) and phi in ...
Let a spherical triangle be drawn on the surface of a sphere of radius R, centered at a point O=(0,0,0), with vertices A, B, and C. The vectors from the center of the sphere ...
The term "square" can be used to mean either a square number ("x^2 is the square of x") or a geometric figure consisting of a convex quadrilateral with sides of equal length ...
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 ...
Square triangle picking is the selection of triples of points (corresponding to endpoints of a triangle) randomly placed inside a square. n random triangles can be picked in ...
A number which is simultaneously square and triangular. Let T_n denote the nth triangular number and S_m the mth square number, then a number which is both triangular and ...
As originally stated by Gould (1972), GCD{(n-1; k),(n; k-1),(n+1; k+1)} =GCD{(n-1; k-1),(n; k+1),(n+1; k)}, (1) where GCD is the greatest common divisor and (n; k) is a ...
1 ... 164|165|166|167|168|169|170 ... 188 Previous Next

...