⌊ x + 2 1 ⌋ ⌈ x ⌉ ⌊ x − 2 1 ⌋ ≥ ⌈ x + 2 1 ⌉ ⌊ x ⌋ ⌈ x − 2 1 ⌉ Given that 1 ≤ x ≤ 1 0 0 0 is a real number, find the number of different x 's that satisfy the above inequality.
If you believe there are an infinite number of x 's that satisfy the inequality, then submit − 1 .
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.
Recognizing that these functions only change their values at integers and half-integers allows us to figure out the above cases.
Great Solution.
It will be proven that the above inequality will be satisfied if and only if x is in the form of 2 k for every 2 k ∈ ( 0 , 1 0 0 0 ) .
To prove the above statement, we will divide the prove into 3 cases.
(i) x = m + b a where m is a positive integer and b a ∈ ( 2 1 , 1 ) .
It is obvious that ⌊ x + 2 1 ⌋ = ( m + 1 ) and ⌊ x ⌋ = ⌊ x − 2 1 ⌋ = m .
It is also obvious that ⌈ x ⌉ = ⌈ x − 2 1 ⌉ = ( m + 1 ) and ⌈ x + 2 1 ⌉ = ( m + 2 ) .
Therefore there is no x ∈ R that satisfies the above inequality with the above property.
(ii) x = m + b a where m is a positive integer and b a ∈ [ 0 , 2 1 ) .
It is obvious that ⌊ x − 2 1 ⌋ = ( m − 1 ) and ⌊ x ⌋ = ⌊ x + 2 1 ⌋ = m .
It is also obvious that ⌈ x ⌉ = ⌈ x + 2 1 ⌉ = ( m + 1 ) and ⌈ x − 2 1 ⌉ = m .
Therefore there is no x ∈ R that satisfies the above inequality that satisfies the above property.
(iii) x = 2 k with k an odd positive integer.
It is obvious that ⌊ x + 2 1 ⌋ = ⌈ x + 2 1 ⌉ and ⌊ x − 2 1 ⌋ = ⌈ x − 2 1 ⌉ .
It is also obvious that ⌈ x ⌉ ≥ ⌊ x ⌋ for every real number x .
Therefore every x in the form above satisfies the inequality. It implies that there is exactly 999 real number x in the range that satisfies the inequality.
Problem Loading...
Note Loading...
Set Loading...
Let f ( x ) = ⌊ x + 2 1 ⌋ ⌈ x ⌉ ⌊ x − 2 1 ⌋ , g ( x ) = ⌈ x + 2 1 ⌉ ⌊ x ⌋ ⌈ x − 2 1 ⌉ and x = ⌊ x ⌋ + { x } = n + δ , where ⌊ x ⌋ = n and { x } = δ are the integral and fractional parts of x respectively; n and δ are positive for x ∈ [ 1 , 1 0 0 0 ] .
There are four cases of f ( x ) and corresponding g ( x ) as follows:
⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ δ = 0 0 < δ < 2 1 δ = 2 1 2 1 < δ < 1 ⇒ { f ( x ) = ( n ) ( n ) ( n − 1 ) g ( x ) = ( n + 1 ) ( n ) ( n ) ⇒ { f ( x ) = ( n ) ( n + 1 ) ( n − 1 ) g ( x ) = ( n + 1 ) ( n ) ( n ) ⇒ { f ( x ) = ( n + 1 ) ( n + 1 ) ( n ) g ( x ) = ( n + 1 ) ( n ) ( n ) ⇒ { f ( x ) = ( n + 1 ) ( n + 1 ) ( n ) g ( x ) = ( n + 2 ) ( n ) ( n + 1 ) ⇒ f ( x ) < g ( x ) ⇒ f ( x ) < g ( x ) ⇒ f ( x ) > g ( x ) ⇒ f ( x ) < g ( x )
Therefore, for each n ∈ [ 1 , 1 0 0 0 ) , there is a case that f ( x ) > g ( x ) or 9 9 9 x 's that satisfy the inequality.