Prime Dice Gamble

This quant interview question is about combinatorics and probability on a modified pair of dice. Instead of standard faces, you work with specially chosen values whose arithmetic and parity structure shape which sums can occur and which can be prime. It is a clean, discrete setup typical of quant prep, where you must translate a simple story into a well-defined probability space.

It trains your understanding of parity, prime structure, and how constraints on a discrete sample space restrict possible outcomes. You practice enumerating outcomes systematically, recognizing symmetries, and using basic number theory to cut through brute-force thinking. This is classic quant prep material: compact, rigorous, and designed to reveal whether you see hidden structure quickly.

For quant interviews, such questions matter because they test fast, precise reasoning under uncertainty. Interviewers want to see if you can model a random experiment, control the counting cleanly, and justify your probability intuitively as well as numerically. These skills transfer directly to pricing, risk modeling, and understanding distributions in quantitative finance.

What it tests

When analyzing the sum of numbers drawn from a set with specific parity properties, the structure of possible sums is dictated by how odd and even elements combine. In particular, the sum of two odd numbers is always even, and the sum of an odd and an even number is always odd. Since most primes are odd (except for 2), and the sum of two odd numbers is even (and thus rarely prime), the only way to get an odd prime as a sum is by combining the unique even prime with an odd prime. This principle generalizes: in any problem where outcomes are drawn from sets with distinct parity, the set of achievable sums (or other operations) is sharply constrained by these parity rules, which can dramatically reduce the number of cases to check.