Number Theory
Number Theory
Number Theory
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
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
n = 3m
n = 3m + 1
n = 3m + 2
n = 3m
n = 3m + 1
n = 3m + 2
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
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
n = 7k
n = 7k + 1
n = 7k + 2
n = 7k + 3
n = 7k + 4
n = 7k + 5
n = 7k + 6
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
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.