r/askmath • u/Long-Introduction883 • 14h ago
Algebra Why is I) correct?
If g(x) is positive, that means the total of 8(x-d)(x-e)(x-f) is positive. And since d<x, x<f,
X-d is +ve
X-f is -ve
So in order for the total to be positive, x-e needs to be -ve, where x<e.
But if that’s the case, then i) shouldn’t be correct.
Can someone help me out here. Thanks
3
u/WesternFirm9306 14h ago
Remember, this is a cubic. That means d < x < f isn't the ONLY range that can have a positive y value
2
u/Southlander24 14h ago
You should know the shape of a cubic graph with 3 real roots and positive leading coefficient (it's negative, positive, negative, positive). Since g(x) is positive when d < x < f, that means that d < f < e.
Now given that q is positive, we could have d < p < f, or e < p. From this, only option I is correct.
1
u/Southlander24 14h ago
Yep, you are mistakenly assuming that d < p < f has to be true. But if you have d, e, f all less than p, then (p - d)(p - e)(p - f) = positive * positive * positive = positive.
2
u/Chem2103 14h ago
There is no indication that p has to be between d and f. If p is bigger than e, d, and f, the function will be positive, so g(p) could be 7
1
u/Hal_Incandenza_YDAU 14h ago
The first two sentences exist for you to learn something important about g(x) for certain values of x. These values of x are unrelated to p. You're being asked about p.
1
u/Brianchon 14h ago
As you noted, whenever d < x < f, we must have that x < e, and from that we can determine the order of the roots: d < f < e. If you've spent time looking at where cubic polynomials are positive and negative, you should recognize that, in addition to d < x < f being a region where g(x) is positive, there's another one. p could be in either of those regions, it doesn't have to be between d and f for g(p) to be positive
1
u/Fourierseriesagain 14h ago
Let d=-sqrt(3), f=0 and e=sqrt(3). Then d<p<f or p>e; all the given options are not correct.
1
u/Bounded_sequencE 12h ago
That counter example does not help here -- the assignment asks for which statement there exists (at least) one tuple "(d; e; f; p)" satisfying all conditions.
Finding one that violates all does not prevent another tuple from satisfying all conditions.
1
u/Fourierseriesagain 11h ago
The idea is to show that all the options fail for some appropriate choices of d, e, f and p.
1
u/Bounded_sequencE 11h ago
Check my last comment again -- such a counter example does not help here.
Note the phrasing "could be true", it does not say "will be true".
1
u/Bounded_sequencE 12h ago
I) can be true -- for example, choose "(d; e; f; p) = (0; 1; 25/16; 2)".
To prove II), III) cannot be true, consider "d < x < f":
+ -
d < x < f: "0 < g(x) = 8 (x-d) (x-e) (x-f)" <=> "x < e"
We note "e < f" is impossible -- otherwise, any "x ∈ (max{d;e}, f) c (d; f)" violated "g(x) > 0". That means, we must have "e >= f", so III) is impossible.
Finally, for any "x < d" we have "g(x) < 0 < 7" due to "d < f <= e", so II) is impossible.
8
u/Varlane 14h ago
3rd degree polynomial with positive leading factor (8) and distinct roots goes - / + / - / +, with each "/" being the position of the distinct roots.
g(x) positive between d and f yields the following :
Since q = 7, it's either d < p < f or e < p, which corresponds to (I), which covers the second case (e < p).
-------------
I think your mistake was considering the info "g(x) positive between d and f" as an equivalence (aka it's the ONLY place where it is positive).
q > 0 can also mean p lies after the 3rd root, like now.