Linear Equations Formula Sheet
Linear equations sit inside most CAT word problems, and some questions test only whether a system has one, none or many solutions. Learn the consistency conditions and how to list integer solutions of \(ax + by = c\).
Two variables
| Formula | When to use |
|---|---|
| System \(a_1x + b_1y = c_1\), \(a_2x + b_2y = c_2\) has a unique solution if \(a_1b_2 - a_2b_1 \neq 0\), i.e. \(\dfrac{a_1}{a_2} \neq \dfrac{b_1}{b_2}\) | Checking whether two lines intersect at exactly one point. |
| No solution if \(\dfrac{a_1}{a_2} = \dfrac{b_1}{b_2} \neq \dfrac{c_1}{c_2}\) | Parallel lines. Ratios assume non-zero denominators. |
| Infinitely many solutions if \(\dfrac{a_1}{a_2} = \dfrac{b_1}{b_2} = \dfrac{c_1}{c_2}\) | The two equations are the same line. |
| \(x = \dfrac{c_1b_2 - c_2b_1}{a_1b_2 - a_2b_1}\), \(y = \dfrac{a_1c_2 - a_2c_1}{a_1b_2 - a_2b_1}\) | Direct solution (Cramer's rule) when \(a_1b_2 - a_2b_1 \neq 0\). |
| \(a_1x + b_1y = 0\), \(a_2x + b_2y = 0\) has a non-zero solution only if \(a_1b_2 = a_2b_1\) | Homogeneous systems; otherwise \(x = y = 0\) is the only solution. |
Three or more variables
| Formula | When to use |
|---|---|
| \(n\) unknowns need \(n\) independent equations for a unique solution | Deciding quickly whether a system can be solved completely. |
| Three equations have a unique solution if the determinant of coefficients \(a_1(b_2c_3 - b_3c_2) - b_1(a_2c_3 - a_3c_2) + c_1(a_2b_3 - a_3b_2) \neq 0\) | Systems in \(x, y, z\) with coefficients \(a_i, b_i, c_i\). |
| Fewer equations than unknowns: find \(p, q\) so that \(p \times (\text{eq. 1}) + q \times (\text{eq. 2})\) matches the asked expression | "Find \(x + y + z\)" when the individual values cannot be found. |
| \(x + y = a\), \(y + z = b\), \(z + x = c\): \(x + y + z = \dfrac{a + b + c}{2}\), \(x = \dfrac{a - b + c}{2}\) | Symmetric pairwise sums; add all equations first. |
Integer solutions
| Formula | When to use |
|---|---|
| \(ax + by = c\) (integers \(a, b\) not both zero) has integer solutions only if \(\gcd(a, b)\) divides \(c\) | Checking first whether any whole-number answer exists. |
| If \((x_0, y_0)\) is one solution and \(g = \gcd(a, b)\): all solutions are \(x = x_0 + \dfrac{b}{g}t\), \(y = y_0 - \dfrac{a}{g}t\), \(t\) an integer | Listing every solution, then applying limits such as \(x, y > 0\). |
| For \(a, b, c > 0\) and \(\gcd(a, b) = 1\), the number of non-negative solutions of \(ax + by = c\) is \(\left\lfloor \dfrac{c}{ab} \right\rfloor\) or \(\left\lfloor \dfrac{c}{ab} \right\rfloor + 1\) | Quick estimate of the count; confirm by listing. |
| \(x_1 + x_2 + \dots + x_r = n\): non-negative solutions \(= \binom{n + r - 1}{r - 1}\), positive solutions \(= \binom{n - 1}{r - 1}\) | Counting whole-number solutions when all coefficients are 1. |
Shortcuts and traps
- Step size: in \(ax + by = c\) with \(\gcd(a, b) = 1\), consecutive solutions move \(x\) by \(b\) and \(y\) by \(a\) in opposite directions. Find one solution, then step.
- Positive versus non-negative: for positive solutions, put \(x = x' + 1\), \(y = y' + 1\) and count non-negative solutions of \(ax' + by' = c - a - b\).
- Use divisibility: in \(3x + 5y = 47\), \(47 - 5y\) must be a multiple of 3, which fixes \(y\) modulo 3 at once.
- Zero coefficients: the ratio tests fail when a coefficient in the second equation is 0; use \(a_1b_2 - a_2b_1\) instead.