a and b are real numbers such that a 2 + b 2 = 1 , and always satisfy
1 + a 2 1 + 1 + b 2 1 + 1 + a b 1 ≥ 1 + z ( a + b ) 2 x .
Find ⌊ z x ⌋ when the value of the LHS of the above inequality is the least.
Details and Assumptions:
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.
I can't get an integer x , here's my solution:
1 + a 2 1 + 1 + b 2 1 + 1 + a b 1
≥ 1 + a 2 + 1 + b 2 + 1 + a b 9
≥ 4 + a b 9
≥ 8 + 2 a b 1 8
≥ 7 + ( a + b ) 2 1 8
≥ 1 + 7 ( a + b ) 2 7 1 8
Where did it went wrong?
Log in to reply
I got the same thing too..... What am I doing wrong?
I did the same too ............
x = 18/7, z = 7 flr((18/7)/7) = flr(18/49) = 0 I see nothing wrong...
Log in to reply
But @megh choksi if You Multiply numerator and Denominator in RHS by say 3 Then the Answer would be 4 9 .
And if you multiply by 5 then answer will be 4 1 5 .
So You Should Have To clerify that what is really x,y,z are ?? I mean weather they are co-prime or what are their gcd or something else ??
Comment on Christopher boo's solution..
by greatest integer function, do you mean floor function?? @megh choksi
Log in to reply
Yes , when for negative values it gives for example [-x] it will give -(x + 1) and for positive values for example [x] it will give ( x -1)
could someone pls post a more complete solution ?? @megh choksi @Calvin Lin @DEEPANSHU GUPTA @Michael Mendrin @Sharky Kesa @Finn Hulse
Actually this question is taken from RMO 2013 (Maharashtra and Goa region).
Log in to reply
this question was actually given to me by my friend
Log in to reply
Do RMO paper checkers accept titu's lemma or we have to write Cauchy schwarz's angel form?? or something else we have to prove . please answer.
Could you comment on Christopher boo's solution ?
wow the integer condition threw me off :/
Using Titu's Lemma,
1 + a 2 1 + 1 + b 2 1 + 1 + a b 1 = 1 + a 2 1 2 + 1 + b 2 1 2 + 2 + 2 a b 2 2 ≤ 4 + ( a + b ) 2 ( 2 + 2 ) 2 = 1 + 4 ( a + b ) 2 4 ( 2 + 2 ) 2
So, x ≥ 4 ( 2 + 2 ) 2 and z = 4 . We can take x = 3 . Substituting this into the required expression yields 0 .
I think the sign of the inequality should be reverse - check the second step.
The problem did not say equality needs to be achieved. So x can be arbitrarily small and the inequality will hold. Let x=1 and z be large number.
First note that by AM-GM a b ≤ 2 1 and because a 2 + b 2 = 1 we have a b = 2 1 only when a = b = ( 2 ) 1 . Using Titu's Lemma we can conclude that the LHS is ≥ 4 + a b 9 ≥ 2 and so the minimum of the LHS is 2 and it is archived when a = b = ( 2 ) 1 . Now 1 + z ( a + b ) 2 x = z + 1 + 2 a b x z and it is equal to the minimum when a b = 2 1 and when z + 2 x z = 2 , i.e. when x z = 2 z + 4 . Remembering that x and z are positive integers we have that the solutions are ( 3 , 4 ) , ( 4 , 2 ) , ( 6 , 1 ) , but the only acceptable solution (for which the inequality hold for all a b , see below) is when z = 4 and x = 3 and so ⌊ z x ⌋ = ⌊ 4 3 ⌋ = 0 .
The inequality 1 + a 2 1 + 1 + b 2 1 + 1 + a b 1 ≥ 1 + 4 ( a + b ) 2 3 is oblivious: rearranging we can arrive at the following inequality ( 2 a b − 1 ) ( 5 ( a b ) 2 + 3 ( a b ) + 1 ) ≤ 0 which is true when a b ≤ 2 1 as in our case.
The other inequalities do not hold for all 0 < a b ≤ 2 1
Problem Loading...
Note Loading...
Set Loading...
Well This Can Be easily solved By using Cauchy inequality in Titu's Lemma form. Click Here