Library / /8 of 99

, 2016

Geometry Difficulty 1.0 Junior Prove it United Kingdom

Andrew has two containers for carrying water. The containers are cubes without tops and have base areas of $4\,\text{dm}^2$ and $36\,\text{dm}^2$ respectively. Andrew has to completely fill the larger cube with pond water, which must be carried from the pond using the smaller cube. What is the smallest number of visits Andrew has to make to the pond with the smaller cube?

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: UK Mathematics Trust, licensed © UK Mathematics Trust; past papers published free at ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.