Skip to main content

Fetching Water with Least Residues

Buy Article:

$20.00 plus tax (Refund Policy)


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?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect 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