Professional Documents
Culture Documents
(1)
where a, b, and c are all integers. We are interested in integer solutions, that
is, integers x andy that satisfy equation (1). In Dickson it is stated that if a and
b are relatively prime (that is, a and b have no common divisor other than 1),
and if (u, v) is an integer solution of (1), then the whole set of integer solutions
of (1) can be expressed as
(2)
x = u + bw,
y = v - aw,
hlence, we may use u = 2 and v = -1. Therefore, the integer solution set of
(4) is
S={(2+4w,-1-3w)lw=O +1, +2,... .
When an integer value is assumed by w, correspondingly an integer solution
of (4) is obtained. For example, when w = 2, the corresponding solution is
240
x =22+4(2)-10,
y = -1 -3(2) = -7.
It can easily be checked that (10, - 7) really is a solution of (4).
The purpose of this paper is to demonstrate how the above result can
be applied to teaching certain problem solving concepts and methods in a
college-level general mathematics topics course such as Mathematical
Thinking. The application is described in the following sections. Under the
appropriate guidance of an instructor, this paper can be well appreciated by
these students.
Fill container B
Pour the cider from B into A
until A is full
._
Empty container A
Pour the cider remaining in B
into A
Fill container B
Pour the cider from B into A
until A is full
Empty container A
Pour the cider remaining in B
into A
Fill container B
Pour the cider from B into A
until A is full
Empty container A
I
O
0
1
1
4
5
2
0
2
2
0
2
4
5
3
C]
Table 2.1
241
- 4 = 3. This string, of course, comes with the caveat that we can never have
more than 9 gallons (4 gallons + 5 gallons) in total at any given time, or else
both containers would be over-full and thus not able to be measured.
Therefore, the string + 5 + 5 + 5 - 4 - 4 - 4 cannot be used in this case.
The instructor may also point out that mathematically the string + 5 4 + 5 - 4 +5 - 4 = 3 is equivalent to the equation 4 (-3) + 5 (3) = 3. In fact, in
general to find an appropriate string of operations, we may first want to find
two integers x and y such that
4x+5y=3.
(5)
Note that (5) is in fact a linear Diophantine equation. Therefore, all the
solutions of (5) are
x=u+5w, y=v-4w,
w=0,+1,+2,...,
(6)
where (u, v) stands for a particular solution of (5). II other words, if we can
somehow find a particular solution (u, v) of (5), then all solutions of (5) are
given by (6), and correspondingly all possible strings of operations as well as
tables of actions can be constructed.
At this point, the instructor may want to briefly summarize the
solution procedure for finding all possible ways of measuring 3 gallons from a
4-gallon and a 5-gallon container. The procedure can be described as follows:
Step 1: Set up a linear Diophantine equation
4x + 5y = 3.
(7)
Step 2: Find a particular integer solution (u, v) of (7).
Step 3: Express all integer solutions of (7) as
x=u+5w, y=v-4w, w=O,+1,2,...
(8)
Step 4: To view any particular way of measuring 3 gallons using these txvo
containers, just assign an integer value to w to get a particular solution (X,y).
242
--- ......................................................... ...I''ll,",,-
-- -- ,-,-- ,"",,""I",-."-",-".,.,........
................................... -- ............ --
................. __ ------------
- MA THEMA
container (B)
container(
Fill container A
Pour the cider from A into B
4
0
0
4
Fill container A
until B is full
__
Empty container B
5
_
Table 2.2
243
(11)
or
IY < Cl
(12)
or both. When a solution (x, y) satisfies either (I l) or (12), the
corresponding sequence of actions will always start with an action (a). Then
an action (b) (transferring from one container into the other) will be inserted
after each action (a) or action (c). The sequence always ends with either an
action (a) or an action (c). Therefore, if a solution (x, y) satisfies either (11)
or (12), then the corresponding sequence of actions will contain
2 (IX| + Iyl) -1 actions.
[t is an interesting exercise for students to verify that the particular
solution (u, v) obtained from the procedure given above satisfies either (11)
or (12), that is, either Jul < b or |vi < al. It is also easy to see that there exist
I
244
-........................ -- ....I................. i.................. - 11111.1-1-111-
....,....
"I'l-Ill""I""",",.".,....",..........................
- MA
two integers N < 0 < M such that the solution (u + bw, v - aw) satisfies
either (11) or (12) when w =N, N + 1,... M but fails to satisfy either of
themwhen w<N or w>M.
This leads us to the answer to the second question. After obtaining
the particular solution (u, v) from the above procedure, calculate the value
u + bw + v- awl for w = 0,1, 2, ... until (u + bw, v - aw) satisfies neither
(11) nor (12). Then do the same for negative values of w. After that, simply
examine these values of u+ bwj + lv - aw , and the smallest one yields the
optimal solution.
Let us consider the following examnple. Assume that we are given a
3-gallon and a 10-gallon container, and we are to use them to measure 8
gallons. In this case, a=3, b=10, and c=8. The following Table 2.3
shows students the steps to finding a particular solution (u, v).
N
c-bn
a
Quotient
of c~-bn
Remainder
8/3
-2/3
18/3
2
0
6
2
-2
0
0
1
-1
c-an
b
ofc-bn
a
8/10
5/10
11/1
Quotient
of b
0
0
1_
Remainder
of cban
(u, v)
found'?
8
5
1
No
No
Yes u=6,
_. ___
-~~~~~~~~~~~~~~~~~~~~V
Table 2.3
-1
-2
(u + bw, v -- aw)
(6, -1)
(16, -4)
( -4, 2)
14, 5
_!u + bwl
-+ v -
awl
7
20
6
19
1(-
Table 2.z-
In this case only w= 0,-i yield solutions that satisfy either (11) or (12).
Comparing the corresponding value of |u + bwl + |v - awl, we see that w = -1
or (x, y) =(-4, 2) is the optimal solution. 'I'he corresponding string of
operations is
+ 10-3-3-3+ 10-3=8.
I
245
- MA
REFERENCES
1. Leonard E. Dickson, History of the 7heory of Numbers. Vol. 2, Chelsea Publishing Co.,
New York, NY (1971).
2. Joseph A. Gallian, Contemnporary Abstract .4lgebra, 2 nd Edition, DC Heath & Co.,
Lexington, MA (1982).
3. Ivan Niven and lIerbert S. Zuckerman, An Introduction of the Theory of Numbers, 2nd
Edition, John Wiley & Sons, New York, NY (1962).
247