There will be two cases:
When p = +ve:
Then we see that p-|p| = 3.
But since we took p as positive we get:
p-p = 0 which is not possible as RHS = 3.
So positive values are ruled out.
Taking negative values:
p-|p| = -3.
p-(-p) = -3.
2p = -3.
p = -3/2.
And as we see this is the only solution possible.
Answer: Option B
_____________________________________
IMO absolute value questions are a toss up between doing trial and error or solving it methodically.
In a time crunch situation for such a question you might miss the only case possible, in which case methodical work is the best.
If there is only 1 mod then it is easier to visualise and thus better to do trial and error to get to the answer in time crunch situations.
But questions pertaining to number of solutions required would almost always need a proper approach IMO, so better to go with it.
Bunuel
If \(|p – |p|| = 3\), how many values of \(p\) satisfy this equation?
A. 0
B. 1
C. 2
D. 3
E. 4