Algebraic / Equation Reasoning

Algebraic Reasoning in OC Thinking Skills rarely involves formal algebra — no x and y notation required. Instead, this unit is about translating real-world constraints into a clear sequence of arithmetic steps and executing them without losing track. Let's start with the most common and most manageable variant: capacity questions where you need to find the maximum number of events that can be fitted into a limited time.

Capacity and rate questions appear consistently in the easier half of OC TS and reward students who can work in a clean step-by-step sequence. They are reliable marks because the method never changes: find total available time, subtract constraints, divide by the unit task time, then scale.

The examiner wants to confirm that you can translate real-world constraints — opening hours, individual breaks, session lengths, number of workers — into a single arithmetic chain without double-counting any of them or forgetting to include a constraint.

You are given a time window (e.g. 9:00 am to 6:00 pm), a number of workers, a per-worker break, and a fixed time per task. You must find how many total task sessions all workers can complete across the whole day.

Daniel has plenty of flour, plenty of sugar, and enough butter — but only 5 eggs. The eggs run out first, and when they do, no more cupcakes can be made regardless of how much of everything else is left. This is the "limiting ingredient" concept: the answer is always determined by whichever resource runs out first, not by the one you have the most of.

Limiting ingredient / bottleneck maximisation questions appear regularly in OC TS and reward students who check every resource rather than rushing to use the largest number. Students who pick 24 (from butter) have done the right calculation but stopped at the wrong ingredient. The correct approach is to calculate the cupcake cap for every ingredient and take the smallest.

The examiner is checking whether you can set up a "max output per ingredient" calculation for each resource, identify the smallest result (the bottleneck), and verify it by checking whether all other ingredients can support that number. The final verification step is essential — it confirms the bottleneck choice is correct.

A recipe or process requires multiple ingredients or resources in fixed proportions. You are given a quantity of each ingredient. The question asks for the maximum number of items that can be produced. You calculate the maximum each ingredient allows and pick the minimum — that is the bottleneck and the answer.

Now for a genuinely algebraic challenge that wraps equation-solving in an elegant disguise: a word score puzzle. Each letter has a hidden numerical value, and the given word scores are simultaneous equations in disguise. Your job is to crack each letter's value one step at a time using substitution — the same core skill that underpins all of OC TS algebraic reasoning.

Hidden-variable substitution questions appear in the medium band of OC TS and are among the most intellectually rewarding algebraic questions in the paper. They reward students who work methodically through a chain of equations rather than guessing letter values or trying combinations at random.

The examiner is checking whether you can recognise that each word score is an equation in disguise, choose the simplest equation first to crack the first variable, and then substitute known values into subsequent equations one at a time until every letter in the target word is resolved.

Several words and their total scores are given. Each letter has a fixed whole-number value of at least 1. From the given word scores you derive each letter's value step by step. The question then asks you to compute the score for a new word — typically one that uses only letters you have already cracked.

What happens to a string when you fold it repeatedly and mark the midpoint each time? This question looks like it might need spatial imagination — but really it is a pure procedure-tracking problem. Each fold doubles the number of layers, so one mark through the bundle creates twice as many marks as the fold before it. Count the marks, count the segments, set up one simple equation. Done.

Fold-and-mark problems appear occasionally in OC TS and are considered difficult because students try to visualise every layer in their head rather than tracking the pattern algebraically. Students who spot the doubling rule solve it quickly; those who draw it out lose time and make errors.

The examiner is checking whether you can abstract a physical process into a mathematical pattern — specifically the doubling of marks with each fold — and then use the gap size to work backwards to the total string length.

A string is marked in the middle, then folded and marked in the middle of the bundle one or more additional times. After unfolding, the distance between marks is given. You must find the total string length. The key relationship is: total length = gap × number of segments, where the number of segments doubles with each fold-and-mark event.