Proofathon Algebra Solutions

Cody Johnson
24 January 2014 2 February 2014
1. Solve for x if x((x 3)x + 2017) = 2.
Solution (by Ahaan Rungta).
x((x 3)x + 2017) = 2 = x3 3x2 + 2017x 2 = 0
Now, we use the Cubic Formula to find one of the roots. It states that if


b 3 bc 3ad c
(p, q, r) = , p +
,
,
3a
6a2
3a
then

r
x=

q
q+

r
q2

+ (r

3
p2 )

q 2 + (r p2 )

is a root. Note that, here, we have a = 1, b = 3, c = 2017, and d = 2. Substituting this truckload,
we get that
s
r

2
1 
3
3

+
x = 1 2014
13 582002193 18117
18
3 13 582002193 18117
is a root. If we let this be v, then divide the original cubic by x v to get a quadratic. The solutions
to the resulting quadratic are
s


2

x = 1 + 1007 1 i 3 3
3 13 582002193 18117

! r

1 
1i 3
3

13 582002193 18117 ,
2
18

and we are done.

2. Let m, n, k be three positive reals, and let b =


m2 + k 2 , a =

n2 + k 2 . If

2 
2


bn
am
1
1
+m
+ n = (m + n)2 k 2

,
b+m+n
a+m+n
(a + m + n)2
(b + m + n)2

show that m = n.
Solution. Consider a triangle 4ABC with coordinates A(0, k), B(m, 0), and C(n, 0). Let the
internal angle bisector of B and C meet CA and BA at D and E, respectively. Since BC = m + n,
BA = b, and CA = a, we have


bn
(m + n)k
D=
,
m+n+b m+n+b


an
(m + n)k
E=
,
m+n+a m+n+a
as a consequence of the angle bisector theorem. From the given conditions, we have


2 
2 
2 
2
bn
(m + n)k
bn
(m + n)k
+m +
=
+n +
m+n+b
m+n+b
m+n+b
m+n+a

which is equivalent to the condition that BD = CE. Hence, from the Steiner Lehmus theorem,
BA = CA, or a = b, such that m = n.
3. Let f (x) = x(4x2 3)(64x6 96x4 + 36x2 3) and f (n) (x) = f (f (. . . (x) . . . )). Prove that for all
|
{z
}
n times

positive integers n, f (n) (x) = x has 9n distinct real solutions x.

Solution. Rewrite as f (x) = x(4x2 3)(4(x(4x2 3))2 3). This is clearly g(g(x)) for g(x) = x(4x2 3).
But, this reminds us of the identity g(sin ) = sin (4 sin2 3) = sin 3. Hence, we can deduce that
f (sin ) = sin(3(3)) = sin 9. A simple inductive argument shows that f (n) (sin ) = sin 9n . But from
here, its easy to see that sin 9n = 0 has solutions for 9n distinct values of sin because consider


 n
 n

 
9n
9n

9
+ 1 , . . . , sin n
1 , sin n
{sin n
, sin n
}
9
2
9
2
9
2
9
2
Since the Fundamental Theorem of Algebra states that a polynomial of degree 9n , which f (n) (x) clearly
is, has only 9n solutions in total, these values of sin are our roots, so were done.
4. A function f : {1, 2, 3, . . . , 2014} R satisfies the following relation:
2014
X

f (i)f (j) = 1 for j = 1, 2, 3, . . . , 2014.

i=1,i6=j

(a) Find the period of f .

(b) Find a closed form for f .
Solution (by Ahaan Rungta).
2014
X

j {1, 2, , 2014}

f (i)f (j) = 1,

i=1,i6=j

Let S =

2014
X

f (i). Then, it is easy to note that, for any m {1, 2, , 2014}, we have

i=1

S f (m) =

1
.
f (m)

This is a quadratic, where we can solve for f (m). We get:

2

S f (m) [f (m)] = 1 = [f (m)] S f (m) + 1 = 0,

so
f (m) =

S2 4
.
2

S2 4
S S2 4
, or
. Let there
2
2
be p occasions of the former (plus) and thus 2014 p of the latter. Then,
Thus, for all m, the function f takes on one of two values,

S=

2014
X

f (i)

i=1

=p

S+

s+

s2 + 4
2

!
+ (2014 p)

=
= 1006S
1007 p
=
1006

=
=

If S is positive, note that, since S >

s2 + 4
2

S 2 4 (2014 p) S 2 4

.
2
2

pS
pS
p S2 4
+ 1007S
+
2
2
2
p
p

S2 4
1007 S 2 4 +
2
p
p
2
1007 S 4 + 1007S + p S 2 4
p
(1007 p) S 2 4
S

.
S2 4

pS
(2014 p) S
p
=
+
+
2
2
= S

S 2 4, we have

1007 p
> 1 = p < 1,
1006
so p = 0. If, on the other hand, S is negative, we have
1007 p
S
p 1007
=
> 1 = p > 2013,
=
2
1006
1006
S 4
so p = 2014. In the former case, we get that

S S2 4
f (m) =
,
2
so we can solve for S.

m {1, 2, , 2014},

10062 S 2

2014 f (m)


p
= 1007 S S 2 4
p
= 1007S 1007 S 2 4
p
= 1007S 1007 S 2 4
p
= 1007 S 2 4


= 10072 S 2 4


= 10072 S 2 4


= 10072 S 2 4

10062 S 2

S
S
S
S
1006S
10062 S 2
10062 S 2

10072 S 2 20142
20142
20142
S2 =
=
10072 10062
2013
2014
S =
2013

S
2013
= f (m) =
=
,
2014
2013

for all i.
In the latter case, where p = 2014, we have

S + S2 4
,
f (m) =
2

m {1, 2, , 2014}.

Following a similar approach as before, we obtain

S = 1007S + 1007S

p
S 2 4.

We recall that S is negative, so

1006 |S| = 1007

|S|2 4,

2014
2014
and we get |S| =
, so S =
, implying that
2013
2013

2013
f (m) =
,
m {1, 2, , 2014},
2013
and we are done. Thus, our answers are:
(a) The period of f is 1 , since it is a constant, for all i in the domain.
(b) The closed form of f could take on two values:

f (i) =

2013
.
2013

5. Find all triples of real numbers (x, y, z) such that

(x2 y 2 )2 + (y 2 z 2 )2 + (z 2 x2 )2 = 4xyz(x + y + z) 8xz 2 (x + y)

Solution. Expand out the equation and rewrite as

(x2 y 2 + z 2 )2 + (xy + yz + zx)2 = 0
This is an equality case of (x2 y 2 + z 2 )2 + (xy + yz + zx)2 0, implying that each term is equal
to 0. Hence, x2 + z 2 = y 2 and xy = yz + zx. The former implies the substitution of x = y cos and
z = y sin for some . Plugging this into the latter equation, we get cos = sin + sin cos . This
can be rewritten exclusively in terms of sin to find
0 = sin4 2 sin3 + sin2 + 2 sin 1
4
3
2
Hence, for each real
t that is a root of 0 = t 2t + t + 2t 1, the solution to the equation is
2
(x, y, z) = (ct, c, c 1 t ) for some real c.

6. Let the numbers 1, 6, 7, and 8 be written on a blackboard. Every second, Cody can either
(a) Add any positive real number to any positive real number written on the board.
(b) Replace any two positive real numbers a, b written on the board by two positive real numbers
m, n that satisfies mn = ab, m + n a + b.

Determine whether it is possible for the set of numbers {2, 3, 4, 15} to appear on the blackboard.
P
Solution. Define the coded sum to be, for the set of numbers {a} on the board, i<j ai aj . We assert
that the coded sum is nondecreasing. The first operation clearly increases the coded sum because the
terms simply increase. For the second operation, we assert that the coded sum increases. Without loss
of generality, let a3 and a4 be replaced by r and s. We have that
X

ai aj =

1i<j4

ai aj + a3 a4 + (a3 + a4 )(a1 + a2 ) 2

1i<j2

ai aj + rs + (r + s)(a1 + a2 )

1i<j2

Hence, the coded sum is nondecreasing. But, the coded sum of {1, 6, 7, 8}, 167, is greater than the
coded sum of {2, 3, 4, 15}, 161, which shows that {2, 3, 4, 15} cannot appear on the board.
7. Find all triples (x, y, z) of positive reals such that
(
(x + y + z)(x3 + y 3 + z 3 + xyz) = 2014 + x2 (x2 y 2 ) + y 2 (y 2 z 2 ) + z 2 (z 2 x2 )

2xyz( xy + yz + zx) = 1007

Solution. First consider the set of AM-GM results:

x2 + yz 2x yz

y 2 + zx 2y zx

z 2 + xy 2z xy
Multiplying the pairwise inequalities, we get

(x2 + yz)(y 2 + zx) = x2 y 2 z 4 + z(x3 + y 3 + z 3 ) 4xyz xy

(y 2 + zx)(z 2 + xy) = y 2 z 2 x4 + x(x3 + y 3 + z 3 ) 4xyz yz

(z 2 + xy)(x2 + xy) = z 2 x2 y 4 + y(x3 + y 3 + z 3 ) 4xyz zx

Adding the three, we get

x2 (y 2 x2 ) + y 2 (z 2 y 2 ) + z 2 (x2 z 2 ) + (x + y + z)(x3 + y 3 + z 3 + xyz) 4xyz( xy + yz + zx)

Our system of equations is the equality case to this inequality, which occurs when x2 = yz, y 2 = zx,
and z 2 = xy,or
= z. Plugging
qx = yq
q
 in x = y = z into the first equation, we get that the only triplet
4 1007
4 1007
4 1007
is (x, y, z) =
.
6 ,
6 ,
6

8. Let P (x) =

3x2 +18x+26
x3 +9x2 +24x+18

and define fn (x) by the following recurrence relation:

f0 (x) = x 4 and for n 1, fn (x) = P (fn1 (x) + 1) 4

2f2014 (x)+8
1
Prove that the triplet {a, b, c} = {f2014 (x) + 4, f 2 (x)+8f
,
+ 4} satisfies a + b + c = abc
2014 (x)+17 f2015 (x)
2014
for all real x.

Solution. Observe that

P (x) =

3
x+3

1
(x+3)3
3
(x+3)2

which leads us to the identity P (tan 3) = cot 3 and f0 () = tan 4. An inductive argument can be
used to show that fn () = tan 3n 4 if n is even and fn () = cot 3n 4 if n is odd. Hence, the triplet
reduces to {tan 32014 , tan 2 32014 , tan 3 32014 }. But, by identity, we have tan + tan 2 + tan 3 =
tan tan 2 tan 3. Hence, a + b + c = abc, so were done.