Alphabet analogy using a constant Caesar shift: ZRYQ : KCJB :: PWOV : ?

Introduction / Context:
This analogy involves a constant Caesar cipher (same shift for each letter). Identifying the exact shift on the first pair and transferring it to the second pair is the key skill, frequently tested in logical-reasoning and coding-decoding problems.

Given Data / Assumptions:

• ZRYQ maps to KCJB.
• We must map PWOV to an unknown using the same rule.
• Use modular arithmetic on letters with A=1 to Z=26; wrap around after Z.

Concept / Approach:
Compute the shift letter-by-letter for the first mapping. If the shift is uniform, apply it to the second group. Forward and backward descriptions are equivalent; consistency is what matters.

Step-by-Step Solution:

Verification / Alternative check:
Back-shift by −11 on AHZG to confirm: A→P, H→W, Z→O, G→V. The original is recovered, verifying correctness.

Why Other Options Are Wrong:

• BIAH/QXPA/ZGWF: Each breaks the uniform +11 rule on at least one letter, resulting in inconsistencies.

Common Pitfalls:
Using different shifts per position, or forgetting wrap-around at alphabet boundaries (e.g., 26 + 1 = 1). Always apply the same shift consistently.

Final Answer:
AHZG