When.com Web Search

  1. Ads

    related to: examples of volume problems in math activities

Search results

  1. Results From The WOW.Com Content Network
  2. Problems and Theorems in Analysis - Wikipedia

    en.wikipedia.org/wiki/Problems_and_Theorems_in...

    Each volume the contains problems at the beginning and (brief) solutions at the end. As two authors have put it, "there is a general consensus among mathematicians that the two-volume Pólya-Szegő is the best written and most useful problem book in the history of mathematics." [1]: 59

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

  4. List of formulas in elementary geometry - Wikipedia

    en.wikipedia.org/wiki/List_of_formulas_in...

    List of surface-area-to-volume ratios – Surface area per unit volume; List of surface area formulas – Measure of a two-dimensional surface;

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

  6. Hilbert's third problem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_third_problem

    Other examples are doubling the cube and trisecting the angle. Two polyhedra are called scissors-congruent if the first can be cut into finitely many polyhedral pieces that can be reassembled to yield the second. Any two scissors-congruent polyhedra have the same volume. Hilbert asks about the converse.

  7. List of knapsack problems - Wikipedia

    en.wikipedia.org/wiki/List_of_knapsack_problems

    If there is more than one constraint (for example, both a volume limit and a weight limit, where the volume and weight of each item are not related), we get the multiple-constrained knapsack problem, multidimensional knapsack problem, or m-dimensional knapsack problem. (Note, "dimension" here does not refer to the shape of any items.)