True Statements Among 100 Logical Claims
True statements out of 100 statements is a medium quant interview question on Brain Teasers, reported to have been seen at Jane Street.
MyQuantPartner is not affiliated with, endorsed by, or sponsored by these companies, and all trademarks belong to their respective owners.
This classic brain teaser sits at the intersection of logic puzzles and quant interview thinking. It features self-referential statements whose truth values depend on each other, forcing you to reason about global consistency rather than treating each claim in isolation. Problems like this often appear in quant prep because they test your ability to keep a system-wide perspective while tracking subtle logical dependencies.
It trains your sense of logical fixed points, self-consistency, and reasoning about constraints that reference the entire system they belong to. You practice checking all possible global configurations and spotting which ones can coexist without contradiction. This sharpens skills like discrete reasoning, abstraction, and rigorous elimination of impossible worlds, all core in quantitative problem solving.
This matters for quant interviews because many research and trading roles demand comfort with abstract structures, paradox-like setups, and non-standard constraints. Interviewers want to see how you model interdependent conditions, whether you can argue clearly about mutually exclusive configurations, and how you communicate a logically watertight conclusion under time pressure. Brain teasers of this form reveal clarity of thought more than prior knowledge, which is exactly what top quant interviews seek to measure.
What it tests
This problem class is governed by the principle of self-referential consistency and threshold logic. When statements make claims about the collective truth of a set that includes themselves, the only consistent solutions occur at a boundary where the number of true statements exactly matches the threshold described by the statements themselves. The pattern is that for each possible count $k$ of true statements, only those statements compatible with exactly $k$ true statements can themselves be true. This creates a fixed point: the number of true statements must equal the highest $n$ for which the $n$th statement's claim is satisfied by that very count. The underlying reason is that any deviation from this fixed point leads to logical contradiction, as either too many or too few statements would be true relative to their own claims.
Practise this question with written feedback, or hear it in a spoken mock interview.
Get started free