Fetching Water with Least Residues
Abstract: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: 2008-09-01
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.
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Membership Information
- Information for Advertisers
- Terms & Conditions
- MAA Journals at ingentaconnect
- MAA Store
- Ingenta Connect is not responsible for the content or availability of external websites