The function g(x) is defined for integers x such that if x is even, g(x) = x/2 and if x is odd, g(x) = x + 5. Given that g(g(g(g(g(x))))) = 19, how many possible values for x would satisfy this equation?
One of the great things about almost all GMAT math questions is that they can be solved using at least 2 different approaches. Typically, one approach is much faster than the other(s). In my opinion, this question is too far too time-consuming to be a legitimate GMAT question.[email protected] wrote:The function g(x) is defined for integers x such that if x is even, g(x) = x/2 and if x is odd, g(x) = x + 5. Given that g(g(g(g(g(x))))) = 19, how many possible values for x would satisfy this equation?
Also, this question basically has one approach, and that approach involves "brute force," which requires far too much time. To see what I mean, check out these solutions:
- https://www.beatthegmat.com/functions-t102958.html
- https://www.beatthegmat.com/killer-probl ... 75629.html
Personally, I think this question is akin to asking test-takers to find the sum of all prime numbers from 2 to 401. Sure, we can find the sum using brute force, but there's no nice (fast) way to do it.
Cheers,
Brent














