enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Block-stacking problem - Wikipedia

    en.wikipedia.org/wiki/Block-stacking_problem

    The first nine blocks in the solution to the single-wide block-stacking problem with the overhangs indicated. In statics, the block-stacking problem (sometimes known as The Leaning Tower of Lire (Johnson 1955), also the book-stacking problem, or a number of other similar terms) is a puzzle concerning the stacking of blocks at the edge of a table.

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    A container, usually a two- or three-dimensional convex region, possibly of infinite size. Multiple containers may be given depending on the problem. A set of objects, some or all of which must be packed into one or more containers. The set may contain different objects with their sizes specified, or a single object of a fixed dimension that ...

  4. List of mathematical series - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_series

    An infinite series of any rational function of can be reduced to a finite series of polygamma functions, by use of partial fraction decomposition, [8] as explained here. This fact can also be applied to finite series of rational functions, allowing the result to be computed in constant time even when the series contains a large number of terms.

  5. Finite sphere packing - Wikipedia

    en.wikipedia.org/wiki/Finite_sphere_packing

    In mathematics, the theory of finite sphere packing concerns the question of how a finite number of equally-sized spheres can be most efficiently packed. The question of packing finitely many spheres has only been investigated in detail in recent decades, with much of the groundwork being laid by László Fejes Tóth .

  6. Counter-machine model - Wikipedia

    en.wikipedia.org/wiki/Counter-machine_model

    Shepherdson & Sturgis (1963) observe that "the proof of this universality [of digital computers to Turing machines] ... seems to have been first written down by Hermes, who showed in [7--their reference number] how an idealized computer could be programmed to duplicate the behavior of any Turing machine", and: "Kaphengst's approach is interesting in that it gives a direct proof of the ...

  7. Hausdorff measure - Wikipedia

    en.wikipedia.org/wiki/Hausdorff_measure

    The zero-dimensional Hausdorff measure is the number of points in the set (if the set is finite) or ∞ if the set is infinite. Likewise, the one-dimensional Hausdorff measure of a simple curve in R n {\displaystyle \mathbb {R} ^{n}} is equal to the length of the curve, and the two-dimensional Hausdorff measure of a Lebesgue-measurable subset ...

  8. Mooney–Rivlin solid - Wikipedia

    en.wikipedia.org/wiki/Mooney–Rivlin_solid

    The Mooney–Rivlin model is a special case of the generalized Rivlin model (also called polynomial hyperelastic model [6]) which has the form =, = (¯) (¯) + = with = where are material constants related to the distortional response and are material constants related to the volumetric response.

  9. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    The strictly jammed (mechanically stable even as a finite system) regular sphere packing with the lowest known density is a diluted ("tunneled") fcc crystal with a density of only π √ 2 /9 ≈ 0.49365. [6] The loosest known regular jammed packing has a density of approximately 0.0555. [7]