Maths Olympiad Prep

Library / /128 of 168

Combinatorics Difficulty 2.3 Junior Find the answer

Each of the following 15 cards has a letter on one side and a positive integer on the other side. What is the minimum number of cards that need to be turned over to check if the following statement is true? 'If a card has a lower case letter on one side, then it has an odd integer on the other side.'

A number or a short expression. Spacing and $ signs are ignored.

Solution

Each card fits into exactly one of the following categories: (A) lower case letter on one side, even integer on the other side (B) lower case letter on one side, odd integer on the other side (C) upper case letter on one side, even integer on the other side (D) upper case letter on one side, odd integer on the other side. The given statement is 'If a card has a lower case letter on one side, then it has an odd integer on the other.' If a card fits into category (B), (C) or (D), it does not violate the given statement, and so the given statement is true. If a card fits into category (A), it does violate the given statement. Therefore, we need to turn over any card that might be in category (A). Of the given cards, (i) 1 card shows a lower case letter and might be in (A), (ii) 4 cards show an upper case letter and is not in (A), (iii) 2 cards show an even integer and might be in (A), and (iv) 8 cards show an odd integer and is not in (A). In order to check if this statement is true, we must turn over the cards in (i) and (iii), of which there are 3.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.