Search Results for ""
961 - 970 of 1073 for Cubic Hexagonal Close PackingSearch Results
The median of a statistical distribution with distribution function D(x) is the value x such D(x)=1/2. For a symmetric distribution, it is therefore equal to the mean. Given ...
An integer n such that 3n^3 contains three consecutive 3s in its decimal representation is called a super-3 number. The first few super-3 numbers are 261, 462, 471, 481, 558, ...
An intrinsic property of a mathematical object which causes it to remain invariant under certain classes of transformations (such as rotation, reflection, inversion, or more ...
"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...
Given a regular tetrahedron of unit volume, consider the lengths of line segments connecting pairs of points picked at random inside the tetrahedron. The distribution of ...
The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...
Triangle geometry is the study of the properties of triangles, including associated triangle centers, triangle lines, central circles, triangle cubics, and many others. These ...
The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...
Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...
A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...
...
View search results from all Wolfram sites (11669 matches)

