Practice 15
Solution: We use the identity x
3
+ y
3
= x + y
3
− 3xyx + y twice. Then
a
3
+ b
3
+ c
3
− 3abc =
a + b
3
+ c
3
− 3aba + b − 3abc =
a + b + c
3
− 3a + bca + b + c − 3aba + b + c =
a + b + ca + b + c
2
− 3ac − 3bc − 3ab =
a + b + ca
2
+ b
2
+ c
2
− ab − bc − ca If a
, b, c are non-negative then a + b + c ≥ 0 and also a
2
+ b
2
+ c
2
− ab − bc − ca ≥ 0 by 2.13. This gives
a
3
+ b
3
+ c
3
3 ≥ abc.
Letting a
3
= x , b
3
= y , c
3
= z, for non-negative real numbers x , y, z, we obtain the AM-GM Inequality for three quantities.
Practice
110 Problem If a
3
− b
3
= 24 , a − b = 2, find a + b
2
.
111 Problem Shew that for integer n
≥ 2, the expression n
3
+ n + 2
3
4 is a composite integer.
112 Problem If tan x + cot x = a
, prove that tan
3
x + cot
3
x = a
3
− 3a.
113 Problem AIME 1986 What is the largest positive integer n for which
n + 10 |n
3
+ 100?
114 Problem
Find all the primes of the form n
3
+ 1.
115 Problem
Solve the system x
3
+ y
3
= 126 ,
x
2
− xy + y
2
= 21 .
116 Problem Evaluate the sum
1
3
√ 1 +
3
√ 2 +
3
√ 4
+ 1
3
√ 4 +
3
√ 6 +
3
√ 9
+ 1
3
√ 9 +
3
√ 12 +
3
√ 16
.
117 Problem Find a
6
+ a
−6
given that a
2
+ a
−2
= 4 .
118 Problem Prove that
a + b + c
3
− a
3
− b
3
− c
3
= 3a + bb + cc + a 2.17
119 Problem ITT 1994 Let a
, b, c, d be complex numbers satisfying a + b + c + d = a
3
+ b
3
+ c
3
+ d
3
= 0 .
Prove that a pair of the a , b, c, d must add up to 0.
2.4 Miscellaneous Algebraic Identities
We have seen the identity y
2
− x
2
= y − xy + x .
2.18 We would like to deduce a general identity for y
n
− x
n
, where n is a positive integer. A few multiplications confirm that y
3
− x
3
= y − xy
2
+ yx + x
2
, 2.19
y
4
− x
4
= y − xy
3
+ y
2
x + yx
2
+ x
3
, 2.20
and y
5
− x
5
= y − xy
4
+ y
3
x + y
2
x
2
+ yx
3
+ x
4
. 2.21
The general result is in fact the following theorem.
16 Chapter 2
120 Theorem
If n is a positive integer, then y
n
− x
n
= y − xy
n−1
+ y
n−2
x + ··· + yx
n−2
+ x
n−1
.
Proof: We first prove that for a
6= 1. 1 + a + a
2
+ ···a
n−1
= 1 − a
n
1 − a .
For, put S = 1 + a + a
2
+ ··· + a
n−1
. Then aS = a + a
2
+ ··· + a
n−1
+ a
n
. Thus S − aS = 1 + a + a
2
+ ··· + a
n−1
− a + a
2
+ ··· + a
n−1
+ a
n
= 1 − a
n
, and from 1 − aS = S − aS = 1 − a
n
we obtain the result. By making the substitution a =
x y
we see that 1 +
x y
+
x y
2
+ ··· +
x y
n−1
= 1 −
x y
n
1 −
x y
we obtain
1 − x
y
1 + x
y +
x y
2
+ ··· +
x y
n−1
= 1 −
x y
n
, or equivalently,
1 − x
y
1 + x
y +
x
2
y
2
+ ··· +
x
n−1
y
n−1
= 1 − x
n
y
n
. Multiplying by y
n
both sides, y
1 − x
y
y
n−1
1 + x
y +
x
2
y
2
+ ··· +
x
n−1
y
n−1
= y
n
1 − x
n
y
n
, which is
y
n
− x
n
= y − xy
n−1
+ y
n−2
x + ··· + yx
n−2
+ x
n−1
, yielding the result. ❑
☞
The second factor has n terms and each term has degree weight n − 1. As an easy corollary we deduce
121 Corollary If x
, y are integers x 6= y and n is a positive integer then x − y divides x
n
− y
n
. Thus without any painful calculation we see that 781 = 1996 − 1215 divides 1996
5
− 1215
5
.
122 Example E ˝ otv ˝
os 1899 Shew that for any positive integer n, the expression
2903
n
− 803
n
− 464
n
+ 261
n
is always divisible by 1897. Solution: By the theorem above, 2903
n
− 803
n
is divisible by 2903 − 803 = 2100 = 7 · 300 and 261
n
− 464
n
is divisible by −203 = −29
· 7. This means that the given expression is divisible by 7. Furthermore, 2903
n
− 464
n
is divisible by 2903 − 464 = 2439 = 9
· 271 and −803
n
+ 261
n
is divisible by −803 + 261 = −542 = −2 · 271. Therefore as the given expression
is divisible by 7 and by 271 and as these two numbers have no common factors, we have that 2903
n
− 803
n
− 464
n
+ 261
n
is divisible by 7
· 271 = 1897.
123 Example
U M
2
C
4
1987 Given that 1002004008016032 has a prime factor p
250000, find it.
Miscellaneous Algebraic Identities 17
Solution: If a = 10
3
, b = 2 then 1002004008016032 = a
5
+ a
4
b + a
3
b
2
+ a
2
b
3
+ ab
4
+ b
5
= a
6
− b
6
a − b .
This last expression factorises as a
6
− b
6
a − b =
a + ba
2
+ ab + b
2
a
2
− ab + b
2
= 1002
· 1002004 · 998004 =
4 · 4 · 1002 · 250501 · k,
where k 250000. Therefore p = 250501.
Another useful corollary of Theorem 120 is the following.
124 Corollary If f x = a
+ a
1
x + ···+a
n
x
n
is a polynomial with integral coefficients and if a , b are integers then b − a divides
f b − f a.
125 Example Prove that there is no polynomial p with integral coefficients with p2 = 3 and p7 = 17
. Solution: If the assertion were true then by the preceding corollary, 7 − 2 = 5 would divide p7 − p2 = 17 − 3 = 14
, which is patently false.
Theorem 120 also yields the following colloraries.
126 Corollary
If n is an odd positive integer x
n
+ y
n
= x + yx
n−1
− x
n−2
y + x
n−3
y
2
− x
n−4
y
3
+ ··· + x
2
y
n−3
− xy
n−2
+ y
n−1
2.22
127 Corollary Let x
, y be integers, x 6= y and let n be an odd positive number. Then x + y divides x
n
+ y
n
. For example 129 = 2
7
+ 1 divides 2
861
+ 1 and 1001 = 1000 + 1 = 999 + 2 = ··· = 500 + 501 divides
1
1997
+ 2
1997
+ ··· + 1000
1997
.
128 Example Prove the following identity of Catalan:
1 − 1
2 +
1 3
− 1
4 +
··· + 1
2n − 1 −
1 2n
= 1
n + 1 +
1 n + 2
+ ··· +
1 2n
. Solution: The quantity on the sinistral side is
1 + 1
2 +
1 3
+ 1
4 +
··· + 1
2n − 1 +
1 2n
−2
1 2
+ 1
4 +
1 6
+ ··· +
1 2n
=
1 + 1
2 +
1 3
+ 1
4 +
··· + 1
2n − 1 +
1 2n
−2 ·
1 2
1 + 1
2 +
1 3
+ 1
4 +
··· + 1
n
=
1 + 1
2 +
1 3
+ 1
4 +
··· + 1
2n − 1 +
1 2n
−
1 + 1
2 +
1 3
+ 1
4 +
··· + 1
n
= 1
n + 1 +
1 n + 2
+ ··· +
1 2n
, as we wanted to shew.
18 Chapter 2
Practice
129 Problem Shew that 100 divides 11
10
− 1 .
130 Problem Shew that 27195
8
− 10887
8
+ 10152
8
is divisible by 26460.
131 Problem Shew that 7 divides
2222
5555
+ 5555
2222
.
132 Problem Shew that if k is an odd positive integer
1
k
+ 2
k
+ ··· + n
k
is divisible by 1 + 2 +
··· + n.
133 Problem Shew that
x + y
5
− x
5
− y
5
= 5xyx + yx
2
+ xy + y
2
.
134 Problem Shew that
x + a
7
− x
7
− a
7
= 7xax + ax
2
+ xa + a
2 2
.
135 Problem Shew that
A = x
9999
+ x
8888
+ x
7777
+ ··· + x
1111
+ 1 is divisible by B = x
9
+ x
8
+ x
7
+ ··· + x
2
+ x + 1.
136 Problem Shew that for any natural number n, there is another natural number x
such that each term of the sequence x + 1
, x
x
+ 1 , x
xx
+ 1 , . . .
is divisible by n.
137 Problem Shew that 1492
n
− 1770
n
− 1863
n
+ 2141
n
is divisible by 1946 for all positive integers n.
138 Problem Decompose 1 + x + x
2
+ x
3
+ ··· + x
624
into factors.
139 Problem Shew that if 2
n
− 1 is prime, then n must be prime. Primes of this form are called Mersenne primes.
140 Problem Shew that if 2
n
+ 1 is a prime, then n must be a power of 2. Primes of this form are called Fermat primes.
141 Problem Let n be a positive integer and x
y. Prove that x
n
− y
n
x − y ny
n−1
. By choosing suitable values of x and y, further prove than
1 + 1
n
n
1 + 1
n + 1
n+1
and
1 + 1
n
n+1
1 + 1
n + 1
n+2
2.5 Logarithms
