Learn the idea. Try it yourself.
Read the explanation or try 6 questions with hints. Free, untimed and no sign-in needed.
All lessons · Sri Lanka study route
Your goal: Translate short statements into conditions, test every permitted case, and distinguish a conclusion that must follow from one that merely could be true. Explain why your answer list is complete.
Preparation context: This original lesson develops logical reasoning for Sri Lanka Mathematics Competition (SLMC) preparation, beginning at an accessible SLMC 8 topic level. The organiser’s released 2019 SLMC 8 paper includes exactly-one reasoning and valid-conclusion questions. Those topics guide the level; every example and practice question below is newly written. This is a topic lesson, not a reproduced paper or a complete exam simulation.
The official 2026 route describes SLMC as an online multiple-choice stage, with later short-answer and proof stages. The written justifications at the end of this lesson are labelled extensions: practising a proof here does not mean that the first-stage paper requires the same response. Historical paper instructions do not establish the current time limit, question count or marking rules.
Before you start: You should recognise even numbers and small multiples, read a short table, and know the meanings of “all”, “some” and “not”. If these words are unfamiliar, begin with Mathematical language and sets. No formal logic symbols are required; T and F below simply mean true and false.
A manageable route: Try the three starting checks, learn the truth-table method and do Examples 1–2 with Problems 1–3. In another sitting, read Examples 3–4 and attempt Problems 4–6. Problems 7–9 are proof and transfer extensions. Allow about 25–35 minutes per sitting and a separate 20–30 minutes for the extensions. These are study suggestions, not contest time limits.
Three starting checks
Check 1. Test the actual number
A card shows 6. Decide whether each statement is true: “the number is even”; “the number is greater than 10”.
Complete solution
The first statement is true, because 6 = 2 × 3. The second is false, because 6 is less than 10. Exactly one of these two statements is true. Always evaluate each sentence against the same card; do not change the number halfway through.
Check 2. Negate a claim
There are five counters. Someone says, “All five counters are red.” What would prove that claim false?
Complete solution
Finding at least one counter that is not red proves the claim false. You do not need all five to be non-red. For example, four red counters and one blue counter already contradict “all five are red”. The negation of “all” is “at least one not”, rather than “none”.
Check 3. Keep the direction
Every positive multiple of 4 is even. Does it follow that every positive even integer is a multiple of 4?
Complete solution
No. The positive integer 14 is even, since 14 = 2 × 7, but is not divisible by 4. The given rule goes from “multiple of 4” to “even”; reversing its direction makes a different claim. One counterexample is enough to disprove that reversed universal claim.
If Check 1 was difficult, practise testing two simple conditions before proceeding. If Check 2 was difficult, draw five counters and change only one colour. If Check 3 was difficult, list 2, 4, 6, 8 and identify which are multiples of 4. These small repairs are more useful than guessing a harder puzzle.
A statement has a truth value in each permitted case
statement is a sentence that is true or false once its objects and meaning are fixed. “The card shows an even number” depends on which card is chosen. “Please choose a card” is an instruction, not a true-or-false claim. In a puzzle, first identify the allowed cases: perhaps one integer from 1 to 8, or exactly one prize in three boxes.
truth table is a case list with one column for each statement. In one row, keep the actual situation fixed and evaluate every statement. Then count the true entries. A valid answer must satisfy both the ordinary conditions, such as the range, and the stated truth-count condition.
“Exactly one” is stronger than “at least one”
For two statements P and Q, “exactly one is true” allows (T, F) and (F, T). It excludes (T, T) and (F, F). “At least one is true” also allows (T, T). In this lesson, “P or Q” is inclusive: it means P, Q, or both, unless “exactly one” is explicitly stated. For three statements, exactly one means one T and two Fs; a correct choice of one true statement is not enough unless the others are false.
| P | Q | P or Q | Exactly one |
|---|---|---|---|
| F | |||
| F | |||
| F | |||
| F | F | F | F |
A five-step method
- Name the possibilities. Record the range or the list of allowed locations. Do not silently add another possibility.
- Separate the statements. Keep “not”, “all”, “some”, “and” and “or” attached to the correct words.
- Evaluate one complete row. Test every statement in that same case before moving on.
- Keep precisely the required rows. Count true entries, not the number of sentences that sound plausible.
- Check completeness and the question. State all surviving cases. If two survive, do not invent a reason to select one.
A row with no valid outcome is useful: it rules out a case. If all cases are ruled out, the conditions are inconsistent. A puzzle is not guaranteed to have a unique answer unless its conditions actually force one.
“If P, then Q” does not mean “if Q, then P”
A rule “if P, then Q” forbids a case in which P is true but Q is false. For example, “if a positive integer is a multiple of 8, then it is even” forbids an odd multiple of 8. It does not say that every even number is a multiple of 8. When P is false, this rule alone tells us nothing about whether Q is true.
| P | Q | Does “if P, then Q” hold? |
|---|---|---|
| Yes | ||
| F | No | |
| F | Yes | |
| F | F | Yes |
The last two rows sometimes feel surprising. The rule makes a demand about objects satisfying P; an object that does not satisfy P does not break that demand. For a rule about multiples of 8, the number 6 is not an exception: it was never a multiple of 8.
A useful valid reversal changes both statements: if Q is false, P must be false. This is the contrapositive. If an integer is odd, it cannot be a multiple of 8, because a multiple of 8 would be even. The converse, “if Q, then P”, has no such guarantee. Always explain the contradiction instead of merely memorising the name.
“All” transfers a property; “some” supplies a witness
In these problems, “some” means at least one, possibly more. “All red counters are heavy” says that every counter in the red group is in the heavy group. It does not tell us that a red counter exists. If there are no red counters, there is no red counter violating the rule.
By contrast, “some red counters are wooden” guarantees an actual counter that is both red and wooden. We can follow that same counter through another rule. Do not swap it for a different object midway. To disprove a proposed conclusion, build one complete possible arrangement in which every given statement is true but the conclusion is false. That arrangement is a countermodel.
Four connected worked examples
Example 1. Two overlapping number conditions
An integer n is chosen from 1 through 8 inclusive. Exactly one of these statements is true: P: “n is even”; Q: “n is greater than 5”. Find every possible n.
Idea. The range is small, so a complete table is safer than guessing. The conditions overlap at 6 and 8; those numbers must be rejected because both statements are true.
| Even | Greater than 5 | True count | |
|---|---|---|---|
| 1 | F | F | 0 |
| 2 | F | 1 | |
| 3 | F | F | 0 |
| 4 | F | 1 | |
| 5 | F | F | 0 |
| 6 | 2 | ||
| 7 | F | 1 | |
| 8 | 2 |
The rows with true count 1 are n = 2, 4, 7. For 2 and 4, P is true and Q is false. For 7, P is false and Q is true. The table contains every integer in the stated range, so no solution is missing. The answer is a list, not the sum of its entries.
Your turn 1
An integer n is chosen from 1 through 10. Exactly one statement is true: “n is even”; “n is divisible by 3”. Find every possible n.
Complete solution
The even candidates are 2, 4, 6, 8, 10; the multiples of 3 are 3, 6, 9. The shared candidate 6 makes both statements true and must be removed. The remaining candidates are 2, 3, 4, 8, 9, 10. Each belongs to exactly one list; 1, 5 and 7 belong to neither. This accounts for all ten permitted integers.
Example 2. The label is not the location
Exactly one of three boxes A, B and C contains a prize. The labels say: A: “The prize is in B.” B: “The prize is not in A.” C: “The prize is not in B.” Exactly one label is true. Where is the prize?
Idea. There are three possible prize locations, regardless of where the labels are printed. When testing location A, evaluate all three labels under the assumption that the prize is in A.
| Prize in | Label A | Label B | Label C | True count |
|---|---|---|---|---|
| F | F | 1 | ||
| F | 2 | |||
| F | 2 |
Only the first row has one true label, so the prize is in . Notice that the true label is C’s label; “the prize is in A” does not imply “A’s label is true”. There is also a shorter argument: labels A and C are exact opposites, so one of them is already true. Therefore B’s label must be false. “The prize is not in A” being false means the prize is in A. The table checks that conclusion against every label.
Your turn 2. A puzzle can leave two possibilities
Exactly one prize is in A, B or C. The labels are A: “The prize is in A”; B: “The prize is in C”; C: “The prize is not in C”. Exactly one label is true. Find all possible prize locations.
Complete solution
Labels B and C are opposites, so exactly one of them is true whatever the location. Label A must therefore be false, ruling out A. Both B and C work: if the prize is in B the truth pattern is F, F, T; if it is in C the pattern is F, T, F. The conditions do not determine one box. Reporting just B or just C would leave out a valid case.
Example 3. Follow the same counter
All blue counters are round. Some blue counters are wooden. Must some round counters be wooden? Must all round counters be blue?
Idea. The word “some” gives us a witness. Choose one blue wooden counter and call it X. Because X is blue, the first rule makes X round. X was already wooden, so X is both round and wooden. Thus some round counters must be wooden.
The reverse universal claim does not follow. For a countermodel, take two counters: X is blue, round and wooden; Y is yellow, not blue, round and plastic. Both given statements hold, but Y is a round counter that is not blue. Therefore not all round counters have to be blue. “Must” asks what is true in every arrangement satisfying the givens; one valid countermodel defeats a “must” claim.
Your turn 3
All silver tokens are triangular. Some silver tokens are heavy. Is “some heavy tokens are triangular” forced? Is “some triangular tokens are not silver” forced?
Complete solution
Choose a silver heavy token supplied by “some”. The all-rule makes that same token triangular, so some heavy tokens are triangular is forced. The second claim is not forced: a collection containing just one silver, heavy, triangular token satisfies both givens and has no triangular non-silver token. We may use a one-token collection because no other token is required by the question.
Example 4. Three statements need not be independent
An integer n is chosen from 1 through 18. Exactly one of these statements is true: P: “n is even”; Q: “n is divisible by 3”; R: “n is divisible by 6”. Find all possible values of n.
Bridge. A table with eighteen rows works, but there is a useful relation between the statements. For integers, being both even and divisible by 3 is equivalent to being divisible by 6. To justify the forward direction, write n = 3k. If k were odd, 3k would be odd as a product of two odd integers. Since 3k is even, k must be even, so k = 2m and n = 6m. The reverse direction follows from n = 6m = 2(3m) = 3(2m).
Consequently R means “P and Q”. The possible truth patterns are the four rows below; eight arbitrary combinations of P, Q and R would include impossible situations.
| P | Q | R = P and Q | True count |
|---|---|---|---|
| F | F | F | 0 |
| F | F | 1 | |
| F | F | 1 | |
| 3 |
Exactly one true statement therefore means divisible by 2 but not 3, or divisible by 3 but not 2. The first list is 2, 4, 8, 10, 14, 16; the second is 3, 9, 15. Hence the complete answer is 2, 3, 4, 8, 9, 10, 14, 15, 16, nine values. A multiple of 6 creates three true statements, not two. The truth-pattern argument proves completeness without checking eighteen separate rows.
Your turn 4
An integer n is chosen from 1 through 20. Exactly one of “n is even”, “n is divisible by 5”, and “n is divisible by 10” is true. Find all possible n.
Complete solution
A multiple of 10 makes all three statements true. If n is both even and divisible by 5, write n = 5k; an odd k would make 5k odd, so the even product forces k to be even, making n divisible by 10. Thus exactly one is true precisely for even numbers not divisible by 5 and odd multiples of 5. These are 2, 4, 5, 6, 8, 12, 14, 15, 16, 18, ten values. All other permitted numbers make either zero or three statements true.
Common mistakes and a repair
- Counting “at least one” instead of “exactly one”. Write the true count at the end of each row; reject rows with two or more truths.
- Reading “or” as automatically exclusive. The truth pattern T, T satisfies inclusive “or”. Add an exclusion only if the wording requires it.
- Negating the wrong sentence. “Not all are red” means at least one is not red. It does not mean all are non-red.
- Reversing an implication. Test an even number such as 6 before claiming that even implies multiple of 8. A counterexample settles the issue.
- Inventing an object from “all”. A rule about every blue counter can hold when there are no blue counters. Look for “some” or an explicit existence statement before choosing a blue witness.
- Changing the witness. If one counter is blue and wooden, follow that one counter through the next rule. Separate existence claims might refer to different counters.
- Guessing one answer from several survivors. Keep all cases unless another condition removes one. Explain “not uniquely determined” when appropriate.
Nine original written problems
Try each problem before opening a hint. Problems 1–3 build the method, 4–6 require choosing a representation, and 7–9 extend the reasoning into short proofs. For truth-count puzzles, no assumption about habitual truth-tellers or liars is intended; only the displayed statements and conditions apply.
Foundation 1. A new overlap
An integer n is chosen from 1 through 12 inclusive. Exactly one of “n is less than 5” and “n is even” is true. Find every possible n.
Hint 1
Split into n below 5 and n at least 5.
Hint 2
Below 5 the first statement is already true, so the second must be false.
Complete solution
For n = 1, 2, 3, 4, the first statement is true. To have exactly one truth, n must be odd, giving 1 and 3. For n = 5 through 12, the first statement is false, so n must be even, giving 6, 8, 10, 12. Therefore 1, 3, 6, 8, 10, 12 are all the answers. The two ranges are disjoint and cover the entire permitted range, which proves completeness.
Foundation 2. Opposite statements
A card is either red or not red. P says “the card is red”; Q says “the card is not red”. You are told exactly one of P and Q is true. Can you determine that the card is red? Explain.
Hint 1
Try one red card and one blue card.
Hint 2
For each card, count the true statements rather than choosing your preferred statement.
Complete solution
No. A red card produces P true and Q false. A non-red card produces P false and Q true. Both meet the condition, so the condition gives no information that distinguishes the cases. P and Q are exact negations, so exactly one is always true. This does not mean that both statements can be false or that the card has no colour.
Foundation 3. Change the required count
Exactly one prize is in a red, green or blue box. The red box says “The prize is in green”; green says “The prize is in blue”; blue says “The prize is not in green”. Exactly two labels are true. Where is the prize?
Hint 1
Use the three possible prize locations as rows.
Hint 2
The truth patterns for red and green locations each contain only one T.
Complete solution
If the prize is in red, the labels have truth pattern F, F, T, so only one is true. If it is in green, the pattern is T, F, F, again one true. If it is in blue, the pattern is F, T, T, exactly two true. Therefore the prize is in the blue box. All three allowed locations have been tested; only blue satisfies the specified count.
Transfer 4. Three number tests
An integer n is chosen from 1 through 15. Exactly one of these is true: “n is divisible by 3”; “n is greater than 10”; “n is odd”. Find every possible n.
Hint 1
Split the range at 10 because the second statement changes there.
Hint 2
For 11 through 15, the other two tests must both be false. Below 11, require exactly one of divisibility by 3 and oddness.
Complete solution
For 1 through 10, “greater than 10” is false. Among odd numbers 1, 3, 5, 7, 9, reject 3 and 9 because they are also multiples of 3; this leaves 1, 5, 7. Among even numbers, only 6 is divisible by 3, so 6 also works. For 11 through 15, the middle statement is true, so n must be even and not divisible by 3. The even candidates are 12 and 14; reject 12 and keep 14. The complete answer is 1, 5, 6, 7, 14. The two ranges cover all possibilities, and each survivor has exactly one true test.
Transfer 5. Which conclusion must follow?
All jade tokens are striped. Some striped tokens are large. Which of the following must follow: (i) a jade token exists; (ii) all jade tokens are large; (iii) some large tokens are striped? Justify the forced conclusion and give countermodels for the others.
Hint 1
Start with the witness guaranteed by “some striped tokens are large”.
Hint 2
To refute (i), use a large striped token that is not jade. To refute (ii), add a small jade striped token.
Complete solution
Only (iii) must follow. Choose the striped large token supplied by the second given statement; it is equally a large striped token, so it witnesses (iii). For (i), a collection of one large striped non-jade token satisfies both givens: there are no jade tokens violating the all-rule, but no jade token exists. For (ii), use two tokens: one small jade striped token and one large striped non-jade token. All jade tokens are striped and some striped tokens are large, yet the jade token is not large. Each countermodel satisfies every given statement, which is essential.
Transfer 6. A rule and its reversals
For a positive integer n, use the rule “if n is a multiple of 8, then n is even”. Which of these claims are always valid: (i) if n is odd, it is not a multiple of 8; (ii) if n is even, it is a multiple of 8; (iii) if n is not a multiple of 8, it is odd? Prove or disprove each.
Hint 1
Only one claim forbids exactly the same impossible case as the original rule.
Hint 2
Use n = 6 to test the two claims that try to deduce a multiple or oddness from insufficient information.
Complete solution
(i) is valid. If an odd n were a multiple of 8, the given rule would make it even, a contradiction. This proves the contrapositive. (ii) is false: n = 6 is even but is not a multiple of 8. (iii) is false: the same n = 6 is not a multiple of 8 but is even, not odd. These counterexamples obey the domain of positive integers. The original rule gives a necessary property of multiples of 8, not a complete description of all even numbers.
Extension 7. Three pair conditions
Each of three lamps A, B and C is either on or off. Exactly one of A and B is on; exactly one of B and C is on; exactly one of A and C is on. Prove that these conditions cannot all hold.
Hint 1
Consider the two possibilities for lamp B.
Hint 2
The first two conditions force A and C to have the same state.
Complete solution
If B is on, the first condition forces A off and the second forces C off. Then neither A nor C is on, contradicting the third condition. If B is off, the first condition forces A on and the second forces C on. Then both A and C are on, again contradicting the third condition. B has only the states on and off, so the cases are exhaustive. No arrangement satisfies all three conditions. Finding one failed arrangement would not be enough; this proof rules out every arrangement.
Extension 8. Why a truth count is impossible
P and Q are arbitrary true-or-false statements. The third statement R means “P and Q are both true”. Prove that exactly two of P, Q and R cannot be true.
Hint 1
Separate the case in which R is true from the case in which it is false.
Hint 2
If R is true, what does it say about P and Q? If R is false, can both P and Q be true?
Complete solution
If R is true, both P and Q are true by its definition, so the true count is 3, not 2. If R is false, P and Q cannot both be true, so at most one of them is true; including the false R still gives a count at most 1. These two cases cover every truth value of R. Thus exactly two is impossible. The possible counts 0, 1 and 3 all occur, respectively for P,Q equal to F,F; T,F; and T,T.
Extension 9. A witness through two rules
Each counter may carry more than one colour label. All red counters are blue. Some red counters are green. No green counter is large. Prove that some blue counter is not large. Does it follow that every blue counter is not large? Give a countermodel if not.
Hint 1
Choose the one red green counter whose existence is guaranteed.
Hint 2
Follow that same counter through the red-to-blue rule and the no-green-large rule. For the second question, an additional blue non-green counter may behave differently.
Complete solution
Choose a counter X that is red and green, which exists by the second statement. Since X is red, the first rule makes X blue. Since X is green and no green counter is large, X is not large. Hence some blue counter is not large, witnessed by X. It does not follow that every blue counter is not large. Take X red, green, blue and not large; add Y blue, not red, not green and large. All three given statements remain true, but Y disproves the universal conclusion. The colours here are labels that can overlap, as the givens require; red and blue are not assumed exclusive.
A short proof rubric
Use this self-check for a written explanation; it is not an automatic mark or an official contest marking scheme.
- Set-up: Have you identified the allowed cases, object or witness and the exact condition to prove?
- Reasoning: Does each truth value or deduction follow from the givens? Have you explained any relation between statements?
- Completeness: Have all cases been covered? For a “must” claim, does the argument work in every permitted arrangement? For a disproof, does your countermodel satisfy every given?
- Conclusion: Have you answered the actual question, including all solutions, uniqueness or inconsistency where relevant?
To improve a solution that simply says “obvious”, add the first missing link. For a truth-table answer, explain why the row list is complete. For a witness proof, name one object and carry it through each rule. For a counterexample, check the hypotheses before announcing that the conclusion fails.
Practise one decision at a time
Try the adaptive checks below after the first examples, and return to the linked explanation if feedback identifies a gap. The sequence chooses among easier and harder checks in this topic. The written proof problems above still need your own explanation; their proofs are not automatically graded.
A completed practice session means six responses, including any requested solutions. It does not mean six independently correct answers or mastery. Revisit a solution-assisted question later without opening the explanation. Use your existing privacy and local-progress choices; you do not need to submit a written proof or personal details.
Interactive practice loads here. You can also use the complete question set below.
Explain before you leave
Without reopening the theory, explain the difference between “at least one” and “exactly one”; say why an implication cannot usually be reversed; and describe what a “some” statement lets you choose. Then redo one written problem that required a hint. Record for yourself whether the second attempt was independent or solution-assisted.
Return to Sri Lanka’s study and paper route · Repair mathematical language · Choose another lesson
Preparation sources and original material
See the organiser’s 2026 Sri Lanka Mathematical Olympiad route and the official SLMC past-paper archive for released papers. The topic calibration uses the organiser’s released 2019 SLMC 8 questions 21 and 23; open the official 2019 SLMC 8 paper. Older paper rules are not presented as current rules.
All teaching text, tables, examples and practice problems on this page are original IMOolympiad.com learning material. We link official papers for reference rather than reproduce or translate their questions. This independent educational website is not an official organiser and does not claim endorsement. Preparation context checked 27 October 2026.