enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Square–cube law - Wikipedia

    en.wikipedia.org/wiki/Square–cube_law

    Its volume would be multiplied by the cube of 2 and become 8 m 3. The original cube (1 m sides) has a surface area to volume ratio of 6:1. The larger (2 m sides) cube has a surface area to volume ratio of (24/8) 3:1. As the dimensions increase, the volume will continue to grow faster than the surface area. Thus the square–cube law.

  3. Hoffman's packing puzzle - Wikipedia

    en.wikipedia.org/wiki/Hoffman's_packing_puzzle

    The total volume of the pieces, 27xyz, is less than the volume (x + y + z) 3 of the cube that they pack into. If one takes the cube root of both volumes, and divides by three, then the number obtained in this way from the total volume of the pieces is the geometric mean of x , y , and z , while the number obtained in the same way from the ...

  4. Cube (algebra) - Wikipedia

    en.wikipedia.org/wiki/Cube_(algebra)

    The cube is also the number multiplied by its square: n 3 = n × n 2 = n × n × n. The cube function is the function x ↦ x 3 (often denoted y = x 3) that maps a number to its cube. It is an odd function, as (−n) 3 = −(n 3). The volume of a geometric cube is the cube of its side length, giving rise to the

  5. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    The proportion of space filled by the spheres is called the packing density of the arrangement. As the local density of a packing in an infinite space can vary depending on the volume over which it is measured, the problem is usually to maximise the average or asymptotic density, measured over a large enough volume.

  6. Sphere packing in a cube - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing_in_a_cube

    In geometry, sphere packing in a cube is a three-dimensional sphere packing problem with the objective of packing spheres inside a cube. It is the three-dimensional equivalent of the circle packing in a square problem in two dimensions. The problem consists of determining the optimal packing of a given number of spheres inside the cube.

  7. Hypercube - Wikipedia

    en.wikipedia.org/wiki/Hypercube

    In geometry, a hypercube is an n-dimensional analogue of a square (n = 2) and a cube (n = 3); the special case for n = 4 is known as a tesseract.It is a closed, compact, convex figure whose 1-skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length.

  8. Prince Rupert's cube - Wikipedia

    en.wikipedia.org/wiki/Prince_Rupert's_cube

    A unit cube with a hole cut through it, large enough to allow Prince Rupert's cube to pass. In geometry, Prince Rupert's cube is the largest cube that can pass through a hole cut through a unit cube without splitting it into separate pieces. Its side length is approximately 1.06, 6% larger than the side length 1 of the unit cube through which ...

  9. Cavalieri's quadrature formula - Wikipedia

    en.wikipedia.org/wiki/Cavalieri's_quadrature_formula

    For positive integers, this proof can be geometrized: [2] if one considers the quantity x n as the volume of the n-cube (the hypercube in n dimensions), then the derivative is the change in the volume as the side length is changed – this is x n−1, which can be interpreted as the area of n faces, each of dimension n − 1 (fixing one vertex ...