Secondary 4 Additional Mathematics: Some Problems Are Hard Because Several Conditions Must Be True at Once
Multi-constraint problems require intersection thinking. A candidate may satisfy one equation but violate a domain. A parameter may produce real roots but not the required number of roots. A geometric solution may fit one length condition while breaking another. An optimisation result may be stationary yet lie outside the feasible interval.
At Secondary 4, many unfamiliar questions become manageable once the learner stops treating conditions one at a time and instead builds the set of states that satisfy all of them simultaneously.
The feasible answer is the state that survives every condition together.
The Simple Answer
- Constraint: a condition that restricts allowed values.
- Feasible set: all values satisfying every active constraint.
- Condition stacking: applying multiple restrictions in sequence or simultaneously.
- Boundary: a value where the truth of a constraint can change.
- Admissible candidate: a value that survives the entire condition stack.
The central habit is to write the conditions explicitly before solving deeply.
Worked Example 1: Domain Plus Equation
Suppose a problem leads to
(x − 1)(x − 4) = 0
but the original logarithmic expression requires x > 2. Algebra gives x = 1 or x = 4. The domain removes x = 1, leaving x = 4.
The equation generates the candidates; the domain intersects with that candidate set.
Condition Stacking With Parameters
Suppose a quadratic depends on k and the question requires two distinct positive real roots. One condition is Δ > 0. But that alone only guarantees two distinct real roots, not positivity. Additional root information is needed.
Depending on the form of the quadratic, useful conditions may involve the sum and product of roots, the graph location, or direct parameter analysis. The key principle is that “two real roots” and “two positive real roots” are different feasible sets.
Every adjective in the question may add another mathematical gate.
Worked Example 2: Interval Plus Trigonometric Condition
If sin x = 1/2 and 0° < x < 180°, the general trigonometric structure may produce several periodic candidates, but only 30° and 150° lie in the stated open interval.
The interval is not added at the end as a cosmetic check. It is part of the problem definition.
Feasible Intervals in Optimisation
Optimisation frequently combines an objective function with geometric or physical constraints. A stationary point outside the allowed interval is not a feasible optimum.
Suppose a rectangle has perimeter 40 and side x. Then the other side is 20 − x, so the physical constraints are x > 0 and 20 − x > 0. Hence
0 < x < 20.
The area function A = x(20 − x) is meaningful only on that feasible interval. A calculus candidate must be tested against it.
Worked Example 3: Stationary Point Outside the Feasible Set
Imagine an objective function has a stationary point at x = 12, but the original geometry requires 0 < x ≤ 10. The stationary value is mathematically real but infeasible. The optimisation must instead be resolved using admissible boundary or internal candidates as appropriate.
This is why the feasible interval must be written before the derivative is treated as the whole solution.
Inequality Stacking
If two conditions require x ≥ −1 and x < 3, the combined feasible interval is
−1 ≤ x < 3.
Thinking of each condition as a set makes stacking easier: the final answer is the intersection of those sets.
Worked Example 4: Rational Inequality With an Excluded Boundary
Suppose a sign analysis suggests x ≥ 2, but the original expression contains 1/(x − 2). Then x = 2 is excluded because the denominator is zero. The correct feasible condition is x > 2.
Boundary inclusion is therefore controlled by both inequality symbols and domain restrictions.
Geometric Constraints as Algebra
Geometry often hides constraints in words or diagrams. A tangent is perpendicular to a radius. A point on a circle satisfies the circle equation. A midpoint satisfies coordinate averages. A point lying on a line satisfies that line equation.
Multi-constraint geometry becomes easier when each statement is translated into one algebraic condition before simultaneous solving begins.
Worked Example 5: Tangency Requires More Than Passing Through a Point
A line passing through a point on a circle is not automatically tangent. Tangency adds another condition: the line must be perpendicular to the radius at the point of contact. In an algebraic intersection model, it may instead appear as exactly one real intersection.
Passing through the point is one constraint. Tangency is another.
Substitution Creates Inherited Constraints
When u = eˣ, the condition u > 0 is active. When u = sin x, −1 ≤ u ≤ 1. When u = x², u ≥ 0 for real x. Solving the transformed equation without carrying the inherited constraint creates invalid branches.
Write the inherited constraint beside the substitution immediately.
A new variable inherits the mathematical limits of the object it represents.
The Constraint Stack Table
| Source | Typical restriction |
|---|---|
| Logarithm | Argument > 0 |
| Denominator | Denominator ≠ 0 |
| Square root | Radicand ≥ 0 |
| Trigonometric question | Stated angle interval |
| Substitution | Inherited range of substitute |
| Geometry | Lengths positive; configuration conditions |
| Optimisation | Feasible interval |
| Parameter/root condition | Discriminant, sign or multiplicity requirement |
The Feasible-Set Decision Tree
- List every explicit condition.
- Extract hidden domain restrictions.
- Translate verbal behaviour into mathematical conditions.
- Carry inherited substitution constraints.
- Solve for candidate values.
- Intersect the candidate set with every constraint.
- Check endpoints and excluded boundaries carefully.
- Return the surviving values to the original context.
Common Secondary 4 Multi-Constraint Errors
- Satisfying one condition and assuming the problem is finished.
- Using Δ > 0 for two positive roots without checking positivity.
- Forgetting a stated interval after solving a trigonometric equation.
- Using a stationary point outside the feasible domain.
- Including a boundary that makes a denominator zero.
- Ignoring inherited constraints after substitution.
- Treating geometry conditions as visual assumptions instead of algebraic requirements.
- Failing to distinguish open and closed interval endpoints.
A Six-Stage Training Sequence
- Practise combining two simple inequalities into one feasible interval.
- Add domain restrictions from logs, denominators and roots.
- Carry constraints through substitutions.
- Solve parameter problems with more than one root condition.
- Apply feasible-set reasoning to optimisation and geometry.
- Complete mixed questions where the final difficulty is condition stacking rather than algebra.
Checkpoint: Multi-Constraint Control
- What is a feasible set?
- Why is Δ > 0 alone insufficient to guarantee two positive roots?
- If u = sin x, what inherited constraint applies?
- Why must optimisation candidates be checked against the original interval?
- How should several restrictions be combined conceptually?
Checkpoint Answers
- The set of values satisfying all active constraints.
- It guarantees two distinct real roots but does not by itself guarantee that both are positive.
- −1 ≤ u ≤ 1.
- A stationary point outside the feasible interval is not an admissible solution to the model.
- As the intersection of the sets allowed by each condition.
Wintour House V1.0 Learning Standard
Wintour House V1.0 treats each condition as a gate and the final answer as an intersection state. CivDJ reasoning gathers explicit and hidden constraints, translates behaviour into mathematical tests, generates candidates, then passes each candidate through the entire stack before allowing it into the feasible set.
One satisfied condition is evidence. All satisfied conditions create admissibility.
