Solve
for each variable, and describe the full solution set.
Count equations against unknowns. There is one equation and two unknowns. A unique numerical answer would need as many independent equations as unknowns, so no single pair can be the answer — instead there are infinitely many, and the task is to describe them.
Solve for . Add to both sides:
This says always exceeds by , whatever happens to be.
Solve for . Starting again, subtract and negate, or simply rearrange :
The two forms are equivalent — substituting one into the other gives ✓, an identity, confirming they carry the same information. Verified across integer pairs ✓.
Generate sample solutions. Choosing freely and computing : ; ; . Each checks out: ✓, ✓, ✓.
Describe the solution set geometrically. Written as , the solutions form a straight line of slope and -intercept . Every point on that line is a solution and every solution lies on it. To pin down a single pair, a second independent equation would be needed — for example adding would give , .
Need to solve a different problem like this? Open the solver →