Analogy & Series
Learning Objectives
- Understand the fundamental concepts of Analogy & Series
- Apply key formulas and techniques to solve problems
- Practice with exam-level questions to build speed and accuracy
Analogy and Series questions are the backbone of the Logical Reasoning section in competitive exams like CLAT. These problems test your ability to identify underlying relationships between words or numbers and detect hidden patterns within sequences. Mastering these skills requires a shift from rote memorization to active pattern recognition, allowing you to solve complex puzzles under time pressure.
Analogy: Understanding Relationships
An Analogy is a question type that asks you to identify the relationship between two given terms and apply that same logic to a pair of unknown terms. The core principle here is consistency; if "A is to B as C is to D," the logical connection must be identical in both halves.
The most common relationships tested include synonyms, antonyms, part-to-whole, cause-and-effect, and functional associations. For instance, a "Heart" is to "Body" as a "Wheel" is to "Car." This follows a part-to-whole pattern. Conversely, "Hot" is to "Cold" as "Day" is to "Night," which follows an antonym or opposite relationship.
Examiners typically present these in the format A : B :: C : D. Your task is to find the missing term (D) when A, B, and C are provided, or to identify the pair that does not fit the established group. The key to solving these quickly is to categorize the relationship immediately upon reading the first pair.
Series Completion: Decoding Patterns
A Number Series presents a sequence of digits where you must determine the rule governing the progression and find the missing number or the next term in the list. The fundamental rule is that every series follows a mathematical operation, such as addition, subtraction, multiplication, division, or a combination thereof.
The most basic pattern is an arithmetic progression where a constant value is added or subtracted at each step. For example, in the sequence 2, 5, 8, 11, the rule is "+3." More complex series involve alternating operations, such as adding 2 and then multiplying by 2. Another frequent pattern involves square numbers (1, 4, 9, 16) or cube numbers (1, 8, 27), where the position of the number in the sequence dictates its value.
Letter Series follow similar logic but use alphabetical positions. The alphabet is treated as a continuous line from A to Z. Patterns often involve skipping letters (e.g., every second letter: B, D, F) or moving backward and forward based on a specific count. Sometimes, the pattern involves reversing the alphabet order (Z to A), which requires knowing that A=1 and Z=26.
Odd One Out: Finding the Discrepancy
The Odd One Out question presents a set of four items where three share a common characteristic or follow a specific rule, while one item deviates from this norm. The goal is to identify that single outlier based on logic, category, or mathematical property.
This section tests your ability to group information effectively. You must look for the "common thread" among three items. For example, if you are given {Apple, Banana, Carrot, Grape}, the odd one out is Carrot because it is a root vegetable while the others are fruits. In number sets, the outlier might be the only even number in a group of odd numbers, or the only prime number.
Examiners often use this to test lateral thinking. The rule might not be obvious immediately; you may need to look at the shape of the letters, the sound they make, or the mathematical properties of the numbers. Always check for multiple possibilities before committing to an answer, but ensure your chosen outlier is the one that breaks the strongest logical link.
First, analyze the relationship between "Book" and "Library." A library is a place where books are stored. This is a "Place of Storage" relationship.
Next, apply this rule to the second pair. We need an item that is stored in a Museum.
The missing term must be an object found inside a museum. Common options might be "Painting," "Sculpture," or "Artifact."
If the options were: A) Car, B) Painting, C) Shoe, D) Chair.
"Car" is stored in a garage. "Shoe" is stored in a closet. "Chair" is furniture for sitting.
Therefore, "Painting" is the correct answer because it fits the "Place of Storage" pattern perfectly.
Step 1: Calculate the difference between consecutive numbers.
16 - 10 = +6
24 - 16 = +8
34 - 24 = +10
Step 2: Observe the pattern in the differences. The differences are increasing by 2 each time (6, 8, 10).
Step 3: Apply the next difference to the last known number.
Next difference should be +12.
Calculation: 34 + 12 = 46.
The missing number is 46.
Common Traps
- Assuming a simple pattern: Students often jump to the conclusion that a series is just adding or subtracting a constant. If the differences change, you must look for second-order patterns (like the difference of differences).
- Ignoring letter positions: In letter series, students sometimes treat letters as isolated symbols rather than numbers on a scale (A=1, B=2). This leads to errors in alternating forward-backward movements.
- Misidentifying the Odd One Out category: A common mistake is focusing on surface-level attributes like color or shape when the rule is actually mathematical. For example, in {4, 9, 16, 20}, one might think 20 is odd because it doesn't look like a square number, but the rule is strictly "perfect squares."
- Overthinking analogies: Sometimes students try to find complex scientific relationships when a simple synonym or antonym relationship is intended. Stick to the most direct logical link first.
Memory Tricks
- The "Skip Count" Mnemonic: For series like A, C, E, G (every second letter), remember the phrase "Every Other." If you skip two letters (A, D, G), think of the song "Skip Skip Skip."
- Square Number Visualization: Memorize squares up to 12. Visualize a grid: 3x3 is 9 dots, 4x4 is 16 dots. This helps instantly in series involving 1, 4, 9, 16, 25.
- The "Three-Of-Four" Rule for Odd One Out: Never look for the odd one out until you have identified a common trait shared by at least three items. If no group of three shares a clear trait, re-evaluate your initial assumptions about the category.
- Analogy Keywords: When solving analogies, associate specific keywords with relationship types: "Place" (Library, School), "Opposite" (Hot/Cold), "Tool" (Hammer/Nail), "Part" (Wheel/Car).
Do not spend more than two minutes on any single analogy or series question. If you cannot spot a pattern quickly, mark it and move on to save time for easier questions.
For Odd One Out, scan the options first; sometimes the answer is obvious if you look at the choices rather than just the stem.
Always double-check your arithmetic in number series before bubbling your answer. A simple addition error can cost you marks even if your logic was perfect.
Multi‑Step Analogies: Chained Relationships
Standard analogies test a single relational link such as synonym, antonym, part‑whole, or tool‑user. Advanced items chain two or more distinct relations, requiring the solver to identify each link before mapping the final term. A typical chain might read “Seed : Plant :: Egg : ?” where the first pair follows a “origin‑to‑mature‑form” relation and the second pair demands the same logical step applied to a different domain. The difficulty rises when the chain mixes relational types: for example, “Keyboard : Input :: Monitor : Output :: Processor : ?” Here the first two pairs establish a device‑function pattern (input device, output device) and the third asks for the central processing unit that mediates between them. The correct answer is “Central Processing Unit” or simply “CPU” because it performs the processing function that links input to output.
To solve chained analogies systematically, break the stem into ordered pairs and label each relation with a keyword (origin, function, sequence, degree). Write the keywords in a column; then verify that the same keyword sequence applies to the answer choices. If a choice satisfies the first keyword but fails the second, discard it. This method prevents the common error of matching only the surface similarity of the first pair.
Examiners often embed a distractor that shares the first relation but violates the second. In the example above, “Mouse” is an input device like a keyboard, so it satisfies the first keyword (input) but fails the second (output). Recognising that the chain requires a shift from peripheral to core component eliminates such traps.
Practice with three‑step chains drawn from diverse domains — biology, computer science, linguistics — builds the mental flexibility to spot the underlying keyword sequence quickly. Keep a personal log of keyword patterns you encounter; over time the list becomes a reusable template for any new chain.
Hybrid Series: Mixed Alphanumeric Patterns
Hybrid series combine letters and numbers in a single progression, forcing the test‑taker to track two independent cycles simultaneously. A classic form alternates a letter shift with a numeric operation, e.g. A2, C5, E9, G14, ?. The letters advance by two positions each step (A→C→E→G→I). The numbers follow the pattern +3, +4, +5, so the next increment is +6, giving 20. The answer is I20.
More complex hybrids may embed a secondary pattern inside the numeric component, such as prime gaps or triangular numbers, while the alphabetic component follows a reverse‑skip or a vowel‑consonant toggle. Consider Z1, X3, V6, T10, ?. Letters move backward by two (Z→X→V→T→R). Numbers increase by successive integers: +2, +3, +4, so the next increase is +5, yielding 15. The missing term is R15.
When a hybrid series appears, isolate the two streams immediately. Write the letter positions (A=1 … Z=26) in one column and the numeric values in another. Compute differences for each column independently. If one column shows a constant difference and the other shows a second‑order difference, you have identified the governing rules. Never attempt to find a single arithmetic rule that mixes letters and numbers; the exam designer intentionally separates the logic.
Edge cases include series where the letter cycle wraps (Y, A, C…) or where the numeric cycle resets after a modulus (e.g., modulo 12 for clock‑style series). In wrap‑around cases, treat the alphabet as a circular buffer of length 26; in modulus cases, apply the modulus after each arithmetic step. Recognising these boundary conditions prevents off‑by‑one errors that are a frequent source of lost marks.
Step 1: Separate letters and numbers.
Letters: Y, A, C, E …
Numbers: 5, 9, 14, 20 …
Step 2: Analyse the letter stream. Convert to positions: Y=25, A=1, C=3, E=5. The sequence moves forward by 2 positions on a circular alphabet (25→1→3→5). Next letter position = 5+2 = 7 → G.
Step 3: Analyse the number stream. Differences: 9‑5=4, 14‑9=5, 20‑14=6. The increments increase by 1 each step. Next increment = 7. Next number = 20+7 = 27.
Step 4: Combine results → G27.
Conditional Odd One Out: Rule Switching
Standard odd‑one‑out questions present a single governing rule shared by three items. Advanced variants introduce a conditional rule that changes based on a property of the items themselves. For instance, the set {2, 3, 5, 9} appears to be “prime numbers” with 9 as the outlier. However, if the instruction reads “Select the number that does not satisfy the rule: ‘If the number is even, it must be a multiple of 4; if odd, it must be prime’”, The set or rule must be altered to yield a single violator, e.g., change 9 to 7 (prime) so only 2 violates, or change the rule so only one item fails.. The examiner expects you to test each item against the conditional statement and identify the unique violator.
Another common conditional structure uses a “majority property” that flips for a minority subset. Example: {Circle, Square, Triangle, Pentagon}. Three are polygons with straight edges; the circle is the outlier under a “straight‑edge” rule. But if the stem adds “All shapes have interior angles summing to 360° except one”, the circle (no interior angles) and the triangle (180°) both break the rule. The unique outlier is the triangle because the circle’s angle sum is undefined, not 360°, making the triangle the only shape with a defined sum that differs from 360°.
To crack conditional odd‑one‑out, first paraphrase the condition in your own words. Then create a truth table: list each option, evaluate the antecedent (if‑clause), then the consequent (then‑clause). Mark each as “satisfies” or “violates”. The answer is the sole option with a “violates” mark. If more than one violates, re‑read the condition for hidden qualifiers such as “exactly one”, “only”, or “unless”.
Examiners also embed a “meta‑rule” where the odd one out is the item that does not share the same *type* of rule as the others. For example, three items follow a mathematical rule (perfect squares) and the fourth follows a linguistic rule (starts with a vowel). The outlier is the linguistic item because the dominant rule class is mathematical. Recognising the rule class hierarchy is essential for these higher‑order items.
Reverse Engineering: Working Backwards from Options
When the stem presents a complex analogy or series and the answer choices are short, reverse engineering can be faster than forward solving. The technique: treat each option as the missing term, insert it into the stem, and test whether the completed structure exhibits a coherent, simple pattern. This is especially powerful for analogy questions where the relationship is ambiguous but the options are concrete nouns.
Consider the analogy “Manuscript : Archive :: ? : Museum” with options A) Painting, B) Sculpture, C) Artifact, D) Fossil. Instead of debating whether the relation is “place of storage”, “place of display”, or “place of preservation”, test each option. “Painting : Museum” fits display and preservation. “Sculpture : Museum” also fits. “Artifact : Museum” fits preservation and display. “Fossil : Museum” fits but fossils are more commonly associated with natural history museums. The simplest, most general relation that covers three options is “object curated by the institution”. Since three options satisfy it, the odd one out among the options is the one that least fits the dominant category — here, Fossil is the least typical for a general museum. However, if the question asks for the *best* completion, choose the option that aligns with the most frequent collocation in standard usage: “Artifact” is the hypernym covering paintings, sculptures, and fossils, making it the strongest answer.
For series, plug each numeric option into the gap and compute the resulting differences. The option that yields a consistent difference pattern (constant, arithmetic progression of differences, geometric ratio) is the answer. This avoids solving a quadratic or higher‑order recurrence under time pressure.
Reverse engineering carries a risk: an option may accidentally create a plausible pattern that the examiner did not intend. Guard against this by checking that the pattern you discover is the *simplest* (Occam’s razor) and that it uses only operations explicitly supported by the visible terms (addition, subtraction, multiplication, division, exponentiation). If a pattern requires an obscure function (e.g., factorial of digit sum), discard it.
Time‑Pressure Heuristics: Pattern Recognition Under Constraints
High‑stakes tests impose strict per‑question time limits, often 60–90 seconds for logical reasoning items. Developing a set of heuristics that yield a “good enough” answer quickly can raise overall scores more than perfect accuracy on a few items. The first heuristic is “Two‑Term Lock”: examine only the first two terms of a series or the first pair of an analogy. If they reveal a clear, common relation (e.g., +2, ×3, synonym), assume the relation holds unless a later term contradicts it. This works because test designers usually establish the rule early and then extend it.
The second heuristic is “Option Elimination by Property”. Before solving, scan the answer choices for a property that three share and one lacks (e.g., three are even, one odd; three are nouns, one verb). If such a property exists, the odd one out is often the answer for odd‑one‑out questions, or the unique property signals the correct analogy completion. This pre‑scan takes ≤5 seconds and can solve up to 20 % of items without any calculation.
The third heuristic is “Anchor‑Term Substitution”. In analogies with an abstract first term (e.g., “Justice : Court :: ? : Hospital”), replace the abstract term with a concrete exemplar (“Judge : Court :: Doctor : Hospital”). The concrete mapping often reveals the relational template (professional : workplace). Then map back to the abstract domain. This reduces cognitive load by leveraging familiar real‑world pairs.
Finally, practice “Timed Drill Sets” of 20 mixed items with a 25‑minute limit. Record which heuristics succeeded and which failed. Over multiple drills, you will internalise the decision threshold: if a pattern is not evident within 30 seconds, mark and move on. This disciplined approach prevents the “sunk‑cost” trap where a single difficult item consumes time needed for several easy ones.
- Assuming a single relation in a chained analogy when two distinct relations are required.
- Merging the alphabetic and numeric streams in a hybrid series instead of treating them independently.
- Overlooking conditional qualifiers (“if”, “unless”, “only”) in odd‑one‑out stems, leading to multiple apparent outliers.
- Accepting a reverse‑engineered pattern that uses operations not supported by the visible terms (e.g., factorial, digit‑sum).
- Applying a heuristic beyond its validity window — e.g., using “Two‑Term Lock” on a series that deliberately changes rule after the third term.
- Failing to verify that the chosen odd one out breaks the strongest logical link rather than a superficial attribute.
- Spending more than the allocated time on a single item because the pattern feels “almost there”, causing cascading time loss.
Recursive Analogies: Self‑Referential Structures
Recursive analogies embed the relationship inside the terms themselves, requiring the solver to recognise a meta‑pattern rather than a simple pairwise link. A classic form presents a pair where the first term describes the relation that holds between the second term and a third hidden term, e.g. “Definition : Dictionary :: Algorithm : ?”. The relation “is explained in” works for the first pair; the second pair demands the container that explains an algorithm, which is “Textbook” or “Manual”. The difficulty rises when the recursion depth exceeds one level: “Meta‑definition : Definition :: Meta‑algorithm : Algorithm”. Here the solver must identify that the prefix “meta‑” signals a higher‑order description, and then apply the same prefix to the target domain. Recognising morphological cues (meta‑, proto‑, neo‑, pseudo‑) and their semantic effect on the base noun is the primary mechanism. Exceptions appear when the prefix does not preserve the part‑of‑speech, such as “pseudo‑science” (noun) versus “pseudo‑scientific” (adjective); the analogy may switch categories, so the solver must verify that the transformed term fits the syntactic slot of the answer choices.
Another recursive variant uses self‑referential sentences: “This statement is false : Paradox :: This statement is true : ?”. The first pair maps a self‑referential falsehood to the concept “Paradox”. The second pair maps a self‑referential truth to “Tautology”. The underlying logical classification (paradox vs tautology) is the invariant. When answer options include “Contradiction”, “Axiom”, “Theorem”, the correct choice is the one that shares the same logical status as the first term’s classification. The trap is to select a term that merely sounds similar (e.g., “Contradiction”) without checking the logical category.
To solve efficiently, isolate the operator that transforms the first term into the second (prefix addition, suffix addition, logical classification). Apply the identical operator to the third term and match the result against the options. If multiple options survive, test each against the original pair for consistency of category and register.
Geometric Series with Variable Ratios
Standard geometric progressions assume a constant ratio r between successive terms. Advanced series often employ a ratio that itself follows a simple arithmetic or geometric rule, producing a second‑order geometric series. For example, the sequence 2, 6, 24, 120, … has ratios 3, 4, 5 — an arithmetic progression of ratios with common difference 1. The nth term can be expressed as a product of successive integers: aₙ = 2 × 3 × 4 × … × (n+1) = (n+1)! / 1!. Recognising factorial growth is the key. Another pattern: 3, 12, 60, 360, … where ratios are 4, 5, 6 — again arithmetic. The general term is aₙ = 3 × (n+2)! / 3! = (n+2)! / 2!. When the ratio sequence is geometric, e.g. 5, 15, 75, 525, … ratios 3, 5, 7 (odd numbers) — not geometric but arithmetic of odd numbers. The solver must compute successive ratios first, then inspect the ratio‑sequence for its own pattern.
A frequent twist inserts a “reset” term that breaks the ratio pattern, forcing the test‑taker to detect a piecewise definition. Example: 2, 6, 18, 54, 10, 30, 90, … The first four terms follow ×3; the fifth term restarts at 10 and the ×3 pattern resumes. The rule is “multiply by 3 until a term exceeds 50, then subtract 44 and continue”. Detecting the threshold requires scanning for a sudden drop in magnitude. The examiner may also hide the reset inside a larger series by interleaving two independent geometric streams: odd positions follow ×2, even positions follow ×3. Separating the streams (sub‑series extraction) restores constant ratios for each stream.
Solution strategy: write the first‑order differences of logarithms (log aₙ₊₁ – log aₙ) to linearise multiplicative patterns. If the log‑differences form an arithmetic progression, the original series is a second‑order geometric series. If the log‑differences themselves show a periodic pattern, suspect interleaved streams. Always verify the discovered rule against at least three consecutive terms before committing.
Cross‑Domain Mapping: Linguistic to Numerical
Cross‑domain analogies translate a relational structure from language into numbers or vice‑versa. A typical item: “Synonym : Antonym :: 5 : ?”. The linguistic pair expresses opposition; the numerical counterpart must express the same logical opposition. In arithmetic, the opposite of a positive integer is its additive inverse, so the answer is –5. Another variant: “Homophone : Homograph :: 12 : ?”. Homophones share sound, homographs share spelling; the relation is “same X, different Y”. In numbers, “same digits, different order” maps to an anagram of digits, e.g., 21. The solver must abstract the relational schema (shared attribute A, differing attribute B) and instantiate it in the target domain.
More complex mappings involve morphological operations: “Prefix‑addition : Suffix‑addition :: ×2 : ?”. Adding a prefix modifies the front of a word; adding a suffix modifies the end. In arithmetic, multiplying by 2 scales the whole number, while appending a digit (e.g., ×10 + 3) modifies the rightmost side. The analogous operation to suffix‑addition is “append a digit” or “multiply by 10 and add”. Recognising positional asymmetry (front vs back) is crucial. Examiners often disguise the mapping by using synonyms for the operations: “prepend” vs “append”, “left‑shift” vs “right‑shift”.
To solve, first label the linguistic relation with a domain‑agnostic descriptor (e.g., “front‑modification vs end‑modification”). Then scan the numeric options for an operation that mirrors the descriptor. Eliminate options that implement the opposite side or a wholly different transformation (e.g., exponentiation). If two numeric options both fit the descriptor, test each against the original linguistic pair for consistency of directionality (does the operation increase or decrease magnitude?).
Pattern Inversion and Mirror Series
Mirror series present a palindromic or reversible structure where the second half of the sequence is the first half transformed by a systematic inversion. Example: 2, 5, 9, 9, 5, 2. The first three terms increase by +3, +4; the next three decrease by –4, –3 — the increments are reversed and sign‑flipped. The governing rule: generate a forward pattern, then reflect it with inverted operations. Another form: alphanumeric mirror — A1, B3, C5, C5, B3, A1. The letter advances, the number advances by 2; the mirror point repeats the central term. Detecting the mirror point is the primary task. The series length is often odd, with a unique central term that belongs to both halves.
Inversion can also apply to the relational operator itself: a series of analogies where the relation flips direction at the midpoint. Example: “Cat : Kitten :: Dog : Puppy ; Puppy : Dog :: Kitten : ?”. The first analogy uses “adult : young”; the second uses “young : adult”. The answer is “Cat”. The solver must recognise the relational reversal and apply it to the second pair. When the series mixes numeric and verbal items, the mirror may cross domains: 3, 6, 12, “double”, “half”, 1.5. The numeric half follows ×2; the verbal half states the inverse operation; the final numeric term applies the inverse to the last numeric value.
Solution workflow: write the indices of terms. If the series length n is odd, compute the midpoint m = (n+1)/2. Compare term i with term n‑i+1 for i = 1…m‑1. Identify the transformation linking each pair (sign reversal, reciprocal, lexical opposite). Verify that the same transformation holds for all symmetric pairs. Once confirmed, predict the missing term by applying the transformation to its symmetric counterpart.
Multi‑Layered Odd One Out: Hierarchical Classification
Hierarchical odd‑one‑out items embed multiple classification levels — taxonomic, functional, and orthographic — simultaneously. A set may contain “Oak, Pine, Maple, Spruce, Fern”. At the taxonomic level, the first four are gymnosperms or angiosperms (trees), while Fern is a pteridophyte (non‑seed vascular plant). At the functional level, all five are photosynthetic, so function does not discriminate. At the orthographic level, four start with consonants, one with a vowel — a superficial cue. The correct outlier is the one that breaks the deepest, most scientifically robust classification (taxonomic). Examiners often add a distractor that isolates a shallow feature (e.g., “all have five letters except one”) to lure test‑takers into selecting the wrong answer.
Another layer introduces conditional classification: “If the item is a mammal, classify by habitat; otherwise classify by reproductive mode.” The set “Whale, Bat, Shark, Penguin, Kangaroo” requires first separating mammals (Whale, Bat, Kangaroo) from non‑mammals (Shark, Penguin). Among mammals, habitat groups: marine (Whale), aerial (Bat), terrestrial (Kangaroo) — all distinct, so no outlier. Among non‑mammals, reproductive mode: oviparous (Shark, Penguin) — both same. The outlier is the mammal group because the conditional rule creates a split where one sub‑group is heterogeneous. The solver must parse the conditional stem, apply the primary filter, then evaluate homogeneity within each resulting subset.
Effective technique: draw a quick taxonomy tree on scratch paper. Place each option at the lowest relevant node. Identify the node that contains all but one option. That solitary option is the answer. If multiple nodes qualify, choose the node highest in the hierarchy (most general) that still excludes only one item. This prevents selection based on incidental attributes like spelling or syllable count.
- Assuming a single classification level when the stem implicitly invokes a hierarchy (taxonomic > functional > orthographic).
- Ignoring conditional qualifiers (“if”, “unless”) that partition the set before the odd‑one‑out test.
- Selecting the item that differs on a superficial feature (letter count, initial vowel) while a deeper scientific category groups the rest.
- Failing to recognise a mirror point in a series, leading to projection of the forward pattern into the reflected half.
- Treating a variable‑ratio geometric series as a simple geometric progression and missing the arithmetic progression of ratios.
- Review these traps before each practice session to avoid recurring errors.