How many ordered pairs of real numbers satisfy the following system of equations? \begin{align} x+3y&=3 \\ \big||x|-|y|\big|&=1 \end{align}
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
On the line x = 3 - 3y the sign of x is fixed by y, so only three sign regions remain, each giving two linear equations.
Solution
From the first equation, . The second equation says or .
Along the line, exactly when , so the signs of and split the line into just three pieces.
Region (so ): . Setting gives or , neither negative. No solutions.
Region (so ): . Setting gives or , both in range. Solutions and .
Region (so ): . Setting gives or ; only is in range. Solution .
Quick check of : and . Three ordered pairs in all.
The answer is .
Why this works
Nested absolute values are handled by peeling one layer at a time, but the case count explodes unless you use the constraint you already have. Substituting the line first ties the sign of to , cutting the four sign quadrants down to three intervals and making every case a one-variable linear equation. Always verify each candidate against the region that produced it.
Alternative approach
Graph : in the first quadrant it is the two rays (from ) and (from ), both heading out along the diagonal direction; reflecting into the other quadrants gives eight rays starting at and . The line through and passes through the ray endpoint , crosses the first-quadrant ray from , and crosses the second-quadrant ray from ; it misses everything below the -axis. Three points.
The trap
Removing the outer absolute value as |x| - |y| = 1 only, missing the branch |y| - |x| = 1 that produces the third solution (0, 1).
Common mistakes
- Removing the outer absolute value as |x| - |y| = 1 only, missing the branch |y| - |x| = 1 that produces the third solution (0, 1).
- Accepting a case solution such as from the region without checking that it lies in that region, which inflates the count to 4 or more.
Techniques
Split into exhaustive cases and handle each