Solve BPM:GNG::?:AKD

A letter-analogy of this kind is solved by converting each letter to its alphabetical position (A=1 ... Z=26), finding the position-shift pattern that turns the first term into the second term of the given pair, and applying that same shift to each candidate to see which one reproduces the target letters (wrapping past Z back to A when a shift overshoots 26).

First pair (BPM : GNG) — find the shift for each letter position:

• B(2) + 5 = G(7)

• P(16) - 2 = N(14)

• M(13) - 6 = G(7)

So the rule is +5 on the first letter, -2 on the second letter, -6 on the third letter. Apply this same rule to every candidate and compare the result with the target AKD:

Only V, M, J transforms to A, K, D under the +5, -2, -6 rule, an exact match with the target — so V, M, J is the correct term.