Professional Documents
Culture Documents
The Activity
This activity starts off with a worksheet that students work through together in
groups. It ends with a full class discussion. A copy of the group worksheet is
attached.
Instead of just throwing a Diophantine equation at students and asking them to
guess and check whether the equation had integer solutions, the students are
presented with a concrete example that could later by represented by a
Diophantine equation.
You have 33 packages of candy that you want to give away as gifts. You plan to
give someone either a group of 6 candies or a group of 3 candies. How many of
each grouping should you make? Tell the students their goals are to: 1) use all
33 packages if possible and 2) Try to find all possible combinations.
Provide students with a hands-on tool that will help them come up with possible
combinations. To do this, get some wrapped candy. Group candy together in the
amounts needed for the problem (in this case 3 and 6) and tape candy together
in a vertical line. For example, tape Starbursts candy in vertical groups of 3 and
6. (See picture below) Then cut a strip of paper and mark vertical boxes on the
paper. The key is to make the boxes the same size as whatever candy you are
using. For this example the strip of paper would have to be 33 boxes long. The
students would them place the groups of candy on the strip to see what
combinations they can find that would cover the whole strip. See picture below
to see a blank strip and how some possible combinations of candy would look
when put on the strip.
Starbursts taped together in groups of 6 and 3
To cut down on the amount of supplies needed, it might be helpful to have the
students working in groups. Students might have trouble getting started without
seeing an example first, so go around to each group and if they are having
trouble, put down the candy to show them one possible combination. Once they
see the idea of the activity, they should be able to catch on.
To asses this part of the activity, simply walk around the classroom and observe
what the students are doing. Ask them questions like How do you know you got
all the possible combinations Try to get students to give good verbal
explanations like We know it isnt possible to use two groups of 3 because then
there would be 27 squares left and 6 isnt a multiple of 27. If students are
having trouble verbalizing this, give them a hint like Why cant you have a
combination that uses two sets of 3?
Students would then repeat the activity using a different number of total candies.
It is important to have an example where it is impossible to give away all the
candies so students can begin to see a pattern of when the problem has integer
solutions. So, in this example 32 might be a total number to use. Students can
use the same groups of candy, they would just have to fold the strip of paper so
only 32 boxes are showing.
Student could report their findings in a chart like the one shown below.
Candy
Grouping
Number
of
Packages
6, or 3
33
6, or 3
32
6, or 3
36
Is it possible to
give away all of
the candy?
(yes or no)
If possible, list
all the different
combinations in
ordered pairs.
Before trying to analyze the results, bring the class together to ensure they all
have the correct results. This way, students are not trying to analyze false
results. This can be done by having one group call out their answers and the
rest of the class either agreeing or disagreeing. When two groups disagree it is
best to try to have the two groups try to figure out why they got different answers
as apposed to the teacher just stated which group is correct.
After it has been confirmed that each group has the correct information, students
would be asked to make a conjecture about when its possible to give away all
the candy. This is an analogous way of asking When does a Diophantine
equation have integer solutions? Remind students you are looking for
something more than When the candy can evenly fill up the entire strip If
students need help getting started, you might want to point out to look at the
relationship between the numbers 6, 3, and the total number of packages.
Hopefully students will recognize when the candy total was 33 and 36, all of the
candy packages could be given away. So, they might notice that 3 is a multiple
of 33 and 3 and 6 are both multiples of 36. This might lead to a student
conclusion that all the candy can be given away if one of the grouping numbers
in a multiple of the total number.
activity of candy and a strip of paper to see if their answers were right. The table
below displays some possible groupings and number of candy packages that
could be used.
Candy
Grouping
4, or 6
34
4, or 6
21
2, or 3
25
The goal of this activity is for students to either confirm or reject their conjecture.
This goes along with the Mathematical Processes Benchmark for grades 11-12;
Construct logical verification or counter-examples to test conjectures from the
Ohio academic content standards.
If a student first stated that one of the grouping number must be a multiple of the
total number, they would hopefully realize this was incorrect because 34 candy
packages could be given away if the candy was grouped in 4s and 6s , but
neither 4 nor 6 is a multiple of 34.
Students might need a little hint like Well look at the factors of 4 and 6.
Hopefully some students would realize that the candy can all be given away if the
greatest common divisor of the two grouping numbers is also a factor of the total
number of packages. Its a bit much to expect every student to see this pattern
on his/her own, but it is fair to expect them to understand the pattern.
To see that the possible combinations match the equation visually, students could
graph 4x+3y=34 and see that the three ordered pairs all fall on the line. Also,
when looking at the points on the graph, students might notice that the points are
evenly spread out. This will come up later when trying to find all possible
solutions.
Given that the equation ax+by=c has an integer solution (x 1,y1), all the integer
b
a
t and y y1
t
gcd(a, b)
gcd(a, b)
Extensions
This activity can connect with other various math topics. For advanced students,
this could lead into using the Euclidean algorithm to find the greatest common
divisor of two numbers. Once students are comfortable with the Euclidean
Algorithm, they could learn how to work backwards through it to find one possible
integer solutions.
In this lesson students saw that solutions could be found when given one
equation with two variables. This could lead into future lessons where students
were given more equations with more variables.
Assessment
The assessment of most of this lesson is based off of teacher observations
during the activity. Since a goal was for students to make and test conjectures,
the teacher needs to observe this actually going on. Another way to asses
student learning would be to give students a Diophantine equation and ask them
the following questions:
1. Does this equation have integer solutions? How do you know?
2. What is one possible solution?
3. Write a formula that would give all possible integer solutions.
Instructor Reflection
For this activity, I believe, the assessment of informal observation and
questioning is very important. It is important that students be able to use and
apply the rule that was discovered (as tested in the written assignment stated
above), but the uniqueness of this activity was the fact that the students had to
work to come up with and test the rules themselves. After the lesson was over I
would ask myself Did the students gain problem solving skills and understand
the material, or did they just memorize steps to method? Then, I would alter the
activity depending on how I answered that question.
COPY OF CLASS ACTIVITY HANDOUT
Problem one:
You have 33 packages of candy that you want to give away as Christmas presents. You
plan to give someone either a group of 6 candies or a group of 3 candies. How many of
each grouping should you make?
a. Your goal is to use up all 33 packages, is that possible?
b. If so, what are all the possible combinations if you use all 33
packages?
Note: List your combinations as an ordered pair (x,y). Where x is the number of gifts
with 6 candies and y is the number of gifts with 3 candies.
Problem two:
If you have 32 packages of candy that you want to give away, is it possible to give all 32
away in groups of 6 and 3?
If so, what are all the possibilities?
Problem three:
If you have 36 packages of candy you want to give away, is it possible to give all 36
away in groups of 6 and 3?
If so, what are all the possibilities?
Results
Candy
Grouping
Number of
Packages
6, or 3
33
6, or 3
32
6, or 3
36
Is it possible to give
away all of the
candy?
(yes or no)
Make a guess about a rule that lets you know whether of not its possible to give away
all the candy.
Now use your rule to make a guess about the following questions:
1. If you had 34 candy packages and decided to give away the candy in groups of 4 and 6
is it possible to give away all the candy?
2. If you had 21 candy packages and decided to give away the candy in groups of 4 and 6,
is it possible to give away all the candy?
3. If you had 25 candy packages and decided to give away the candy in groups of 2 and 3
is it possible to give away all the candy?
Now that you have your guess, check to see if you are correct using the blocks. If it is
possible, list the combinations as the ordered pair (x,y).
Results
Candy
Grouping
Number of
Packages
4, or 6
34
4, or 6
21
2, or 3
25
Is it possible to give
away all of the
candy?
(yes or no)
Now that you have seen some more results, do you want to change your rule of how to
tell if all the candy can be given away? (Ask teacher for hint if you need it)