Search Results for ""
3941 - 3950 of 4217 for Strong Lawof Small NumbersSearch Results
![](/common/images/search/spacer.gif)
An algebraic surface with affine equation P_d(x_1,x_2)+T_d(x_3)=0, (1) where T_d(x) is a Chebyshev polynomial of the first kind and P_d(x_1,x_2) is a polynomial defined by ...
The circle map is a one-dimensional map which maps a circle onto itself theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n), (1) where theta_(n+1) is computed mod 1 and K is a ...
The common logarithm is the logarithm to base 10. The notation logx is used by physicists, engineers, and calculator keypads to denote the common logarithm. However, ...
Conway's soldiers, also known as the "solitaire army" game (Berlekamp et al. 1982) or "checker-jumping problem" (Honsberger 1976) is a one-player game played on an infinite ...
The first few terms of the continued fraction of the Copeland-Erdős constant are [0; 4, 4, 8, 16, 18, 5, 1, ...] (OEIS A030168), illustrated above. Interestingly, while the ...
C_4 is one of the two groups of group order 4. Like C_2×C_2, it is Abelian, but unlike C_2×C_2, it is a cyclic. Examples include the point groups C_4 (note that the same ...
A deltahedron is a polyhedron whose faces are congruent equilateral triangles (Wells 1986, p. 73). Note that polyhedra whose faces could be triangulated so as to be composed ...
If the three straight lines joining the corresponding vertices of two triangles ABC and A^'B^'C^' all meet in a point (the perspector), then the three intersections of pairs ...
The 2-1 equation A^n+B^n=C^n (1) is a special case of Fermat's last theorem and so has no solutions for n>=3. Lander et al. (1967) give a table showing the smallest n for ...
Using disk point picking, x = sqrt(r)costheta (1) y = sqrt(r)sintheta (2) for r in [0,1], theta in [0,2pi), choose two points at random in a unit disk and find the ...
![](/common/images/search/spacer.gif)
...