A and D are non-negative real numbers, B and C are positive real numbers, such that B + C ≥ A + D . Let M = C + D B + A + B C . What is the minimum value of ⌊ 2 0 0 M ⌋ ?
Details and assumptions
⌊ x ⌋ denotes the greatest integer smaller than or equal to x . This is known as the greatest integer function, or GIF.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Very good. :) (Pun indicated)
Log in to reply
I'm sorry, but I can't catch the pun. :(
In the RHS of the fourth step, where does the D in (C+D) come from?
Since the expression for
M
is homogeneous, we may assume WLOG that
A
+
D
=
0
, in which case
A
=
D
=
0
so
M
=
C
B
+
B
C
≥
2
by AM-GM, or
A
+
D
=
1
. Now we examine the partial derivatives
d
B
d
M
=
C
+
D
1
−
(
A
+
B
)
2
C
≥
C
+
D
1
−
(
A
+
B
)
2
C
+
D
=
(
A
+
B
)
2
(
C
+
D
)
(
A
+
B
)
2
−
(
C
+
D
)
2
d
C
d
M
=
A
+
B
1
−
(
C
+
D
)
2
B
≥
A
+
B
1
−
(
C
+
D
)
2
A
+
B
=
(
C
+
D
)
2
(
A
+
B
)
(
C
+
D
)
2
−
(
A
+
B
)
2
Since
A
and
D
cannot both be
0
, at least one of these inequalities must be strict.
Thus, at least one of the partial derivatives must be positive,
so decreasing either
B
or
C
would decrease
M
.
Hence, to minimize
M
let
B
+
C
=
A
+
D
=
1
.
Let
f
(
A
,
B
)
=
M
=
2
−
A
−
B
B
+
A
+
B
1
−
B
=
−
2
+
2
−
A
−
B
2
−
A
+
A
+
B
A
+
1
.
We would like to minimize
f
over the domain
[
0
,
1
]
×
(
0
,
1
)
. Note that
(
0
,
1
)
is an open interval, and switching
A
with
D
while switching
B
with
C
does not change
M
, so we only need to check one of the cases
A
=
1
⟹
D
=
0
or
A
=
0
⟹
D
=
1
. Thus, it suffices to check relative extrema and
A
=
0
. We solve for relative extrema by setting
0
=
d
B
d
M
=
(
2
−
A
−
B
)
2
2
−
A
−
(
A
+
B
)
2
A
+
1
(
A
+
1
)
(
2
−
A
−
B
)
2
=
(
2
−
A
)
(
A
+
B
)
2
(eq. 1)
0
=
d
A
d
M
=
(
2
−
A
−
B
)
2
B
−
(
A
+
B
)
2
1
−
B
(
1
−
B
)
(
2
−
A
−
B
)
2
=
B
(
A
+
B
)
2
(eq. 2)
Dividing eq. 1 and eq. 2, we find
1
−
B
A
+
1
=
B
2
−
A
A
B
+
B
=
2
−
A
−
2
B
+
A
B
A
=
2
−
3
B
Plugging into eq. 1, we have
(
3
−
3
B
)
(
2
B
)
2
=
(
3
B
)
(
2
−
2
B
)
2
1
2
B
2
−
1
2
B
3
=
1
2
B
−
2
4
B
2
+
1
2
B
3
2
4
B
3
−
3
6
B
2
+
1
2
B
=
0
1
2
B
(
2
B
−
1
)
(
B
−
1
)
=
0
and, since
B
∈
(
0
,
1
)
B
=
2
1
whereby
M
=
f
(
A
,
B
)
=
1
.
Now, to check the endpoints of the domain, we plug A = 0 into eq. 1 to obtain
(
2
−
B
)
2
=
2
B
2
4
−
4
B
+
B
2
=
2
B
2
8
=
B
2
+
4
B
+
4
±
2
2
=
B
+
2
and, since
B
∈
(
0
,
1
)
B
=
2
2
−
2
whereby
M
=
f
(
A
,
B
)
=
2
−
2
1
<
1
<
2
. Since we have checked all the cases, this is minimum value of
M
given the constraints in the problem, and the minimum value of
⌊
2
0
0
M
⌋
is thus
1
8
2
.
We define f ( A , B , C , D ) = C + D B + A + B C and let the minimum value of f be m within the conditions in the question.
First, note that if B + C > A + D then B + C − A > D ⇒ f ( A , B , C , B + C − A ) < f ( A , B , C , D ) because only the denominator of the first fraction increases and all the values are non-negative so the value decreases thus f ( A , B , C , D ) cannot be minimum so it must occur when B + C = A + D
Second, note that f ( A , B , C , D ) = f ( k A , k B , k C , k D ) for any non-zero constant k by direct substitution so f ( A , B , C , D ) = m ⇒ f ( A + D A , B + C B , B + C C , A + D D ) = m since we have shown above that for the minimum to occur B + C = A + D thus ∃ ( A ′ , C ′ ) such that f ( A ′ , 1 − C ′ , C ′ , 1 − A ′ ) = m based on the construction we have just found.
We proceed by calculus. Consider the function f ( A ′ , 1 − C ′ , C ′ , 1 − A ′ ) = C ’ + 1 − A 1 − C ’ + 1 − C ’ + A ’ C ’ where 0 ≤ A ’ ≤ 1 and 0 < C ’ < 1 ∂ C ′ ∂ f ( A ′ , 1 − C ′ , C ′ , 1 − A ′ ) = ( C ′ + 1 − A ′ ) 2 A ′ − 2 + ( 1 − C ′ + A ′ ) 2 A ′ + 1 ∂ 2 C ′ ∂ 2 f ( A ′ , 1 − C ′ , C ′ , 1 − A ′ ) = ( C ′ + 1 − A ′ ) 3 2 − A ’ + ( 1 − C ′ + A ′ ) 3 A ′ + 1 First note that as ∣ C ’ − A ’ ∣ → 1 − , f ( A ′ , 1 − C ′ , C ′ , 1 − A ′ ) → + ∞ and in the given range, ∣ A ’ − C ’ ∣ < 1 so f ( A ′ , 1 − C ′ , C ′ , 1 − A ′ ) > 0 and ∂ 2 C ′ ∂ 2 f ( A ′ , 1 − C ′ , C ′ , 1 − A ′ ) > 0
From these we can interpret that there is exactly one local minimum in the range A ’ − 1 < C ’ < A ’ + 1 which occurs when ∂ C ′ ∂ f ( A ′ , 1 − C ′ , C ′ , 1 − A ′ ) = 0 ⇒ ( A ′ − 2 ) ( 1 − C ′ + A ′ ) 2 + ( A ′ + 1 ) ( C ′ + 1 − A ′ ) 2 = 0 ⇒ ( 2 A ′ − 1 ) C ′ 2 − ( 4 A ′ 2 − 2 A ′ − 6 ) + ( 2 A ′ 3 − A ′ 2 − 4 A ′ − 1 ) = 0 Solving this quadratic in C ′ gives us C ′ = 2 A ′ − 1 2 A ′ 2 − A ′ − 3 ± 2 2 + A ′ − A ′ 2 and substituting back into f gives us − 2 1 ± 2 + A ’ − A ’ 2
We have shown that the minimum must be positive so we can reject the negative solution hence we aim to find the minimum value of 2 + A ’ − A ’ 2 − 2 1 = 4 9 − ( A ’ − 2 1 ) 2 − 2 1 which is equivalent to finding the maximum value of ( A ’ − 2 1 ) 2 which in the range given is 4 1 when A ’ = 0 , 1
Substituting back we get m = f ( 0 , 2 2 − 2 , 3 − 2 2 , 1 ) = f ( 1 , 3 − 2 2 , 2 2 − 2 , 0 ) = 2 − 2 1 so the minimum value we need is ⌊ 2 0 0 2 − 1 0 0 ⌋ and since 2 8 2 = 7 9 5 2 4 < 8 0 0 0 0 = 2 0 0 2 < 8 0 0 8 9 = 2 8 3 the answer we require is 2 8 2 − 1 0 0 = 1 8 2
Plug in B=5x, C=x, A=6x, D=0 for all positive real x, we will get the required minimum value, that is 182. Since both A and D only appear in the denominator, A+D must be maximum to obtain the minimum value of M. Therefore, A+D=B+C. Denote A+D=B+C=6x for positive real x. M=B/(C+A)+C/(B+D)=B/(6x+A-B)+(6x-B)/(6x-A+B). Using inequalities and argument by contradiction, we can show that when A=6x and B=5x or A=0 and C=x, M achieves its minimum value and [200M] achieves its minimum value.
Problem Loading...
Note Loading...
Set Loading...
WLOG let A + B ≥ C + D . Then, note that C + D 1 ≥ A + B 1 Now note that A + B + C + D ≤ ( B + C ) + ( B + C ) = 2 ( B + C ) .....(i) We have C + D B + A + B C = C + D B + C − C ( C + D 1 − A + B 1 ) From ( i ) , we obtain: C + D B + C − C × ( C + D 1 − A + B 1 ) ≥ 2 1 × C + D A + B + C + D − ( C + D ) × ( C + D 1 − A + B 1 ) = 2 1 × C + D A + B + A + B C + D − 2 1 = 2 1 × C + D A + B + 2 1 × 2 × A + B C + D − 2 1 From AM-GM inequality, we obtain: 2 1 × C + D A + B + 2 1 × 2 × A + B C + D − 2 1 ≥ 2 × C + D A + B × A + B C + D − 2 1 ⟹ C + D B + A + B C ≥ 2 − 2 1 ⟹ M ≥ 2 − 2 1 Then, note that ⌊ 2 0 0 M ⌋ ≥ ⌊ 2 0 0 2 − 1 0 0 ⌋ = 1 8 2 It can be seen that equality holds for ( A , B , C , D ) = ( 2 + 1 , 2 − 1 , 2 , 0 ) . These values can be found from the equality conditions D = 0 , A + B = C + D ⟹ A + B = C , and C + D A + B = 2 . We thus conclude the minimum value of ⌊ 2 0 0 M ⌋ is 1 8 2 .