enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Square packing - Wikipedia

    en.wikipedia.org/wiki/Square_packing

    Square packing in a square is the problem of determining the maximum number of unit squares (squares of side length one) that can be packed inside a larger square of side length . If a {\displaystyle a} is an integer , the answer is a 2 , {\displaystyle a^{2},} but the precise – or even asymptotic – amount of unfilled space for an arbitrary ...

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    To convert between these two formulations of the problem, the square side for unit circles will be = + /. The optimal packing of 15 circles in a square Optimal solutions have been proven for n ≤ 30. Packing circles in a rectangle; Packing circles in an isosceles right triangle - good estimates are known for n < 300.

  4. Circle packing in a square - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_square

    Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square. Equivalently, the problem is to arrange n points in a unit square aiming to get the greatest minimal separation, d n, between points. [1] To convert between these two formulations of the problem ...

  5. Prince Rupert's cube - Wikipedia

    en.wikipedia.org/wiki/Prince_Rupert's_cube

    The problem of finding the largest square that lies entirely within a unit cube is closely related, and has the same solution. Prince Rupert's cube is named after Prince Rupert of the Rhine , who asked whether a cube could be passed through a hole made in another cube of the same size without splitting the cube into two pieces.

  6. Block-stacking problem - Wikipedia

    en.wikipedia.org/wiki/Block-stacking_problem

    The block-stacking problem is the following puzzle: Place identical rigid rectangular blocks in a stable stack on a table edge in such a way as to maximize the overhang. Paterson et al. (2007) provide a long list of references on this problem going back to mechanics texts from the middle of the 19th century.

  7. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    Many problems in the chemical and physical sciences can be related to packing problems where more than one size of sphere is available. Here there is a choice between separating the spheres into regions of close-packed equal spheres, or combining the multiple sizes of spheres into a compound or interstitial packing.

  8. Rubik’s Cube is still selling millions after 50 years ... - AOL

    www.aol.com/finance/rubik-cube-still-selling...

    The Cube’s earliest boost in sales came in the 1980s, when Rubik took his creation to a fair in New York—in the three years that followed, roughly 100 million Cubes were sold, creating a ...

  9. Squaring the square - Wikipedia

    en.wikipedia.org/wiki/Squaring_the_square

    Cubing the cube is the analogue in three dimensions of squaring the square: that is, given a cube C, the problem of dividing it into finitely many smaller cubes, no two congruent. Unlike the case of squaring the square, a hard yet solvable problem, there is no perfect cubed cube and, more generally, no dissection of a rectangular cuboid C into ...