________________________________________________________________________________________
c) If d = 301, then N = ( ? , ? , ? , 301 ) = (a, b, c, 301). Using the second equation in (17) above, and writing in an
abbreviated way, we need to find m and n such that
mn = (m+n)2 - 301.
d = 301
(m+n)2 : 182 = 324 18 192 = 361 19 202 = 400 20
d - 301 - 301 - 301
mn 23 = 1(23) → 24 x 60 = 1(60) → 61 x 99 = 1(99) → 100 x
3(20) → 23 x 911) → 20 ok
4(15) → 19 ok
(Note: The → means add the two factors. Thus, 1(23) → 24 means 1(23) → 1+23 = 24.)
So, we have found two solutions for d = 301; namely, (m,n) = (4,15) and (m,n) = (9,11).
1) For m = 4, n = 15, we get (m,n) = (4,15)
a = mn = 4(15) = 60, b = a + m2 = 60 + 42 = 76, c = a + n2 = 60 + 152 = 285,
giving us ( ? , ? , ? , 301 ) = (60, 76, 285, 301), and
2) for m = 9, n = 11, we get (m,n) = (9,11)
a = mn = 9(11) = 99, b = a + m2 = 99 + 92 = 180, c = a + n2 = 99 + 112 = 220,
giving us ( ? , ? , ? , 301 ) = (99, 180, 220, 301).
__________________________________________________________
Now, in finding the values of m and n which give us Pythagorean quadruples with d = 301, we used the three squares 182, 192, and 202 to get the two solutions we found. Shouldn’t we now try more squares to obtain even more solutions? How do we know when to stop trying with more squares? Well, let’s see.
If we continue by trying the squares 212 through 262, we get the partial tables shown below:
d = 301
(m+n)2 : 212 = 441 222 = 484 232 = 529
d - 301 - 301 - 301
mn 104 mn<d 183 mn<d 228 mn<d
(m+n)2 : 242 = 576 252 = 625 262 = 676
- d - 301 - 301 mn>d - 301 mn>d
mn 275 mn<d 324 375
We know that mn < mn + m2 + n2 = d, so mn is always less than d ( mn < d), and in the tables above for 212, 222, 232, and 242, we do have mn < d. For 212, mn = 104 < 301 = d; for 222, mn = 183 < 301 = d, etc. But, for 252 and 262, we see that
mn > d, which is not possible. Thus, we need to
Try only those squares for which mn < d. (18)
In fact, if we always start with the smallest square that is > d, and then try increasingly larger consecutive squares, then, since d is fixed, eventually mn will become > d for some square and all other squares larger than that one, and no other squares need be tried.
d) If d = 247, then N = ( ? , ? , ? , 247 ) = (a, b, c, 247). Using the second equation in (17) above, we need to find m and n such that
mn = (m+n)2 - 247.
d = 247
(m+n)2 : 162 = 256 16 172 = 289 17 182 = 324 18
d 247 247 247
mn 9 = 1(9) → 10 x 42 = 1(42) → 43 x 77 = 1(77) → 78 x
2(21) → 23 x 7(11) → 18 ok
3(14) → 17 ok
(m+n)2 : 192 = 361 19 202 = 400 20 212 = 441 21
d 247 247 247
mn 114 = 1(114) → 115 x 153 = 9(17) → 26 x 194 = 2(97) → 99 x
2(57) → 59 x
3(38) → 41 x
6(19) → 25 x
(m+n)2 : 222 = 484 22 232 = 529
d 247 247
mn 237 = 3(79) → 82 x 282 mn > d (not possible so we stop here)
So, we have found two solutions for d = 247; namely, (m,n) = (3,14) and (m,n) = (7,11).
1) For m = 3, n = 14, we get (m,n) = (3,14)
a = mn = 3(14) = 42, b = a + m2 = 42 + 32 = 51, c = a + n2 = 42 + 142 = 238
giving us ( ? , ? , ? , 247 ) = (42, 51, 238, 247), and
2) for m = 7, n = 11, we get (m,n) = (7,11)
a = mn = 7(11) = 77, b = a + m2 = 77 + 72 = 126, c = a + n2 = 77 + 112 = 198,
giving us ( ? , ? , ? , 247 ) = (77, 126, 198, 247).
__________________________________________________________
Determining the Number of Consecutive Squares Needed to Find d
From (18), we know that only if mn < d can we find Pythagorean quadruples for d. Look at the tables below which illustrate one of our methods for finding Pythagorean quadruples for d.
k: 1st 2nd 3rd 4th kth
(m+n)2: s2 (s+1)2 (s+2)2 (s+3)2 (s+k-1)2
__ d d _ _ d _ _ d d__ . . . _ d
mn: s2 - d (s+1)2 - d (s+2)2 - d (s+3)2 - d (s+k-1)2 - d,
where s2, (s+1)2, (s+2)2, (s+3)2, . . . are consecutive squares, s2 is the smallest square > d, and k is the number of the square.
In general, (as shown above in the tables), the kth square is (s+k-1)2, and mn = (s+k-1)2 - d. (19)
Since mn must be less than d, we get mn < d.
Substituting from (19), (s+k-1)2 - d < d,
or, (s+k-1)2 < 2d. (20)
__
Solving for k, we get k < 1 + √2d - s (21)
Thus, to determine the number of squares needed to find d, we simply need to find the largest value of k which makes either (20) or (21) true.
Example If d = 247, then the smallest square > 247 is 162 = 256. So, using s2 = 162, s = 16, and d = 247 in (20), we get
(s+k-1)2 < 2d
(16+k-1)2 < 2(247)
(k+15)2 < 494 (22)
Substituting various values of k into (22), we get
k (k+15)2
- - - - - - - - - - - - - - - - - - - - - - - -
1 162 = 256 < 494
3 182 = 324 < 494
6 212 = 441 < 494
- -> 7 222 = 484 < 494
8 232 = 529 > 494
Thus, 7 is the largest value of k which satisfies (22).
_____ ___
Using (21) with s = 16 and d = 247, we get k < 1 + √ 2(247) - 16 = √ 494 - 15 = 7.226, so k < 7.226, and the largest value of k which satisfies k < 7.226 is k = 7, as we just found above using (20).
Thus, we must use 7 squares in finding those primitive Pythagorean quadruples which have d = 247 as a member. Those 7 squares will start with s2 = 162 and end with (k+15)2 = (7+15)2 = 222; namely,
162, 172, 182, 192, 202, 212, and 222. (23)
Note: See 4d) above to see the complete solution to this problem where we used exactly the 7 squares from 162 to 222 as in (23) above.
Example If d = 811, then the smallest square > 811 is 292 = 841. So, using s2 = 292, s = 29, and d = 811 in (20), we get
(s+k-1)2 < 2d
(29+k-1)2 < 2(811)
(k+28)2 < 1622 (24)
Substituting various values of k into (24), we get
k (k+28)2
- - - - - - - - - - - - - - - - - - - - - - - -
2 302 = 900 < 1622
5 332 = 1089 < 1622
10 382 = 1444 < 1622
- -> 12 402 = 1600 < 1622
13 412 = 1681 > 1622
Thus, 12 is the largest value of k which satisfies (24).
_____ ____
Using (21) with s = 29 and d = 811, we get k < 1 + √ 2(811) - 29 = √ 1622 - 28 = 12.274, so k < 12.274, and the largest value of k which satisfies k < 12.274 is k = 12, as we just found above using (20).
Thus, we must use 12 squares in finding those primitive Pythagorean quadruples which have d = 811 as a member. Those 12 squares will start with s2 = 292 and end with (k+28)2 = (12+28)2 = 402; namely,
292, 302, 312, 322, 332, 342, 352, 362, 372, 382, 392, and 402.
Example If d = 481, then the smallest square > 481 is 222 = 484. So, using s2 = 222, s = 22, and d = 481 in (20), we get
(s+k-1)2 < 2d
(22+k-1)2 < 2(481)
(k+21)2 < 962 (25)
Substituting various values of k into (25), we get
k (k+21)2
- - - - - - - - - - - - - - - - - - - - - - - -
1 222 = 484 < 962
3 252 = 625 < 962
9 302 = 900 < 962
--> 10 312 = 961 < 962
11 322 = 1024 > 962
Thus, 10 is the largest value of k which satisfies (23), which tells us that we must use 10 squares in finding those primitive Pythagorean quadruples which have d = 481 as a member. Those 10 squares will start with s2 = 222 and end with (k+21)2
= (10+21)2 = 312; namely, 222, 232, 242, 252, 262, 272, 282, 292, 302 and 312.
Let’s find all the quadruples with d = 481 as a member.
If d = 481, then N = ( ? , ? , ? , 481 ) = (a, b, c, 481). Using the second equation in (17) above, and writing in an abbreviated way, we need to find m and n such that
mn = (m+n)2 - 481.
d = 481
(m+n)2 : 222 = 484 22 232 = 529 23 242 = 576 24
d 481 __ 481 481
mn 3 = 1(3) → 4 x 48 = 1(48) → 49 x 95 = 1(95) → 96 x
3(16) → 19 x 5(19) → 24 ok
(m+n)2 : 252 = 625 25 262 = 676 26 272 = 729 27
d 481 481 481
mn 144 = 1(144) → 145 x 195 = 5(39) → 44 x 248 = 8(31) → 39 x
9(16) → 25 ok 13(15) → 28 x
(m+n)2 : 282 = 784 28 292 = 841 29 302 = 900 30
d 481 481 481
mn 303 = 3(101) → 104 x 360 = 5(72) → 77 x 419 = 1(419) → 420 x
8(45) → 53 x
(m+n)2 : 312 = 961 31 322 = 1024
d 481 481
mn 480 = 3(160) → 163 x 543 mn > d (not possible, so we stop here)
5(96) → 101 x
15(32) → 47 x
Thus, we have found two solutions for d = 481; namely, (m,n) = (5,19) and (m,n) = (9,16).
1) For m = 5 n = 19, we get (m,n) = (5,19)
a = mn = 5(19) = 95, b = a + m2 = 95 + 52 = 120, c = a + n2 = 95 + 192 = 456
giving us ( ? , ? , ? , 481 ) = (95, 120, 456, 481), and
2) for m = 9, n = 16, we get (m,n) = (9,16)
a = mn = 9(16) = 144, b = a + m2 = 144 + 92 = 225, c = a + n2 = 144 + 162 = 400,
giving us ( ? , ? , ? , 481 ) = (144, 225, 400, 481).
Note that a = 144 = 122, b = 225 = 152, and c = 400 = 202 are all perfect squares. How very nice!
___________________
Determining Which Positive Integers Can Be Values for d
What kind of integers d can be members of a primitive Pythagorean quadruple? Well, Theorem 3 above tells us that d is always an odd integer, so we have
d must always be an odd positive integer. (26)
But, will any odd positive integer work? No. 17 is an odd positive integer, but 17 is never a value for d, which can be confirmed by looking at the tables above or by using the procedures for finding d discussed in detail above. The same is true for 45 and 63 and many others.
Look at the sums of the digits for each of the d’s in the small tables for Pythagorean quadruples above. For each sum, either
a) the sum is divisible by 3, and thus d is of the form 3L for some integer L, or
b) the sum is 1 more than a sum which is divisible by 3, and thus d is of the form 3L+1, but
c) the sum is never 2 more than a sum which is divisible by 3, and thus d is never of the form 3L+2.
Let’s see why this is.
Now, n > m, so we can write n = m + k for k = 1, 2, 3 . . . Then
d = mn + m2 + n2 = m(m + k) + m2 + (m + k)2 = m2 + mk + m2 + m2 + 2mk + k2
= 3m2 + 3mk + k2 = 3(m2 + mk) + k2 = 3L + k2 for some integer L. Thus,
If d is a member of a primitive Pythagorean quadruple, and n = m + k,
then d = 3L + k2, for some positive integers L and k. (27)
Look at the following table showing the values of k and d = 3L + k2 for k = 1 to 9.
Table 1
k d = 3L + k2 Form of d
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
1 3L + 1 → 3L + 1
2 3L + 4 = 3L + 3 + 1 = 3(L+1) + 1 = 3L1 + 1 → 3L + 1
3 3L + 9 = 3(L + 3) = 3L1 → 3L
4 3L + 16 = 3L + 15 + 1 = 3(L+5) + 1 = 3L1 + 1 → 3L + 1
5 3L + 25 = 3L + 24 + 1 = 3(L+8) + 1 = 3L1 + 1 → 3L + 1
6 3L + 36 = 3(L + 12) = 3L1 → 3L
7 3L + 49 = 3L + 48 + 1 = 3(L+16) + 1 = 3L1 + 1 → 3L + 1
8 3L + 64 = 3L + 63 + 1 = 3(L+21) + 1 = 3L1 + 1 → 3L + 1
9 3L + 81 = 3(L + 27) = 3L1 → 3L
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
As we can see in the last column on the right, d is always of the form 3L or 3L+1, but never 3L+2.
In general, any integer divided by 3 will either have no remainder or a remainder of 1 or 2. Thus, if k is divided by three, then either
a) k will have no remainder, and k = 3p, or
b) k will have a remainder of 1, and k = 3p+1, or
c) k will have a remainder of 2, and k = 3p+2 for some integer p.
In general, for k = 3p, 3p+1, and 3p+2, p = 0, 1, 2 . . . , we have Table 2 shown below:
Table 2
k
(p=0,1, . . .) d = 3L + k2 Form of d
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
3p 3L + 9p2 = 3(L + 3p2) = 3L1 → 3L
3p + 1 3L + (3p+1)2 = 3L + 9p2 + 6p + 1 = 3(L+3p2 + 2p) + 1 = 3L1 + 1 → 3L + 1
3p + 2 3L + (3p+2)2 = 3L + 9p2 + 12p + 4 = 3(L+3p2 + 4p + 1) + 1 = 3L1 + 1 → 3L + 1
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
which proves
Theorem 7a
If d is a member of a primitive Pythagorean quadruple (a, b, c, d),
then d is odd and of the form 3L or 3L+1 but never of the form 3L+2,
for some positive integer L.
____________________________________________________
Thus, any d which is a member of a primitive Pythagorean quadruple must be odd and of the form 3L or 3L+1. However, is the converse of this statement true?; that is,
Is any odd number which is in the form of 3L or 3L+1, a member d of a primitive Pythagorean quadruple (a, b, c, d)?
Unfortunately, the answer is no. 45 is of the form 3L; namely, 45 = 3(15), but 45 is not a member of any primitive Pythagorean quadruple as can be seen by examining the tables above. So, what is wrong?
Well, if we look at the prime factors of 45, we get 45 = 3(3)(5), and we see that one of its factors, 5, is not of the form 3L or 3L+1. It is of the form 3L+2; namely, 5 = 3(1)+2. And, 45 is not a member of any primitive Pythagorean quadruple.
187 is of the form 3L+1; namely, 187 = 3(62) +1, but 187 is not a member of any primitive Pythagorean quadruple as can be seen by examining the tables above or using the procedures for d above. So, what is wrong?
Again, if we look at the prime factors of 187, we get 187 = 11(17), and we see that both of its factors, 11 and 17 are not of the form 3L or 3L+1. They are both of the form 3L+2; namely, 11 = 3(3)+2, and 17 = 3(5)+2 And, 187 is not a member of any primitive Pythagorean quadruple. Thus, we have
The prime factors of d must be odd and of the form 3L or 3L+1 but not 3L+2, (28)
giving us
Theorem 7b
For d to be a member of a primitive Pythagorean quadruple (a, b, c, d),
d and its prime factors must be odd and of the form 3L or 3L+1, but
not 3L+2, for some positive integer L.
____________________________________________________
Since d = mn + m2 + n2, we can write d in the following manner:
d = mn + m2 + n2 = mn + m2 + n2 + 2mn - 2mn
= 3mn + m2 - 2mn + n2
= 3mn + (m - n)2. (29)
Looking at (29), we see that for d to have a factor of 3, then m - n must have a factor of 3. So, if for some integer p,
m - n = 3p, (30)
then, from (29), d = 3mn + (3p)2 = 3mn + 9p2 = 3(mn + 3p2), (31)
which shows us that d can have a factor of 3.
However, looking at the right-hand side of (31); namely,
d = 3mn + (3p)2 = 3mn + 9p2 = 3(mn + 3p2), (31)
↑
(must have a factor of 3)
we see that for d to have more than one factor of 3, then mn must have a factor of 3, which implies that either m or n must have a factor of 3. Let’s say that n has a factor of 3. Then, n = 3q. But, from (30), we have m - n = 3p, or m = n + 3p =
3q + 3p = 3(q + p), which shows that m also has a factor of 3. Thus, m and n have a common factor, which is not possible for primitive Pythagorean quadruples, and therefore, d cannot have more than one factor of 3. (The result is the same if we assume that m has a factor of 3.) All this gives us
Theorem 7c
For d to be a member of a primitive Pythagorean quadruple (a, b, c, d), d and its
prime factors must be odd and of the form 3L or 3L+1, but not 3L+2, for some
positive integer L, with no more than one prime factor of 3.
____________________________________________________________
Now, since d can have no more than one prime factor of 3, then either
a) d has no prime factors of 3 and therefore must be a product of only prime factors of the form
3L+1, since factors of the form 3L have a prime factor of 3, making d be of the form 3L+1, or
b) d has one prime factor of 3 and therefore must be a product of just one 3 and prime factors of
the form 3L+1, making d be of the form 3(3L+1).
This gives us
Theorem 7d
For d to be a member of a primitive Pythagorean quadruple (a, b, c, d), d must be
odd and of the form 3L+1 or 3(3L+1) with no even prime factors or prime factors
of the form 3L+2, L = 0,1,2, . . .
_____________________________________________________________________
Now, in Theorem 7d, d and its prime factors must always be odd. Thus, 3L+1 must be odd, which occurs only when L is even, for if L were odd, then 3L would be odd, and 3L+1 would be even. So, if L is even, say L = 2L1, then 3L+1 = 3(2L1)+1 = 6L1 + 1, and d must be of the form 6L1 + 1 for L1 some positivetive integer. So,
If d is odd and of the form 3L+1, then d is of the form 6L1+1. (33)
Also, 3L+2 must be odd, which occurs only when L is odd, for if L were even, then 3L would be even, and 3L+2 would be even. So, if L is odd, say L = 2L1+1, then 3L+2 = 3(2L1+1)+2 = 6L1 + 5, and none of the prime factors of d must be of the form 6L1 + 5 for L1 some non-negative integer. So,
If the prime factors of d are odd and of the form 3L+2, then these prime factors are of the form 6L1+5. (34)
Thus, (33) and (34) give us our final theorem about d; namely
Theorem 8
For d to be a member of a primitive Pythagorean quadruple (a, b, c, d),
d must be of the form 6L+1 or 3(6L+1) with no prime factors of the
form 6L+5, L = 0, 1, 2, . . .
_____________________________________________________
Example Can any of the following numbers be values of d in a primitive Pythagorean quadruple?
189 No. 189 = 9(21) = 3(3)3(7), which has more than one prime factor of 3, so 189 can not be put in the form of
either 6L+1 or 3(6L+1).
111 Yes. 111 = 3(37) = 3[6(6)+1], which is in the form 3(6L+1), and there are no prime factors of the form 6L+5.
(10, 11, 110, 111) (m,n) = (1,10)
889 Yes. 889 = 6(148)+1, which is in the form 6L+1 and none of its prime factors are of the form 6L+5, since
889 = 7(127), where 7 = 6(1)+1 and 127 = 6(21)+1, both being prime factors of the form 6L+1.
(200, 264, 825, 889) (m,n) = (8,25)
527 No. 527 = 6(87)+5, which is in the form of 6L+5, and one of its prime factors is of the form 6L+5, since
527 = 17(31), and 17 = 6(2)+5 is a prime factor of the form 6L+5.
Using the Quadratic Formula to find m and n for d
Now, d = mn + m2 + n2. So, let’s use the quadratic formula to solve this equation for n.
d = mn + m2 + n2.
n2 + mn + (m2 - d) = 0
____________ ________
- m +/- √ m2 - 4(m2 - d) - m +/- √ 4d - 3m2
n = -------------------------------------- = -------------------------------- (35)
2 2
Looking at the right-hand side of (35), we see that
1) 4d - 3m2 must be > 0 so that n is a real number. So,
4d - 3m2 > 0
4d > 3m2
3m2 < 4d
m2 < 4d/3
____
m < √ 4d/3
____
Thus, 1 < m < √ 4d/3. (36)
2) 4d - 3m2 must be a perfect square, say p2, so that n may be an integer.
Thus, 4d - m2 = p2, for some positive integer p. (37)
3) Since m < n, and m can be equal to 1, we must have n > 2. Thus,
________
- m +/- √ 4d - 3m2
n = ---------------------------------- > 2
2
________
- m +/- √ 4d - 3m2 > 4
________
+/- √ 4d - 3m2 > m + 4
4d - 3m2 > (m + 4)2
4d > 3m2 + m2 + 8m + 16
d > m2 + 2m + 8
Thus, m2 + 2m + 8 < d so that n > 2, (38)
giving us:
Theorem 9
If d and p are positive integers, and there exists a positive integer m such that
4d - 3m2 = p2, a perfect square,
then d is a member of a primitive Pythagorean quadruple (a, b, c, d), and
____
a) 1 < m < √ 4d/3
b) m2 + 2m + 8 < d
c) n = ( - m + p )/2
d) d = mn + m2 + n2,
___________________________________________________________
Example In a primitive Pythagorean quadruple (a, b, c, d), can d = 19? According to Theorem 9, if we can find a positive integer m which makes 4d - 3m2 = 4(19) - 3m2 = 76 - 3m2 a perfect square, then d = 19 will be a member of a primitive Pythagorean quadruple (a, b, c, d). From a) and b), we get
____ ______
a) √ 4d/3 = √ 4(19)/3 = 5.03, so 1 < m < 5.03, and we will use m = 1, 2, 3, 4, 5.
b) m2 + 2m + 8 < 19 is true for m = 1, 2, and 3, but not for m = 4 and 5. So, we need to use only m = 1, 2, and 3.
Substituting these values of m into 4d - 3m2 = 4(19) - 3m2 = 76 - 3m2, we have
m 76 - 3m2 = p2
- - - - - - - - - - - - - - - - - - - - -- - - - - - - - - - -
1 76 - 3 = 73
2 76 - 12 = 64 = 82, a perfect square.
3 76 - 27 = 49 = 72, a perfect square.
When m = 2 or 3, p2 = 76 - 3m2 is a perfect square, so d = 19 is a member of a primitive Pythagorean quadruple
(a, b, c, d).
For m = 2, p = 8, and from c) of Theorem 9, n = (- m + p) / 2 = (- 2 + 8) / 2 = 3. (m,n) = (2,3)
For m = 3, p = 7, and from c) of Theorem 9, n = (- m + p) / 2 = (- 3 + 7) / 2 = 2. So, m = 3 and n = 2, but this makes
m > n, and we require m < n.
Thus, a = mn = 2(3) = 6, b = a + m2 = 6 + 22 = 10, c = a + n2 = 6 + 32 = 15, and d = c + m2 = 15 + 22 = 19,
giving us (6, 10, 15, 19) as a quadruple with d = 19.
Example In a primitive Pythagorean quadruple (a, b, c, d), can d = 201? According to Theorem 7, if we can find a positive integer m which makes 4d - 3m2 = 4(201) - 3m2 = 804 - 3m2 a perfect square, then d = 201 will be a member of a primitive Pythagorean quadruple (a, b, c, d). From a) and b), we get
____ _______
a) √ 4d/3 = √ 4(201)/3 = 16.37, so 1 < m < 16.37, and we will use m = 1, 2, 3, 4, 5, . . . , 16.
b) m2 + 2m + 8 < 201 is true for m = 1, 2, 3, . . . , 12, but not for m = 13, 14, 15, and 16.
So, we need to use only m = 1, 2, 3, . . . , 12.
Substituting these values of m into 4d - 3m2 = 4(201) - 3m2 = 804 - 3m2, we have
m 804 - 3m2 = p2
- - - - - - - - - - - - - - - - - - - - -- - - - - - - - - - -
1 804 - 3 = 801
2 804 - 12 = 792
3 804 - 27 = 777
4 804 - 48 = 756
5 804 - 75 = 729 = 272
6 804 - 108 = 696
7 804 - 147 = 657
8 804 - 192 = 612
9 804 - 243 = 561
10 804 - 300 = 504
11 804 - 363 = 441 = 212
12 804 - 432 = 372
When m = 5 or 11, p2 = 804 - 3m2 is a perfect square, so d = 201 is a member of a primitive Pythagorean
quadruple (a, b, c, d).
For m = 5, p = 27, and from c) of Theorem 9, n = (- m + p) / 2 = (- 5 + 27) / 2 = 11. (m,n) = (5,11)
For m = 11, p = 21, and from c) of Theorem 9, n = (- m + p) / 2 = (- 11 + 21) / 2 = 5. So, m = 11 and n = 5, but this
makes m > n, and we require m < n.
Thus, a = mn = 5(11) = 55, b = a + m2 = 55 + 52 = 80, c = a + n2 = 55 + 112 = 176, and d = c + m2 = 176 + 52 = 201,
giving us
(55, 80, 176, 201)
as a quadruple with d = 201.
___________________________________________________________________________________________