Solved: Suppose that you have a three-gallon jug and a
Chapter 9, Problem 9.4.56(choose chapter or problem)
Suppose that you have a three-gallon jug and a five-gallon jug, and you may fill either jug from a water tap, you may empty either jug, and you may transfer water from either jug into the other jug. Use a path in a directed graph model to show that you can end up with a jug containing exactly one gallon. [Hint: Use an ordered pair (a, b) to indicate how much water is in each of the jugs and represent these ordered pairs by vertices. Add edges corresponding to the allowable operations with the jugs.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer