Difficulty: Easy
Correct Answer: B
Explanation:
Introduction / Context:
Many alphabet series use alternating step sizes to produce a jagged yet regular path through letters. Here we have a descending sequence: Z, W, S, P, L, I, E. The goal is to find the rule that transforms one letter to the next and then apply it to E to obtain the next term. Because we move within the finite set A–Z, if a calculation falls below A, wraparound back from A to Z would be used, though in this item the steps remain within range.
Given Data / Assumptions:
Concept / Approach:
Compute successive differences: Z→W is −3, W→S is −4, S→P is −3, P→L is −4, L→I is −3, I→E is −4. The alternation −3, −4 repeats precisely. Therefore, from E we continue with the next step in the cycle, which is −3.
Step-by-Step Solution:
1) Convert to numeric positions to make subtraction transparent.2) Confirm the repeating pattern: −3, −4, −3, −4, −3, −4.3) Apply the next required decrement to E(5): 5 − 3 = 2.4) Position 2 corresponds to letter B.
Verification / Alternative check:
Project the pattern one step earlier or later to ensure it remains consistent across the entire sequence. Every consecutive pair conforms to the alternating −3, −4 rule, and extending by −3 from E cleanly produces B with no anomalies.
Why Other Options Are Wrong:
D (4) would imply −1 from E; F (6) implies +1; K (11) implies +6. None match the mandated −3 step.
Common Pitfalls:
Misreading the direction (adding instead of subtracting) or assuming a single constant decrement. Always test at least three successive gaps to detect alternation reliably.
Final Answer:
B
Discussion & Comments