Let n be a positive real. If the number of real solutions to n x 2 = n ⌊ x 2 ⌋ + x is 2 0 1 4 , then the range of possible values of n is n ∈ ( a , b ] If b − a = N , then find the value of ⌊ 1 0 0 0 N ⌋
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.
Slightly different graphical explanation than mine, but definitely better organized. I think I shall approve this solution over my own.
We have the equation n x 2 = n ⌊ x 2 ⌋ + x
First, we isolate the x , and try to factor some stuff: n ( x 2 − ⌊ x 2 ⌋ ) = x
Now let's divide by n : x 2 − ⌊ x 2 ⌋ = n x
Thus, we want the number of intersections of the graph f ( x ) = x 2 − ⌊ x 2 ⌋ and the linear graph g ( x ) = n x to be exactly 2 0 1 4 .
Let's try to find out what exactly the graph f ( x ) = x 2 − ⌊ x 2 ⌋ makes. First, we see that if x = a for some non-negative integer a , then f ( x ) = 0 . Furthermore, we see that if x = a − ϵ for some small ϵ > 0 , then we have x 2 ≈ a and ⌊ x 2 ⌋ ≈ a − 1 so f ( x ) ≈ 1 .
Thus, the graph's range is [ 0 , 1 ] . How does that help us? Well, if n x ≥ 1 , then we know that any x equal or greater will not produce any solutions!
Let's see what else we can find out from this graph. First, we see that the growth of the function from x = 0 to x = 1 is the same as x 2 . Then, from x = 1 to x = 2 , the graph is reset to 0 , and then exhibits the same grown as x 2 from x = 1 → 2 . Ditto for x = 2 → 3 and so on. Thus, the graph is increasing for all intervals [ n , n + 1 ) .
Now let's investigate where x will generate a solution.
First off, we see that every time f ( x ) = 0 , it generates one solution. This is because the graph is increasing from f ( x ) = 0 to f ( x ) < 1 . Thus, every time x = a for a non-negative integer a , if n x < 1 at x = a , then there will be a solution.
Thus, we want there to be solutions for x = 0 → 2 0 1 3 . This means n 2 0 1 3 < 1 so n > 2 0 1 3 . Similarly we want n 2 0 1 4 ≥ 1 to ensure there isn't 2 0 1 5 solutions. Solving gives n ≤ 2 0 1 4 .
Thus, n ∈ ( 2 0 1 3 , 2 0 1 4 ] so our answer is ⌊ 1 0 0 0 2 0 1 4 − 1 0 0 0 2 0 1 3 ⌋ = 1 1 .
Here is an interactive graph to help your understanding.
Sorry for the hastily written solution. Hopefully the interactive graph will help a little with your understanding.
what does the epsilon and [ ] represent
Problem Loading...
Note Loading...
Set Loading...
n x 2 = n ⌊ x 2 ⌋ + x ⇒ n ( x 2 − ⌊ x 2 ⌋ ) = x ⇒ n { x 2 } = x
where { ⋅ } represents the fractional part function.
Now substitute x 2 = t , so the equation is now
{ t } = n t
The question can now be solved with some graphical intuition. Clearly, y = x / n represents a parabola. This parabola should intersect the curve y = { x } 2 0 1 4 times as per the question. One point of intersection is origin. For the lower bound of n , the parabola must pass through a point ( 2 0 1 3 + δ , 1 ) where δ → 0 + , the corresponding value of n for this is 2 0 1 3 . The maximum value of n is achieved when the parabola passes through ( 2 0 1 4 , 1 ) . Hence,
n ∈ ( 2 0 1 3 , 2 0 1 4 ]