In a classic pouring problem, you are given two jugs with capacities m and n pints, where m and n are relatively prime integers. Given an unlimited supply of water you must obtain exactly p pints, where p is an integer, 0 < p < m+n. In this article we use some properties of least residues to show that there are two distinct pouring sequences to achieve this result. The more efficient sequence can be determined by solving a linear congruence.
Document Type: Miscellaneous
Publication date: September 1, 2008
More about this publication?
The College Mathematics Journal is designed to enhance classroom learning and stimulate thinking regarding undergraduate mathematics. CMJ publishes articles, short Classroom Capsules, problems, solutions, media reviews and other pieces. All are aimed at the college mathematics curriculum with emphasis on topics taught in the first two years.