Professional Documents
Culture Documents
Problems and Solutions 2 1
Problems and Solutions 2 1
Problems
29. Proposed by Enkel Hysnelaj, University of Technology, Sydney, Australia.
1) Let f : (0, ∞) → R be a function that satisfies the property
f (x2 ) + f (y 2 )
= f (xy)
2
for any (x, y) ∈ (0, ∞). Show that
f (x3 ) + f (y 3 ) + f (z 3 )
= f (xyz)
3
for any (x, y, z) ∈ (0, ∞).
2) Generalize the above statement, so show that if
f (x21 ) + f (x22 )
= f (x1 x2 )
2
for any (x1 , x2 ) ∈ (0, ∞), then
f (xn1 ) + f (xn2 ) + . . . + f (xnn )
= f (x1 x2 . . . xn )
n
2010
c Mathproblems, Universiteti i Prishtinës, Prishtinë, Kosovë.
48
49
30. Proposed by Neculai Stanciu, George Emil Palade Secondary School, Buzau,
Romania. Evaluate: Z 2012 x
sinn t
lim dt,
x→0 2011 x tm
where n, m ∈ N.
31. Proposed by Valmir Bucaj, Texas Lutheran University, Seguin, TX. If the
vertices of a polygon, in counterclockwise order, are:
1 1 2 1 3 1 4 1
√ ,√ , √ ,√ , √ ,√ , √ ,√ ,...,
a1 an+1 a2 a2n a3 a2n−1 a4 a2n−2
n−1 1 n 1
√ ,√ , √ ,√ ,
an−1 an+3 an an+2
where (an )n≥1 is a decreasing geometric progression, show that the area of this
polygon is
3 1 1
A= √ √ −√
2 a1 a2n an
32. Proposed by Mihály Bencze, Braşov, Romania. Let f : [a, b] → R be a two times
differentiable function such that f 00 and f 0 are continuous. If m = min f 00 (x) and
M = max f 00 (x), then prove that x∈[a,b]
x∈[a,b]
m (b2 − a2 ) M (b2 − a2 )
≤ bf 0 (b) − af 0 (a) − f (b) + f (a) ≤
2 2
34. Proposed by Mihály Bencze, Braşov, Romania. Solve the following equation
r r
q
√
q
√ √
2 + 2 + . . . + 2 + x + 2 − 2 + . . . + 2 + x = x 2,
| {z } | {z }
n-times n-times
where n ≥ 3.
35. Proposed by Florin Stanescu, School Cioculescu Serban, Gaesti, jud. Dambovita,
Romania. Let P (x) = an xn + an−1 xn−1 + ... + a1 x + a0 be a polynomial with
strictly positive real coefficients of degree n ≥ 3, such that P 0 has only real zeros.
If 0 ≤ a < b show that
Rb 1
dx
0
a P 0 (x) 1 P (b) P 0 (b) − P 0 (a)
Rb 1 ≥ ln 0
≥
dx b−a P (a) P (b) − P (a)
a P 00 (x)
50
Solutions
No problem is ever permanently closed. We will be very pleased considering for
publication new solutions or comments on the past problems.
Let
(1 − 3x)(4x2 + 5x − 27)
864 1
f (x) = , and g(x) = x− .
(3 − 2x)2 (2 + x)2 343 3
We observe that g(x) is the tangent to the graph of f (x) at x = 1/3, because
−3 4 1 2 + 5 1 − 27
1 3 3 864
f0 = =
3 1 2 1 2 343
3−2 2+3 3
R1
0
f (x)dx = 0 and m = min f (x), M = max f (x). Let us define F (x) =
0≤x≤1 0≤x≤1
Rx
0
f (y)dy. Prove that
1
−mM
Z
F 2 (x)dx ≤ (3M 2 − 8mM + 3m2 )
0 6(M − m)2
−mM mM m2 M 2 m2 M 2
2
(3M 2 − 8mM + 3m2 ) = − + 2
≥
6(M − m) 2 3(M − m) 3(M − m)2
and
Z bn
F (x) = −(F (bn ) − F (x)) = (−f )(t) dt ≤ −m(bn − x) = m(x − bn )
x
So,
and consequently
Z Z bn
2
F 2 (x) dx ≤ (min(M (x − an ), m(x − bn ))) dx
In an
Z an −m(bn −an )/(M −m) Z bn
2 2
= M (x − an ) dx + m2 (bn − x)2 dx
an bn −M (bn −an )/(M −m)
Z m(an −bn )/(M −m) Z M (bn −an )/(M −m)
= M2 x2 dx + m2 x2 dx
0 0
m2 M 2 m2 M 2
= 2
(bn − an )3 = |In |3
3(M − m) 3(M − m)2
and
Z bn
F (x) = −(F (bn ) − F (x)) = (−f )(t) dt ≥ −M (bn − x)
x
So,
∀ x ∈ In , 0 < −F (x) ≤ min(−m(x − an ), M (bn − x)),
and consequently
Z Z bn
2
F 2 (x) dx ≤ (min(m(an − x), M (bn − x))) dx
In an
Z an +M (bn −an )/(M −m) Z bn
= m2 (x − an )2 dx + M 2 (bn − x)2 dx
an bn +m(bn −an )/(M −m)
Z M (bn −an )/(M −m) Z −m(bn −an )/(M −m)
2 2 2
=m x dx + M x2 dx
0 0
m M2 2
3 m2 M 2
= (bn − an ) = |In |3 ,
3(M − m)2 3(M − m)2
m2 M 2
Z
F 2 (x) dx ≤ |In |3
In 3(M − m)2
53
and consequently
Z 1 XZ m2 M 2 X
F 2 (x) dx = F 2 (x) dx ≤ 2
|In |3
0 In 3(M − m)
n∈N n∈N
!3
m2 M 2 X m2 M 2
≤ |In | = |O|3
3(M − m)2 3(M − m)2
n∈N
2 2
m M
≤ ,
3(M − m)2
3
where we used the well-known inequality n∈N λ3n ≤
P P
n∈N λn . The desired
inequality is, thus, proved. Moreover, the equality case can occur if and only if
O = (0, 1) and f (x) = f0 (x) a.e. or f (x) = f2 (x) a.e., where f0 and f1 are the
functions defined in the statement of the proposition. This completes the proof.
Also solved by the proposer
a+ε n0 b
Let us define A = a−ε and B = (n0 −1)!a . Using Stirling’s formulae, namely
n
√ n0
Thus,
1 bn +k+1 (k + 1) ln A + (n0 + k) ln(n0 + k) − (n0 + k)
ln 0 = + o(1) =
n0 + k + 1 an0 +k+1 n0 + k + 1
= ln A + ln k − 1 + o(1)
and then, using the fact that ex = 1 + o(1) when x → 0), yields
1 bn +k+1 Ak
exp ln 0 = (1 + o(1))
n0 + k + 1 an0 +k+1 e
Subtracting we obtain
1 bn +k+1 1 bn +k
exp ln 0 − exp ln 0 =
n0 + k + 1 an0 +k+1 n0 + k an0 +k
A a+ε 1
= (1 + o(1)) = + o(1)
e a−ε e
(n+1)(zn+1 )1/(n+1)
s
−1 1/(n+1) n
r
bn+1 n bn n(z ) 1/n (n + 1)(z n+1 ) → e−1 ,
n+1
− = (zn )1/n n
ln
an+1 an ln (n+1)(zn+1 )
1/(n+1)
n(zn )1/n
n(zn )1/n
since
1/(n+1)
(n+1)(zn+1 )1/(n+1)
n(zn )1/n
−1 exp ln (n+1)(z n+1 )
n(zn )1/n
−1
lim 1/(n+1)
= lim 1/(n+1)
(n+1)(zn+1 )
n→+∞
ln n(zn )1/n
n→+∞
ln (n+1)(z n+1 )
n(zn )1/n
ex − 1
= lim =1
x→0 x
55
References
[1] W.J. Kaczor, M.T. Nowak Problems in Mathematical Analysis I, Real Numbers, Sequences
and Series , A.M.S., 2000.
Also solved by Albert Stadler, Switzerland; Moubinool Omarjee, Paris,
France; and the proposer.
A C'
F
M C''
E A'
D'
B'
D''
B D C
Figure 1. Problem 25
Solution by the proposer. Tchebychef proved (1850) that there exist constants
a and b such that
x x
a < π(x) < b ,
lnx lnx
for x sufficiently large. Thus
x x
xa lnx < xπ(x) < xb lnx
So ax 1 bx
1
x lnx < xπ(x) < x lnx
Therefore
eax < xπ(x) < ebx ,
which concludes the proof.
MATHCONTEST SECTION
This section of the Journal offers readers an opportunity to solve interesting and ele-
gant mathematical problems mainly appeared in Math Contest around the world
and most appropriate for training Math Olympiads. Proposals are always wel-
comed. The source of the proposals will appear when the solutions be published.
Proposals
21. Let a > −3/4 be a real number. Show that
s r s r
3 a + 1 a + 3 4a + 3 3 a + 1 a + 3 4a + 3
+ + −
2 6 3 2 6 3
is an integer and determine its value.
sin(kβ + α)
22. Let a1 , a2 , a3 , a4 be nonzero real numbers defined by ak = ,
sin kβ
(1 ≤ k ≤ 4), α, β ∈ R. Calculate
1 + a21 + a22 a1 + a2 + 1/a4 1 + a2 (a1 + a3 )
a1 + a2 + 1/a4
2 + 1/a24 a2 + a3 + 1/a4
1 + a2 (a1 + a3 ) a2 + a3 + 1/a4 1 + a22 + a23
23. Let A be a set of positive integers. If the prime divisors of elements in A are
among the prime numbers p1 , p2 , . . . , pn and |A| > 3 · 2n + 1, then show that it
contains one subset of four distinct elements whose product is the fourth power of
an integer.
25. Let a, b, c be the lengths of the sides of a triangle ABC with inradius r and
cicumradius R. Prove that
s
r 3 a b c 1
≤ ≤
2r + R b + c + 2a c + a + 2b a + b + 2c 4
60
Solutions
16. A number of three digits is written as xyz in base 7 and as zxy in base 9. Find
the number in base 10.
(III Spanish Math Olympiad (1965-1966))
17. A regular convex polygon of L + M + N sides must be colored using three colors:
red, yellow and blue, in such a way that L sides must be red, M yellow and N blue.
Give the necessary and sufficient conditions, using inequalities, to obtain a colored
polygon with no two consecutive sides of the same color.
(XI Spanish Math Olympiad (1973-1974))
(IMAC 2011)
C
N
A P B
Figure 2. Problem 18
Also solved by Omran Kouba, Higher Institute for Applied Sciences and
Technology, Damascus, Syria; and José Gibergans Báguena, BARCE-
LONA TECH, Barcelona, Spain.
19. Place n points on a circle and draw in all possible chord joining these points.
If no three chord are concurrent, find (with proof ) the number of disjoint regions
created.
(IMAC-2011)
RK+1 = RK + S + 1 = (K + P + 1) + S + 1 = (K + 1) + (P + S) + 1,
where P +S is the total number of intersection points inside R. Therefore, A(K +1)
holds and by the PMI the claim is proven.
Finally, since the circle is convex and any intersection
point is determined by a
n n
unique 4−tuple of points, then there are P = intersection points and L =
4
2
n n
chords and the number of regions is R = + + 1.
4 2
2
But
n
X n
X n
X
((k − 1)(n − k) + 1) = − k 2 + (n + 1) k + (1 − n)n
k=1 k=1 k=1
n(n + 1)(2n + 1) n(n + 1)2
= − + − n(n − 1)
6 2
n+2 n
= −2
3 2
So,
n−1
X n−1
X k
k+2
an = 1+ −2
3 2
k=1 k=1
n−1 n−1
X k + 1 k
X k+3 k+2
= 1+ − −2 −
4 4 3 3
k=1 k=1
n+2 n n n
= 1+ −2 = + +1
4 3 4 2
a+b+c f (a) + f (b) + f (c)
Applying Jensen’s inequality, we have f ≤ or equiva-
3 3
lently,
" 1/a 1/b 1/c #
3 3 + (a + b + c) 1 1+a 1+b 1+c
ln ≤ ln + ln + ln
a+b+c 3 − (a + b + c) 3 1−a 1−b 1−c
Taking into account that a + b + c = 1 and the properties of logarithms, we get
s
1/a 1/b 1/c
3 1+a 1+b 1+c
≥8 (5)
1−a 1−b 1−c
1 1 1
WLOG we can assume that a ≥ b ≥ c. We have, ≤ ≤ and g(a) ≥ g(b) ≥
a b c
1+x
g(c), where g is the increasing function defined by g(x) = ln . Applying
1−x
rearrangement’s inequality, we get
1 1 1 1 1 1
g(a) + g(b) + g(c) ≥ g(a) + g(b) + g(c)
b c a a b c
or
1/b 1/c 1/a 1/a 1/b 1/c
1+a 1+b 1+c 1+a 1+b 1+c
≥
1−a 1−b 1−c 1−a 1−b 1−c
From the preceding and (5) we obtain
s s
1/b 1/c 1/a 1/b 1/c 1/a
3 1+a 1+b 1+c 3 1+a 1+b 1+c
=
b+c c+a a+b 1−a 1−b 1−c
s
1/a 1/b 1/c
3 1+a 1+b 1+c
≥ ≥8
1−a 1−b 1−c
Likiwise, applying rearrangement’s inequality again, we get
1 1 1 1 1 1
g(a) + g(b) + g(c) ≥ g(a) + g(b) + g(c)
c a b a b c
and
s s
1/c 1/a 1/b 1/c 1/a 1/b
3 1+a 1+b 1+c 3 1+a 1+b 1+c
=
b+c c+a a+b 1−a 1−b 1−c
s
1/a 1/b 1/c
3 1+a 1+b 1+c
≥ ≥8
1−a 1−b 1−c
Multiplying up the preceding inequalities yields,
s
1+1 1+1 1+1
3 1+a b c 1+b c a 1+c a b
≥ 64
b+c c+a a+b
from which the statement follows. Equality holds when a = b = c = 1/3, and we
are done. 2
MATHNOTES SECTION
1. Introduction
In [1] the following problem was posed: Let a, b, c be positive real numbers such that
a + b + c = 1. Prove that
a b c 3
(ab + bc + ca) 2 + + ≥ (6)
b + b c2 + c a2 + a 4
A solution to the preceding proposal and some related results appeared in [2]. Our
aim in this short paper is to generalize it and to give some of its applications.
2. Main Results
In the sequel some generalizations and refinements of (6) are given. We begin with
Theroem 1. Let x and ak , bk , (1 ≤ k ≤ n) be positive real numbers. Then
n
! n ! n
!2
X X ak X ak
ak ≥
(x + bk )2 x + bk
k=1 k=1 k=1
n
!4 , n !2
X X
≥ ak ak (x + bk )
k=1 k=1
√ √ √ √ √ √
a1 a2 an
Proof. Setting ~u = x+b1 , x+b2 , . . . , x+bn and ~v = a1 , a2 , . . . , an into CBS
inequality, we have
n
!2 n √ !2 n
! n
!
X ak X ak √ X X ak
= ak ≤ ak
x + bk x + bk (x + bk )2
k=1 k=1 k=1 k=1
and
the
q LHS inequality
q isqproven. To proveRHS inequality we set
a1 a2 an
p p p
~u = x+b1 , x+b2 , . . . , x+bn and ~ v= a1 (x + b1 ), a2 (x + b2 ), . . . , an (x + bn )
into CBS inequality again and we get
n
!2 n
! n !
X X ak X
ak ≤ ak (x + bk )
x + bk
k=1 k=1 k=1
from which the statement immediately follows.
A constrained inequality that can be derived immediately from the preceding result
is given in the following
66
Pn
Corllary 1. Let ak , bk , (1 ≤ k ≤ n) be positive real numbers such that k=1 ak = 1.
Then holds:
n
! n n
!2
X X ak
X ak
ak (1 + bk )2 + ≥2
(1 + bk )2 1 + bk
k=1 k=1 k=1
n
!4 ," n n
! n n
!#
X X X X X
≥ ak y ak + ak bk z ak + ak bk
k=1 k=1 k=1 k=1 k=1
After a little straightforward algebra the statement follows and the proof is com-
plete.
Corllary 2. Let y < z and ak , bk , (1 ≤ k ≤ n) be strictly positive real numbers.
Then exists c ∈ (y, z) such that
n
! n ! n
!2
X X ak X ak
ak ≥
(y + bk )(z + bk ) c + bk
k=1 k=1 k=1
n
!4 ," n n
! n n
!#
X X X X X
≥ ak y ak + ak bk z ak + ak bk
k=1 k=1 k=1 k=1 k=1
67
1
≥
X X
a1 a2 1 + a1 a2
cyclic cyclic
Proof. Taking into account that for all a, b, c positive numbers with sum one is
ab + bc + ca ≤ 13 (a + b + c)2 ≤ 13 and corollary 4, we get
a b c a2 b2 c2
+ + ≥ + +
b(1 + b) c(1 + c) a(1 + a) b(1 + b) c(1 + c) a(1 + a)
2bc
a−c 2ca 2ab !
a(1 + c) b(1 + a) b−a c(1 + b) c−b
+ log
c(1 + a) a(1 + b) b(1 + c)
68
1 9
≥ ≥
(ab + bc + ca)(1 + ab + bc + ca) 4
Finally, combining the inequality posed in [1] by Dospinescu and the inequality
presented in [2] by Janous, namely
x y z 3
(xy + yz + zx) + + ≤ (x + y + z = 1),
1 + y2 1 + z2 1 + x2 4
two applications are given.
Problem 1. Let a, b, c be positive real numbers. Prove that
X a 3(a + b + c) X a
≥ ≥
b(a + 2b + c) 4(ab + bc + ca) b + (a + b + c)2
2
cyclic cyclic
a b c
Solution. Putting x = a+b+c , y = and x = a+b+c
a+b+c into
X X x 3
≥ ≥
X X x
xy xy
y(1 + y) 4 1 + y2
cyclic cyclic cyclic cyclic
ACKNOWLEDGEMENTS
The authors would thank to the Ministry of Education of Spain that has partially
supported this research by grant MTM2009-13272.
References
[1] G. Dospinescu, Problem 3062, CRUX, Vol. 31, No. 5 (2005) 335, 337.
[2] J. L. Dı́az-Barrero and G. Dospinescu, Solutions: Problem 3062, CRUX, Vol. 32, No. 6 (2006)
403-404.
[3] M. Bencze. Inequalities (manuscript), Brasov, 1982.