When.com Web Search

  1. Ads

    related to: examples of volume problems in math questions pdf free

Search results

  1. Results From The WOW.Com Content Network
  2. Paper bag problem - Wikipedia

    en.wikipedia.org/wiki/Paper_bag_problem

    A cushion filled with stuffing. In geometry, the paper bag problem or teabag problem is to calculate the maximum possible inflated volume of an initially flat sealed rectangular bag which has the same shape as a cushion or pillow, made out of two pieces of material which can bend but not stretch.

  3. Napkin ring problem - Wikipedia

    en.wikipedia.org/wiki/Napkin_ring_problem

    Reprint of 1935 edition. A problem on page 101 describes the shape formed by a sphere with a cylinder removed as a "napkin ring" and asks for a proof that the volume is the same as that of a sphere with diameter equal to the length of the hole. Pólya, George (1990), Mathematics and Plausible Reasoning, Vol.

  4. List of undecidable problems - Wikipedia

    en.wikipedia.org/wiki/List_of_undecidable_problems

    The problem of determining if a given set of Wang tiles can tile the plane. The problem of determining the Kolmogorov complexity of a string. Hilbert's tenth problem: the problem of deciding whether a Diophantine equation (multivariable polynomial equation) has a solution in integers.

  5. List of NP-complete problems - Wikipedia

    en.wikipedia.org/wiki/List_of_NP-complete_problems

    The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric. The problem is known to be NP-hard with the (non-discretized) Euclidean metric. [3]: ND22, ND23

  6. Hilbert's third problem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_third_problem

    The third of Hilbert's list of mathematical problems, presented in 1900, was the first to be solved. The problem is related to the following question: given any two polyhedra of equal volume, is it always possible to cut the first

  7. 10 Hard Math Problems That Even the Smartest People in the ...

    www.aol.com/10-hard-math-problems-even-150000090...

    The Kissing Number Problem. A broad category of problems in math are called the Sphere Packing Problems. They range from pure math to practical applications, generally putting math terminology to ...

  8. Finite volume method for two dimensional diffusion problem

    en.wikipedia.org/wiki/Finite_volume_method_for...

    The face areas in y two dimensional case are : = = and = =. We obtain the distribution of the property i.e. a given two dimensional situation by writing discretized equations of the form of equation (3) at each grid node of the subdivided domain.

  9. Cavalieri's principle - Wikipedia

    en.wikipedia.org/wiki/Cavalieri's_principle

    The volume ratio is maintained when the height is scaled to h' = r √ π. 3. Decompose it into thin slices. 4. Using Cavalieri's principle, reshape each slice into a square of the same area. 5. The pyramid is replicated twice. 6. Combining them into a cube shows that the volume ratio is 1:3.