Hi Usernamevisible,Your conclusion is right, and your core insight (g is never less than
1, for
any input) is exactly the property that settles this question. The answer is
C.
There's just one link worth tightening so the justification is airtight rather than intuitive.
Your sentence
"x - 1 is just another input, so g(x - 1) must also be positive" is true - but it's leaning on intuition. The clean way to make it rigorous is to actually
form f(x) by substitution, the same move you'd make for any function:
- g(x) = |x| + 1
- To get g(x - 1), replace every x with
x - 1: g(x - 1) =
|x - 1| + 1- So f(x) =
|x - 1| + 1Now the positivity isn't an appeal to "g is always positive" in the abstract - you can
see it directly: |x - 1| >=
0 for every real x, so f(x) = |x - 1| + 1 >=
1. That's strictly greater than 0, no matter what x is. So
f(x) > 0 must be true.
Why this matters"The input doesn't change the output's sign" is the right instinct, but on the GMAT you want to land it on the actual expression. Once you write f(x) = |x - 1| + 1, every other option falls away cleanly: it's never 0 (min is 1), never a fixed
2 (that needs |x - 1| = 1), and not equal to g(x) in general.
So your answer is correct, and with the substitution written out, your justification is fully sufficient too.
Answer: CUsernamevisible
Bunuel is this right approach -
Since g(x) = |x| + 1,
and |x| ≥ 0 for all x,
g(x) ≥ 1.
Therefore, g(x) is always positive.
-----------------------------------
Since f(x) = g(x - 1),
and x - 1 can be any real number,
f(x) is also always positive.
-----------------------------
Therefore,
f(x) > 0.
Answer: (C)
-----------
Key idea:
x - 1 is just another input. If g is positive for every possible input, then g(x - 1) must also be positive for every possible x. This is sufficient justification for the answer.