Small Group Tutorials

Here to help students catch up, keep up, and move ahead. Book a consultation here.

How to Perform in the new G2 SEC Examinations | Learner’s Guide Vol 0174 | Mathematics: Sandwich Bounds — Trap the Answer Between a Lower and Upper Limit Before You Trust It

G2 Mathematics K210 answers can often be checked—or partly solved—without exact calculation by trapping an unknown between a lower bound and an upper bound. This sandwich reasoning turns several weak clues into a strong interval: the answer must be above one limit and below another.

This one-hundred-and-seventy-fourth Learner’s Guide develops sandwich bounds. It extends bounding and benchmark work by focusing on the interaction of two sides: how independent lower and upper constraints narrow the candidate set until an answer becomes plausible, impossible or sometimes uniquely determined.

Mechanism: two inequalities shrink the candidate interval

A lower bound removes values that are too small; an upper bound removes values that are too large. Together they create an interval. Every new valid constraint can tighten that interval. Exact calculation should land inside it.

Diagnosis

When an exact answer looks suspicious, identify one lower bound and one upper bound from different structural facts if possible. If the exact value violates either, locate the operation, unit, denominator or model step capable of crossing that bound.

Smallest repair

Repair the first step that breaks the interval and recalculate only descendants. If the bounds themselves conflict, diagnose their assumptions before touching the exact calculation.

1. Between consecutive integers

Bound: If n<x<n+1, the value is trapped between integer anchors.

Control: Use for roots, estimates and feasibility.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

2. Between fractions

Bound: Compare with nearby simple fractions such as 1/2 or 3/4.

Control: Useful before decimal conversion.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

3. Between percentages

Bound: Trap an unknown share between known percentage benchmarks.

Control: Check denominator consistency.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

4. Square-root bounds

Bound: If a²<N<b² for positive a,b, then a<√N<b.

Control: Use nearby perfect squares.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

5. Cube-root bounds

Bound: Use nearby perfect cubes to trap positive cube roots.

Control: Check sign for negative inputs where relevant.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

6. Mean bounds

Bound: An ordinary mean of data with positive weights lies between minimum and maximum.

Control: A mean outside range signals error.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

7. Weighted mean bounds

Bound: Positive-weight weighted mean lies between min and max component values.

Control: Weights must be nonnegative and meaningful.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

8. Probability bounds

Bound: 0≤P≤1.

Control: Any candidate outside is impossible.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

9. Percentage share bounds

Bound: A part-of-whole percentage lies from 0% to 100% when part is within whole.

Control: Percentage change is a different quantity and can exceed 100%.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

10. Angle triangle bounds

Bound: Each interior angle of a non-degenerate triangle lies between 0° and 180°.

Control: Use alongside total 180°.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

11. Length triangle inequality

Bound: One side is less than sum of other two and greater than their positive difference.

Control: Reject impossible lengths.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

12. Hypotenuse bounds

Bound: In a right triangle, hypotenuse exceeds each leg and is below their sum.

Control: Quick check before exact Pythagoras.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

13. Area positivity

Bound: Ordinary area cannot be negative.

Control: A negative algebraic result indicates sign/model issue.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

14. Volume positivity

Bound: Physical volume is nonnegative.

Control: Check domain.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

15. Distance positivity

Bound: Distance is nonnegative even when displacement can be signed.

Control: Quantity type matters.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

16. Speed positivity

Bound: Speed is nonnegative while velocity-like direction may be signed in contexts that use it.

Control: Do not transfer sign rules blindly.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

17. Count bounds

Bound: Counts are nonnegative integers and cannot exceed total population.

Control: Use before probability/data answers.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

18. Frequency bounds

Bound: Category frequency lies between zero and total count.

Control: Check table consistency.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

19. Relative frequency bounds

Bound: Between 0 and 1.

Control: Category totals sum to 1 for exhaustive disjoint categories.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

20. Capacity bounds

Bound: Used amount lies from zero to capacity.

Control: Over-capacity may signal infeasibility unless overflow is allowed.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

21. Occupancy bounds

Bound: Occupancy percentage usually lies 0–100% for a fixed capacity.

Control: Define capacity.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

22. Discounted price bounds

Bound: For a discount between 0% and 100%, sale price lies from zero to original price.

Control: Check no extra fees.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

23. Positive markup

Bound: With positive markup, selling price exceeds cost.

Control: Context may include losses/discounts separately.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

24. Simple percentage increase

Bound: For positive original and positive increase, final exceeds original.

Control: Direction bound.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

25. Simple percentage decrease under 100%

Bound: Final remains between zero and original.

Control: Use multiplier bounds.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

26. Direct proportion positive domain

Bound: If k>0 and x increases positively, y increases.

Control: Use monotonic bounds.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

27. Inverse proportion positive domain

Bound: If k>0, larger positive x gives smaller positive y.

Control: Ordering traps candidate values.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

28. Linear interpolation

Bound: For a monotonic straight segment, interpolated y lies between endpoint y-values.

Control: Only inside interval.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

29. Monotonic function interval

Bound: If known increasing, output at middle input lies between endpoint outputs.

Control: No exact formula needed.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

30. Decreasing relation interval

Bound: Reverse endpoint order but still trap middle output.

Control: Check monotonicity assumption.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

31. Rounding interval

Bound: A rounded value corresponds to a lower and upper bound determined by place value.

Control: Use to bound derived quantities.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

32. Measurement bounds

Bound: Recorded precision defines plausible true interval.

Control: Propagate carefully.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

33. Upper-bound product positive

Bound: For positive factors, upper×upper gives an upper candidate.

Control: Need sign/domain awareness.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

34. Lower-bound product positive

Bound: Lower×lower gives lower candidate.

Control: Again positive domain.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

35. Quotient bounds positive

Bound: Lower numerator/upper denominator gives lower quotient; upper numerator/lower denominator gives upper.

Control: Denominator must stay positive/nonzero.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

36. Ratio bounds

Bound: Bound numerator and denominator with sign control.

Control: Do not apply positive rules across zero.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

37. Rate bounds

Bound: Distance/time bounds can trap speed.

Control: Use compatible intervals.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

38. Density bounds

Bound: Mass/volume bounds can trap density.

Control: Volume lower bound must be positive.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

39. Unit-price bounds

Bound: Total cost/quantity bounds trap per-unit cost.

Control: Quantity must be positive.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

40. Normalised-rate bounds

Bound: Raw total and base bounds constrain normalised result.

Control: Keep base ownership.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

41. Graph-read bounds

Bound: A point read between grid lines can be bounded before estimating.

Control: Avoid false precision.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

42. Gradient bounds

Bound: Changes in y and x intervals can constrain slope.

Control: Sign matters.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

43. Sequence bounds

Bound: If arithmetic sequence increasing, intermediate terms lie between surrounding terms.

Control: Use position ordering.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

44. Geometric positive ratio >1

Bound: Terms increase and can be bounded by neighbours.

Control: Check ratio condition.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

45. Geometric ratio between 0 and1

Bound: Terms decrease in positive sequence.

Control: Direction reverses.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

46. Budget residual bounds

Bound: Remaining budget lies between zero and total if spending is feasible.

Control: Negative residual signals overspend.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

47. Time allocation bounds

Bound: Part time cannot exceed total duration.

Control: Use to catch unit or segment errors.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

48. Journey distance bounds

Bound: Segment distance lies between zero and total route distance if segments partition route.

Control: Ownership matters.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

49. Mixture concentration bounds

Bound: A simple mixture concentration with positive amounts lies between component concentrations.

Control: No reaction/other process assumed.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

50. Combined average bounds

Bound: Combined mean lies between group means with positive group sizes.

Control: Useful data check.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

51. Probability union simple bounds

Bound: P(A∪B) is at least max(PA,PB) and at most min(1,PA+PB).

Control: School-level sanity check where appropriate.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

52. Intersection simple bounds

Bound: P(A∩B) cannot exceed either event probability.

Control: Use without assuming independence.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

53. Complement bounds

Bound: If P(A) near 1, complement near 0 and vice versa.

Control: Exact sum 1.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

54. Root bracket by sign change caution

Bound: Opposite signs at endpoints can suggest a root for continuous models, but continuity may not be in G2 scope.

Control: Use only when problem context/model supports.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

55. Integer feasibility

Bound: If real solution lies between 4.2 and 4.8 and count must be integer, there may be no feasible integer.

Control: Do not round automatically.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

56. Minimum integer

Bound: If requirement is at least x, smallest feasible integer is ceiling-like.

Control: Check inclusivity.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

57. Maximum integer

Bound: If requirement is at most x, largest feasible integer is floor-like.

Control: Check inclusivity.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

58. Parameter bounds

Bound: Known physical/context constraints can bound recovered constants.

Control: Reject parameter values outside domain.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

59. Residual bounds

Bound: If input uncertainty is small, residual should be judged relative to expected tolerance.

Control: Zero is ideal only for exact model/data.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

60. Benchmark plus bound

Bound: A benchmark can provide one side and a hard constraint the other.

Control: Combine independent information.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

61. Two independent bounds

Bound: When lower and upper checks come from different reasoning routes, confidence improves.

Control: Avoid correlated checks.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

62. Tightening lower bound

Bound: New evidence raises the minimum plausible value.

Control: Never lower a lower bound without new reason.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

63. Tightening upper bound

Bound: New evidence lowers the maximum plausible value.

Control: Track candidate interval.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

64. Bounds cross

Bound: If lower bound exceeds upper bound, assumptions/data are inconsistent.

Control: Diagnose before solving further.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

65. Bounds meet

Bound: If lower=upper, the value is determined exactly.

Control: No further numerical solving needed.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

66. Wide interval

Bound: Bounds are valid but not yet useful enough.

Control: Seek a discriminating constraint.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

67. Narrow interval

Bound: A tight interval can eliminate MCQ options or determine integer answer.

Control: Use information efficiently.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

68. Sandwich final rule

Bound: Trap the unknown between independently justified lower and upper limits before trusting exact calculation.

Control: If the exact answer escapes the sandwich, repair the reasoning.

For practice, state the lower and upper limits before exact calculation. Then solve and compare. If the result lies inside the interval, explain why this supports but does not prove correctness.

For transfer, change the numbers while preserving the structural constraints. The learner should rebuild the sandwich from the problem rather than memorise a numerical range.

Competing explanations for a bound violation

A value outside its interval can come from wrong sign, wrong denominator, wrong unit, wrong branch, premature rounding or an invalid bound assumption. Use dimensional consistency and term provenance to identify the earliest cause.

Observation versus inference

The givens and structural rules are observed task information. The lower/upper interval is derived. The exact answer is another derived result. Agreement between independent derivations increases confidence.

Support versus proof

Landing inside a broad interval does not prove correctness; many wrong answers can fit. Bounds are strongest when tight or when combined with independent checks such as substitution, conservation or units.

Model limits

Inequality rules depend on sign and domain. Multiplying or reciprocating negative/zero-crossing intervals can reverse or complicate bounds. Use simple positive-domain rules only where their conditions are satisfied.

Delayed transfer

Return later with mixed geometry, percentage, probability, rate and data questions. Ask the learner to produce two independent bounds, tighten them, detect one inconsistent bound and use the interval to evaluate an exact answer.

Internal learning links

Use the Mathematics Hub, Vol 0086 Bounding Checks, Vol 0158 Benchmark Anchors, Examination Craft and the PSLE Learner’s Guide.

MOE and SEAB current framework

MOE states that Full Subject-Based Banding is fully implemented and that, from 2027, the Singapore-Cambridge Secondary Education Certificate (SEC) replaces the former N- and O-Level examinations, with graduating students sitting subjects at their respective G1, G2 or G3 levels. See the official MOE Full SBB / SEC announcement. For current 2027 G2 Mathematics subject code K210 and syllabus links, use the official SEAB G2 syllabus directory.

Final rule

Before trusting the exact value, trap it. Build a justified lower bound and upper bound, tighten them where useful, and treat any exact answer outside the sandwich as a signal to repair the reasoning.

G2 SEC Learner’s Guide: Open the Vol 0132–0175 hub and subject index.