Number Sequence Puzzles, Explained From the Rule Up
A catalogue of the rule types behind number sequence puzzles, a first-pass procedure that beats guessing, and the honest limit of every such puzzle.
Topic hub · 18 articles
A puzzle feels like inspiration and is usually procedure. Number sequences have a small number of underlying rules; matrix problems vary a small number of attributes; syllogisms fail in a small number of predictable ways. Once you know the catalogue, most items become a search through it rather than a wait for insight.
This matters because the alternative — staring until something clicks — does not scale and does not survive a time limit. A systematic first pass tells you within seconds whether a sequence is arithmetic, geometric, recursive, interleaved, or built on differences of differences, and that is most of the work.
These articles cover the construction of each puzzle type, the solving procedure that fits it, and the specific reasoning errors that make otherwise-capable people get them wrong.
For numeric sequences, first and second differences identify most rules immediately. The sequences guide covers the full procedure.
Matrix items vary things like shape, count, rotation, shading and position. Listing the attributes before looking for the rule prevents the common failure of spotting one rule and stopping.
Affirming the consequent, illicit conversion and base-rate neglect account for a large share of wrong answers on deduction items. The reasoning-error articles cover them individually.
A catalogue of the rule types behind number sequence puzzles, a first-pass procedure that beats guessing, and the honest limit of every such puzzle.
State the relationship as a full sentence before reading the options. Analogy relationship types, how distractors are built, and worked verbal and number items.
What a constant difference is, how the nth-term rule is derived rather than memorised, and why the sum of an arithmetic sequence is just pairing.
Valid but untrue, one rule assumed unique, a conditional read backwards. Six errors that wreck puzzle answers, each with a checkable example and a fix.
From 'if P then Q' only two inferences are valid. The four forms, why the invalid pair feels right, the contrapositive, and what 'only if' actually means.
A deductive argument promises its conclusion cannot be false if the premises are true. Validity, soundness, the counterexample test, and why belief interferes.
What makes a sequence recursive, how Fibonacci and Lucas numbers differ only in their seeds, and which golden ratio claims actually hold up.
A mechanical method for finding the rule behind a number pattern when inspection fails, using difference tables, constant rows and degree counting.
How to spot a constant ratio, why the nth-term rule uses an exponent, and what negative ratios and ratios below one do to a sequence.
Inductive arguments make a conclusion probable, never certain. The four common shapes, what makes one strong, and a sequence that punishes early confidence.
A worked method for grid logic puzzles: mark negatives first, propagate every positive across its row and column, and use counting when elimination stalls.
Matrix reasoning items are built from a few named rules running across rows and down columns. How the attributes, the rules and the wrong options are chosen.
Which inverse operation solves a missing number problem depends on where the blank sits. Worked examples, the two shapes that trip people up, and a check.
An odd one out puzzle asks for a dimension on which one item differs. Why several answers are often defensible, and how a setter removes the ambiguity.
Why a finite list of numbers never forces a single continuation, the convention that makes sequence puzzles answerable anyway, and how to check yours.
Categorical statements come in four forms. The square of opposition, a circle-drawing method that settles validity, and the invalid forms that feel right.
Figural pattern puzzles run on translation, rotation, reflection and glide reflection, plus a counted attribute. How to name what changes, and check it.
Know where a process ended but not where it started? Invert each step and reverse the order. Worked chains, the order trap, and how to check a result.