In self-referential statement puzzles, each statement makes a claim about how many statements (out of the whole set) are false. Since the statements claim mutually exclusive counts, at most one statement can be true; the logical consistency condition pins down exactly which one.
There are 100 statements, where statement k claims 'this notebook contains k false statements' for k = 1 to 100. Since all 100 statements make...
Full option-by-option analysis available to enrolled students.