If lo g 4 ( x + 2 y ) + lo g 4 ( x − 2 y ) = 1 , and the minimum value of ∣ x ∣ − ∣ y ∣ is k , then find ⌈ k ⌉ .
Notation : ⌈ ⋅ ⌉ denotes the ceiling function .
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.
Nicely done , +1!
I'm going to take a calculus approach with LaGrange Multipliers. Let f ( x , y ) = ∣ x ∣ − ∣ y ∣ and g ( x , y ) = x 2 − 4 y 2 = 4 . Taking g r a d ( f ) = λ ⋅ g r a d ( g ) yields:
∣ x ∣ x = λ ( 2 x ) ;
− ∣ y ∣ y = λ ( − 8 y ) ;
or ∣ x ∣ = 4 ∣ y ∣ . Substituting this value into g ( x , y ) produces 1 6 y 2 − 4 y 2 = 4 ⇒ y 2 = 3 1 ⇒ ∣ y ∣ = 3 1 . So we have the critical ordered-pair ( x , y ) = ( 3 4 , 3 1 ) , which f ( 3 4 , 3 1 ) = 3 and the ceiling of which equals 2.
Problem Loading...
Note Loading...
Set Loading...
Assume WLOG that both x and y are positive ( It doesn't matter since in all of the below equations x 2 , y 2 , ∣ x ∣ , ∣ y ∣ all change the sign to positive. This implies we want to minimize x − y .
Now, this implies l o g 4 ( x + 2 y ) + l o g 4 ( x − 2 y ) = l o g 4 ( ( x + 2 y ) ( x − 2 y ) ) = l o g 4 ( x 2 − 4 y 2 ) = 1
Therefore, x 2 − 4 y 2 = 4 1 = 4
Transposition gives us x 2 = 4 y 2 + 4 , x = 4 y 2 + 4 . But, by the Cauchy-Schwarz Inequality,
( 2 1 2 + 4 3 2 ) ( ( 2 y ) 2 + ( 2 ) 2 ) = ( 4 y 2 + 4 ) ≥ ( y + 3 ) 2 .
Therefore x = 4 y 2 + 4 ≥ ( y + 3 ) 2 = y + 3
So, x ≥ y + 3 , or x − y ≥ 3 . So, our minimum is 3 . Our required answer is then ⌈ 3 ⌉ = 2 ,
Since 1 < 3 < 4 and taking square roots of both sides gives us 1 < 3 < 2 .