Scribd
Upload
91 views

Berkeley Math Circle: Monthly Contest 2 Solutions

This document contains solutions to 7 problems from a math circle contest. The problems cover a range of topics including: finding the last digit of a sum, solving a system of equations, proving a strategy for card guessing will get at least 13 guesses correct, determining functions satisfying a given property, applying inequalities, proving properties of angles in a pentagon, and solving a functional equation involving differentiation.

Uploaded by

hungkg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
91 views

Berkeley Math Circle: Monthly Contest 2 Solutions

This document contains solutions to 7 problems from a math circle contest. The problems cover a range of topics including: finding the last digit of a sum, solving a system of equations, proving a strategy for card guessing will get at least 13 guesses correct, determining functions satisfying a given property, applying inequalities, proving properties of angles in a pentagon, and solving a functional equation involving differentiation.

Uploaded by

hungkg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Berkeley Math Circle: Monthly Contest 2 Solutions

1. Carl computes the number

N = 5555 + 6666 + 7777

and writes it in decimal notation. What is the last digit of N that Carl writes?

Solution. We look at the last digit of each term.


The last digit of 5 is always 5.
The last digit of 6 is always 6.
The last digit of 7 cycles 7, 9, 3, 1, 7, 9, 3, . . . .
So the last digits are 5, 6, 7 in that order. Since 5 + 6 + 7 = 18, the answer is 8.

2. Given that

a + b = 23
b + c = 25
c + a = 30

determine (with proof) the value of abc.

Solution. We add all three equations to obtain

2(a + b + c) = 78

so a + b + c = 39. Therefore,

a = 39 25 = 14
b = 39 30 = 9
c = 39 23 = 16.

Thus abc = 14 9 16 = 2016.

3. In a standard 52 deck of cards, there are 13 cards of each of four suits. Kevin guesses
the suit of the top card, and the top card is revealed and discarded. This process
continues till there are no cards remaining.
If Kevin always guesses the suit of which there are the most remaining (breaking
ties arbitrarily), prove that he will get at least 13 guesses right.

Solution. Imagine that the cards have been given ranks 1, 2, . . . , 13 and moreover
that within each rank the cards have been sorted in ascending order (i.e. Kevin will
encounter 1, 2, . . . , 13 of hearts in that order).
Then, observe that Kevin will always guess the last card of rank r correctly, for any
r = 1, . . . , 13. This completes the proof.

1
4. Find all triples of continuous functions f , g, h from R to R such that f (x + y) =
g(x) + h(y) for all real numbers x and y.

Solution. The answer is f (x) = cx + a + b, g(x) = cx + a, h(x) = cx + b, where a,


b, c are real numbers. Obviously these solutions work, so we wish to show they are
the only ones.
First, put y = 0 to get f (x + 0) = g(x) + h(0), so g(x) = f (x) h(0). Similarly,
h(y) = f (y) g(0). Therefore, the functional equation boils down to f (x + y) =
f (x)+f (y)(g(0)+h(0)). By shifting and appealing to Cauchys functional equation
(with f continuous) we get f (x) = cx + g(0) + h(0), g(x) = cx + g(0) and h(x) =
cx + h(0).

1 1 1
5. Let x, y, z be positive numbers such that x + y + z = 1. Show that

x + yz + y + zx + z + xy xyz + x + y + z.

Solution. Its equivalent to show


s

  X
X 1 1 1 1
x + yz + + x + xyz
cyc
x y z cyc
x

but now were done by Cauchy as


s  p
x + yz

1 1 1 (x + y)(x + z) xyz
x + yz + + = = x+ .
x z z x x x

6. Let ABCDE be a convex pentagon with CD = DE and BCD = DEA = 90 .


AF BF
Point F lies on AB such that AE = BC . Prove that F CE = ADE and F EC =
BDC.

Solution. Let denote the circumcircle of 4CDE and let D1 be the point opposite
to D. Let DA meet at A1 and let F 0 = A1 C AB. If we let = DA1 C =
DD1 C = ED1 D then

AF 0 AF 0 AD1 sin sin D1 DA sin D1 CA F 0B


= = 0
= 0
= .
AE AA1 AD sin A1 F A sin sin CF B BC

Hence F = F 0 . Now F 0 CE = A1 CE = A1 DE = ADE.

7. Find all twice differentiable functions f : R R satisfying

f (x)2 f (y)2 = f (x + y)f (x y)

for all real numbers x and y.

2
Solution. The answer is f (x) = kx, f (x) = a sin(cy), f (x) = a sinh(cy), where
a, c R. The given functional equation is

f (x)2 f (y)2 = f (x + y)f (x y).

Observe that x = y = 0 gives f (0) = 0.


Since f is smooth, we may differentiate with respect to x and obtain

2f 0 (x)f (x) = f 0 (x + y)f (x y) + f (x + y)f 0 (x y).

Now differentiate this with respect to y to obtain

0 = f 00 (x + y)f (x y) f 0 (x + y)f 0 (x y)
 

+ f 0 (x + y)f 0 (x y) f (x + y)f 00 (x y)
 

= f 00 (x + y)f (x y) f (x + y)f 00 (x y)

From this we conclude the key relation: for any real numbers X and Y :

f 00 (X)f (Y ) = f (X)f 00 (Y ).

Assume f isnt identically zero. Then we deduce theres a constant k such that

f 00 (x) = kf (x)

for all x.
This is a standard differential equation with cases on k.
If k = 0, the solution set is f (x) = ax + b. Then f (0) = 0 = b = 0, and we
can check f (x) = ax works.
If k < 0, the solution set is f (x) = a sin(kx) + b cos(kx). Again f (0) =
0 = b = 0, and we can check f (x) = a sin(kx) works.
If k > 0, the solution set is f (x) = a sinh(kx) + b cosh(kx). Again f (0) =
0 = b = 0, and we can check f (x) = a sinh(kx) works.

You might also like