When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Atomic packing factor - Wikipedia

    en.wikipedia.org/wiki/Atomic_packing_factor

    Indeed, three are the atoms in the middle layer (inside the prism); in addition, for the top and bottom layers (on the bases of the prism), the central atom is shared with the adjacent cell, and each of the six atoms at the vertices is shared with other six adjacent cells. So the total number of atoms in the cell is 3 + (1/2)×2 + (1/6)×6×2 = 6.

  3. Sphere packing in a sphere - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing_in_a_sphere

    Download as PDF; Printable version; ... Diagram Exact form Approximate 1 1.0000 1 ... 0.5000 0.25 Trivially optimal. Line segment: 3 ...

  4. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    An a × b rectangle can be packed with 1 × n strips if and only if n divides a or n divides b. [ 15 ] [ 16 ] de Bruijn's theorem : A box can be packed with a harmonic brick a × a b × a b c if the box has dimensions a p × a b q × a b c r for some natural numbers p , q , r (i.e., the box is a multiple of the brick.) [ 15 ]

  5. Package diagram - Wikipedia

    en.wikipedia.org/wiki/Package_diagram

    package import; package merge; A package import is "a directed relationship between an importing namespace and a package, indicating that the importing namespace adds the names of the members of the package to its own namespace." [2] By default, an unlabeled dependency between two packages is interpreted as a package import relationship. In ...

  6. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    [1] [2] Highest density is known only for 1, 2, 3, 8, and 24 dimensions. [3] Many crystal structures are based on a close-packing of a single kind of atom, or a close-packing of large ions with smaller ions filling the spaces between them. The cubic and hexagonal arrangements are very close to one another in energy, and it may be difficult to ...

  7. 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.

  8. Molar volume - Wikipedia

    en.wikipedia.org/wiki/Molar_volume

    The ideal gas equation can be rearranged to give an expression for the molar volume of an ideal gas: = = Hence, for a given temperature and pressure, the molar volume is the same for all ideal gases and is based on the gas constant: R = 8.314 462 618 153 24 m 3 ⋅Pa⋅K −1 ⋅mol −1, or about 8.205 736 608 095 96 × 10 −5 m 3 ⋅atm⋅K ...

  9. Circle packing in a circle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_circle

    Of these, solutions for n = 2, 3, 4, 7, 19, and 37 achieve a packing density greater than any smaller number > 1. (Higher density records all have rattles.) [ 10 ] See also