If is real , prove that the expression is capable of assuming all values provided that are either in ascending or descending orders of magnitude .
I'm lost.......how do I show that is "capable of assuming all values".
Right.
But the function is not one-to-one, nor is the domain the set of all real numbers (x = b is not in the domain).Showing it's one to one will suffice in this case since ( I am assuming)domain=co-domain=real set
Try setting an arbitrary
and see if you can find a real x that satisfies the equation, no matter what y is.
Here are my thoughts on this.
Let us call
Assume that . For the other case you can try it for yourself, it should be very similar. Try sketching the situation I describe below.
When then each of the expressions is negative, so f(x) is negative. As (meaning as x becomes a larger and larger negative number) then (meaning the value of f(x) becomes a larger and larger negative number). Try explaining this for yourself.
At x=a, f(a)=0.
When a < x < b then f(x) is positive, which you can see by looking at whether each factor (x-a), (x-b), (x-c) is positive or negative. As x approaches b from below, the value of f(x) should approach , in other words, f(x) should get larger and larger without bound (vertical asymptote).
This already shows that f(x) assumes all values, so you don't have to look at what goes on elsewhere (i.e. x>b), but if you're interested you can check it out yourself.
Well actually the missing piece is that the function is continuous on its domain, which simply means that there are no "breaks" in the graph.
: )
Boromir it's a corollary of the intermediate value theorem (IVT)
If is continue in with , so .
Take any y , we will show that exist with
,
so for any positive , exists positive with ,
, we can take and with ,
exist with
, , then
exist in a number with by the IVT .
If the interval is with so for all exists
with and . Taking exist , with we use the same argument that we used before in the interval
Must say my friend (mrfour44) gave me the idea with the discriminant. I see it's probably along the lines of what Ackbeet proposed. Just consider this method because it's easier (i.e. more elementary).
So let's say our function is equal to an arbitrary real number, we have to prove that is possible. But by setting it equal to something we make it an equation and just have to show that it has a solution for real x.
So, let , a,b,c are in an ascending or descending order (i.e. or ) and:
Multiply by denominator and then just treat it like a quadratic:
Now, I guess you probably know what the discriminant is. So we have said that this equation holds for some real x. Now we must prove that, and this amounts to proving that the discriminant is greater than or equal to zero. So we have:
Now, use the AG-GM inequality ( ) on (a-c)^2 and R^2:
And combine with the initial inequality:
The rest of it is just checking whether this weaker ineqaulity is true for all the possibilities and those are (obviously it's true for R=0):
1. and
2. and
3. and
4. and
Now I won't go into that. This proof is long anyway. But this part is (considering this whole problem) rather trivial.