Answer
The answer is yes.
Work Step by Step
Represent possible amounts of
water in jugs A and B by ordered pairs. For instance, the
ordered pair (1, 3) would indicate that there is one quart of
water in jug A and three quarts in jug B. Starting with (0,
0), draw arrows from one ordered pair to another if it is
possible to go from the situation represented by one pair to
that represented by the other by either filling a jug, emptying
a jug, or transferring water from one jug to another. You
need only draw arrows from states that have arrows pointing
to them; the other states cannot be reached. Then find a
directed path (sequence of directed edges) from the initial
state (0, 0) to a final state (1, 0) or (0, 1).
