Fetching Water with Least Residues

$20.00 plus tax (Refund Policy)

Buy Article:


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?
Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more