As promised, here is the open-ended, rubric-based, holistically scored, performance-assessed, student-constructed first problem from MathNotation's Third Contest:
1. A primitive Pythagorean triple is defined as an ordered triple of positive integers (a,b,c) in which a2 + b2 = c2 and the greatest common factor (divisor) of a, b and c is 1. If (a,b,c) form such a triple, explain why c cannot be an even integer.
Comments
(a) The content here is number theory. Is some of this covered in your district's middle school curriculum or beyond? More importantly, at what point do students begin to formulate and write valid mathematical arguments?
(b) The immediate reaction of most students was that this seemed like a fairly simple problem. However, only a couple of teams scored any points. Perhaps the challenge here was the construction of a deductive argument, although as you will see below, there is one challenging part.
(c) There were two successful approaches used by the teams. Both involved indirect reasoning. Do your students begin to do these in middle school or are "proofs" first introduced in geometry?
(d) I allowed students to assume without proof the following:
(i) The general rules of parity of the sum of two integers
(ii) The square of a positive integer has the same parity as the integer
(e) Interestingly, none of the teams considered an algebraic approach to the one challenging case, i.e., demonstrating that the sum of the squares of two odd integers is not divisible by 4.
If a and b are odd, they can be represented as
a = 2m+1 and b = 2n+1, where m and n are integers.
Then a2 + b2 = (2m+1)2 + (2n+1)2 =
(4m2 + 4m + 1) + (4n2 + 4n + 1) =
4(m2 + n2) + 4(m + n) + 2, which leaves a remainder of 2 when divided by 4.
BUT, if c is even, say c = 2k, then c2 = 4k2, which is divisible by 4.
(f) The two best solutions came from our first and second place teams, Chiles HS in FL and Hanover Park Middle School in CA. Both used the ideas of congruence modulo 4.
Here is the indirect method used by Chiles:
Let's assume that c can be an even integer. We'll prove by contradiction. An even integer can be summed in two ways:
1. with two even integers or
2. two odd integers
If it is the latter case, then looking at the residuals of modulo 4, the two odd integers summed will be equal to 2, but this is not the case as 2 is not a modulo of 4 residue. If it is the former case, then it does not satisfy the problem as then a, b, and c have common factor of 2. Therefore c must be an odd integer. Q.E.D.
Here is the indirect method used by Hanover Park:
Suppose, for the sake of contradiction, that there is a PPT (primitive Pythagorean Triple) s.t. c is even. Then c2 ≡ 0 (mod 4).
We break this into cases based on the parity of a,b.
Case I: Both a and b are even; gcd(a,b,c) ≥ 2 because a,b,c are even, a contradiction.
Case 2: One of a and b is even. Then, a2 + b2 ≡ 0 + 1 ≡ 1
not ≡ 0 (mod 4), a contradiction.
Case 3: Both of a, b are odd. Then a2 + b2 ≡ 1 + 1 ≡ 2
not ≡ 0 (mod 4), a contradiction.
We have covered all cases for a, b with no valid cases. Thus, in a PPT, c cannot be even.
Both of these arguments represent a more sophisticated understanding of mathematics and the methods of proof. Clearly, these students are quite advanced and exceptional, however, I feel many middle school teachers begin early on to encourage their students to explain their thought processes both orally and in writing. Am I right? I would like to hear your thoughts on this...