MTH 4436 HW Set 2

Fall, 2001
Pat Rossi Name

Set 1.3
1.a. A number is triangular if and only if it is of the form n(n+1)
2
for some n ∈ N.
n(n+1)
Proof. By problem 1.a. of set 1.1, (1 + 2 + 3 + . . . + n) = 2 .
For any n ∈ N, note that tn = (1 + 2 + 3 + . . . + n) , and hence, tn = n(n+1)
2
.
Thus, if a natural number m is triangular, then m = tn for some n ∈ N, which implies
that m = n(n+1)
2
.
Conversely, if a natural number m = n(n+1)
2
for some n ∈ N, then m = (1 + 2 + 3 + . . . + n) ,
and hence, m = tn .
1.c. The sum, of any two consecutive triangular numbers is a perfect square.
Proof. Note that In+1 = In + (n + 1) . (Geometrically, the n + 1st triangle is formed by
taking the nth triangle and adding a row containing n + 1 dots.)
Combine this with the result from part a) that the nth triangular number, In = n(n+1)
2
,
and we have:
n (n + 1)
In + In+1 = In + [In + (n + 1)] = 2In + n + 1 = 2 +n+1=
2

n (n + 1) + n + 1 = (n + 1) (n + 1) = (n + 1)2
i.e., In + In+1 = (n + 1)2
Hence, the sum of any two consecutive triangular numbers is a perfect square.

7. Show that the difference between the squares of two consecutive triangular numbers
is always a cube.
Proof. Let tn+1 and tn be any two consecutive triangular numbers.
³ ´ ³ ´
(n+1)(n+2) 2 n(n+1) 2 (n+2)2 −n2
Observe: (tn+1 )2 − (tn )2 = 2
− 2
= (n + 1)2 · 4

(n2 +4n+4−n2 )
= (n + 1)2 · 4
= (n + 1)2 · (4n+4)
4
= (n + 1)2 · (n + 1) = (n + 1)3 .
i.e., (tn+1 )2 − (tn )2 = (n + 1)3

Set 2.1
1. Prove that if a and b are integers, with b > 0, then there exist unique integers q and r
satisfying:
a = qb + r with 2b ≤ r < 3b

Observe: The Division Algorithm guarantees that if a and b are integers, with b > 0,
then there exist unique integers q0 and r0 satisfying:

a = q 0 b + r0 with 0 ≤ r0 < b
If we define r = r0 + 2b, then 2b ≤ r < 3b.
The trick now, is to define q such that a = qb + r with 2b ≤ r < 3b.
To do this, we start with the relationship guaranteed by the Division Algorithm,
namely:
a = q 0 b + r0 with 0 ≤ r0 < b

Since r = r0 + 2b (or equivalently, r0 = r − 2b), we can substitute r − 2b for r0 . This

yields:
a = q 0 b + (r − 2b) with 2b ≤ r < 3b
a = (q 0 − 2) b + r with 2b ≤ r < 3b

This suggests that we let q = q0 − 2. This yields:

a = qb + r with 2b ≤ r < 3b

2
2. Show that any integer of the form 6k + 5 is also of the form 3j + 2, but not conversely.
Let n = 6k + 5. Then n = 6k + 5 = 3 (2k) + 5 = 3 (2k) + 3 + 2 = 3 (2k + 1) + 2.
Thus, n = 6k + 5 = 3j + 2, where j = 2k + 1.
To show that the converse does NOT hold, let n = 3j + 2.
For j = 2, we have n = 3 (2) + 2 = 8
If n = 3j + 2 = 6k + 5, then n = 3j + 2 = 8 = 6k + 5.
But 6k + 5 = 8 ⇒ 6k = 3 ⇒ k = 32 , which is not an integer.
Hence, for j = 2, n = 3j + 2 6= 6k + 5

3. Use the Division Algorithm to establish the following:

(a) The square of any integer is either of the form 3k or 3k + 1.

Let n be an integer. By the Division Algorithm, either

n = 3m
n = 3m + 1
n = 3m + 2

If n = 3m, then n2 = (3m)2 = 9m2 = 3 (3m2 ) = 3k, for k = 3m2

If n = 3m + 1, then n2 = (3m + 1)2 = 9m2 + 6m + 1 = 3 (3m2 + 2m) + 1 = 3k + 1,

for k = 3m2 + 2m

If n = 3m + 2, then n2 = (3m + 2)2 = 9m2 + 12m + 4 = 9m2 + 12m + 3 + 1 =

3 (3m2 + 4m + 1) + 1 = 3k + 1, for k = 3m2 + 4m + 1.

Hence, for any integer n, n2 is either of the form 3k or 3k + 1.

(b) The cube of any integer has one of the forms, 9k, 9k + 1, or 9k + 8.
Let n be an integer. By the Division Algorithm, either

n = 3m
n = 3m + 1
n = 3m + 2

If n = 3m, then n3 = (3m)3 = 27m3 = 9 (3m3 ) = 9k, for k = 3m3

If n = 3m + 1, then n3 = (3m + 1)3 = 27m3 + 27m2 + 9m + 1 =
9 (3m3 + 3m2 + m) + 1 = 9k + 1, for k = 3m3 + 3m2 + m
If n = 3m + 2, then n3 = (3m + 2)3 = 27m3 + 54m2 + 36m + 8 =
9 (2m3 + 2m2 + 4m) + 8 = 9k + 8, for k = 2m3 + 2m2 + 4m
Hence, for any integer n, n3 has one of the forms, 9k, 9k + 1, or 9k + 8.

3
 (c) The fourth power of any integer is either of the form 5k or 5k + 1.
Let n be an integer. By the Division Algorithm, either

n = 5m
n = 5m + 1
n = 5m + 2
n = 5m + 3
n = 5m + 4

If n = 5m, then n4 = (5m)4 = 625m4 = 5 (125m4 ) = 5k, for k = 125m4

If n = 5m + 1, then n4 = (5m + 1)4 = 625m4 + 500m3 + 150m2 + 20m + 1 =
5 (125m4 + 100m3 + 30m2 + 4m)+1 = 5k+1, for k = 125m4 +100m3 +30m2 +4m

If n = 5m + 2, then n4 = (5m + 2)4 = 625m4 + 1000m3 + 600m2 + 160m + 16 =

625m4 + 1000m3 + 600m2 + 160m + 15 + 1 =
5 (125m4 + 200m3 + 125m2 + 32m + 3) + 1 =
5k + 1, for k = 125m4 + 200m3 + 125m2 + 32m + 3

If n = 5m + 3, then n4 = (5m + 3)4 = 625m4 + 1500m3 + 1350m2 + 540m + 81 =

625m4 + 1500m3 + 1350m2 + 540m + 80 + 1 =
5 (125m4 + 300m3 + 270m2 + 108m + 16) + 1 =
5k + 1, for k = 125m4 + 300m3 + 270m2 + 108m + 16

If n = 5m+ 4, then n4 = (5m + 4)4 = 625m4 +2000m3 +2400m2 + 1280m+256 =

625m4 + 2000m3 + 2400m2 + 1280m + 255 + 1 =
5 (125m4 + 400m3 + 480m2 + 256m + 51) + 1 =
5k + 1, for k = 125m4 + 400m3 + 480m2 + 256m + 51

Hence, for any integer n, n4 is either of the form 5k or 5k + 1.

4. Prove that 3a2 − 1 is never a perfect square.

Observe that 3a2 − 1 = 3 (a2 − 1) + 2 = 3k + 2, for k = a2 − 1.
The results of problem 3.a tell us that the square of an integer must either be of the
form 3k or 3k + 1. Hence, 3a2 − 1 = 3k + 2 cannot be a perfect square.

5. For n ≥ 1, prove that n (n + 1) (2n + 1) /6 is an integer.

Let n be an integer. By the Division Algorithm, either

n = 6m
n = 6m + 1
n = 6m + 2
n = 6m + 3
n = 6m + 4
n = 6m + 5

4
 If n = 6m, then n (n + 1) (2n + 1) /6 = 6m (6m + 1) (2 (6m) + 1) /6 =
(432m3 + 108m2 + 6m) /6 = 72m3 + 18m2 + m
i.e., n (n + 1) (2n + 1) /6 is an integer, for n = 6m

If n = 6m+1, then n (n + 1) (2n + 1) /6 = (6m + 1) [(6m + 1) + 1] [2 (6m + 1) + 1] /6 =

(432m3 + 324m2 + 78m + 6) /6 = 72m3 + 54m2 + 13m + 1
i.e., n (n + 1) (2n + 1) /6 is an integer, for n = 6m + 1

If n = 6m+2, then n (n + 1) (2n + 1) /6 = (6m + 2) [(6m + 2) + 1] [2 (6m + 2) + 1] /6 =

(432m3 + 540m2 + 222m + 30) /6 = 72m3 + 90m2 + 37m + 5
i.e., n (n + 1) (2n + 1) /6 is an integer, for n = 6m + 2

If n = 6m+3, then n (n + 1) (2n + 1) /6 = (6m + 3) [(6m + 3) + 1] [2 (6m + 3) + 1] /6 =

(432m3 + 756m2 + 438m + 84) /6 = 72m3 + 126m2 + 73m + 14
i.e., n (n + 1) (2n + 1) /6 is an integer, for n = 6m + 3

If n = 6m+4, then n (n + 1) (2n + 1) /6 = (6m + 4) [(6m + 4) + 1] [2 (6m + 4) + 1] /6 =

(432m3 + 972m2 + 726m + 180) /6 = 72m3 + 162m2 + 121m + 30
i.e., n (n + 1) (2n + 1) /6 is an integer, for n = 6m + 4

If n = 6m+5, then n (n + 1) (2n + 1) /6 = (6m + 5) [(6m + 5) + 1] [2 (6m + 5) + 1] /6 =

(432m3 + 1188m2 + 1086m + 330) /6 = 72m3 + 198m2 + 181m + 55
i.e., n (n + 1) (2n + 1) /6 is an integer, for n = 6m + 5

Thus, n (n + 1) (2n + 1) /6 is an integer for all integers, n.

6. Show that the cube of any integer is of the form 7k or 7k ± 1.

Let n be an integer. By the Division Algorithm, either

n = 7k
n = 7k + 1
n = 7k + 2
n = 7k + 3
n = 7k + 4
n = 7k + 5
n = 7k + 6

If n = 7m, then n3 = (7m)3 = 343m3 = 7 (49m3 ) = 7k.

Hence, if n = 7m, then n3 = 7k, for k = 49m3

If n = 7m + 1, then n3 = (7m + 1)3 = 343m3 + 147m2 + 21m + 1 =

7 (49m3 + 21m2 + 3m) + 1 = 7k + 1.
Hence, if n = 7m + 1, then n3 = 7k + 1, for k = 49m3 + 21m2 + 3m

5
 If n = 7m + 2, then n3 = (7m + 2)3 = 343m3 + 294m2 + 84m + 8 =
343m3 + 294m2 + 84m + 7 + 1 = 7 (49m3 + 42m2 + 12m + 1) + 1 = 7k + 1.
Hence, if n = 7m + 1, then n3 = 7k + 1, for k = 49m3 + 42m2 + 12m + 1

If n = 7m + 3, then n3 = (7m + 3)3 = 343m3 + 441m2 + 189m + 27 =

343m3 + 441m2 + 189m + 28 − 1 = 7 (49m3 + 63m2 + 27m + 4) − 1 = 7k − 1.
Hence, if n = 7m + 3, then n3 = 7k − 1, for k = 49m3 + 63m2 + 27m + 4

If n = 7m + 4, then n3 = (7m + 4)3 = 343m3 + 588m2 + 336m + 64 =

343m3 + 588m2 + 336m + 63 + 1 = 7 (49m3 + 84m2 + 48m + 9) + 1 = 7k + 1.
Hence, if n = 7m + 4, then n3 = 7k + 1, for k = 49m3 + 84m2 + 48m + 9

If n = 7m + 5, then n3 = (7m + 5)3 = 343m3 + 735m2 + 525m + 125 =

343m3 + 735m2 + 525m + 126 − 1 = 7 (49m3 + 105m2 + 75m + 18) − 1 = 7k − 1.
Hence, if n = 7m + 5, then n3 = 7k − 1, for k = 49m3 + 105m2 + 75m + 18

If n = 7m + 6, then n3 = (7m + 6)3 = 343m3 + 882m2 + 756m + 216 =

343m3 + 882m2 + 756m + 217 − 1 = 7 (49m3 + 126m2 + 108m + 31) − 1 = 7k − 1.
Hence, if n = 7m + 5, then n3 = 7k − 1, for k = 49m3 + 126m2 + 108m + 31

Hence, the cube of any integer is of the form 7k or 7k ± 1.

7. Prove that no integer in the following sequence is a perfect square:

11, 111, 1111, 11111, . . .

First, observe that the first term, 11, is not a perfect square.
Next. observe that after the first term of the sequence, a typical term, 111 . . . 111, can
be written as
111 . . . 108 + 3 = 4k + 3

By an earlier observation, any perfect square fits either the form 4k or the form 4k + 1.
Hence, no term in the sequence can be a perfect square.