Search Results for ""
371 - 380 of 1073 for Cubic Hexagonal Close PackingSearch Results
Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).
An a×b rectangle can be packed with 1×n strips iff n|a or n|b.
Maximize the amount of floor space which can be covered with a fixed tile (Hoffman 1998, p. 173).
A box can be packed with a harmonic brick a×ab×abc iff the box has dimensions ap×abq×abcr for some natural numbers p, q, r (i.e., the box is a multiple of the brick).
The cube is the Platonic solid composed of six square faces that meet each other at right angles and has eight vertices and 12 edges. It is also the uniform polyhedron with ...
There are several attractive polyhedron compounds consisting of three cubes. The first (left figures) arises by joining three cubes such that each shares two C_2 axes (Holden ...
There exist lattices in n dimensions having hypersphere packing densities satisfying eta>=(zeta(n))/(2^(n-1)), where zeta(n) is the Riemann zeta function. However, the proof ...
In n dimensions for n>=5 the arrangement of hyperspheres whose convex hull has minimal content is always a "sausage" (a set of hyperspheres arranged with centers along a ...
The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...
Consider three mutually tangent circles, and draw their inner Soddy circle. Then draw the inner Soddy circles of this circle with each pair of the original three, and ...
...
View search results from all Wolfram sites (11669 matches)

