Modelling a Constraint on Two Quantities

When a problem says a total is exactly some fixed number, that total can be split up in many different ways. Say a mix must weigh exactly 240 grams. You could get there with a lot of light beads and few heavy ones, or few light beads and a lot of heavy ones. Each of those combinations is a valid answer, so the sentence describes a relationship between two unknowns, not a single pair of numbers. That relationship is a line: pick any x, and the equation forces the matching y.

The equation Ax + By = C encodes this directly. Each term is a per-unit amount times a count of units: A is the price or weight of one unit of the first thing, x is how many of that thing you have, and Ax is the total contribution from that thing. Same for By. Add the two contributions and they must equal the fixed total C. Once you see each term as rate times count, you can build the equation straight from the sentence without memorizing a template, and you can solve for whichever count the question asks about by isolating it.

This is the setup step that feeds directly into systems of equations: one constraint alone has infinitely many solutions, but pair it with a second constraint, like a total cost on top of a total weight, and the two lines intersect at one specific point. That is why this skill sits right before solving systems on the test: you build one equation here, then build a second one the same way, and solve them together.