Olympiad Maths Prep

Track / Stage 5 / 186 of 400 #786 of 2000

Problem 786

AIME late
Combinatorics Difficulty 5.5 Find the answer

\section*{Exercise 1 - 101041}

Form all sets of five one- or two-digit prime numbers such that in each of these sets, each of the digits 1 through 9 appears exactly once!

Official solution

Let MM be such a set. We give for some digits all one- and two-digit prime numbers in which they are contained as a digit:

2:2,23,294:41,43,475:5,53,596:61,678:83,89 2: \quad 2,23,29|4: \quad 41,43,47| 5: \quad 5,53,59|6: \quad 61,67| 8: \quad 83,89

Since the five prime numbers together should have 9 digits, there must be exactly one one-digit and the remaining four two-digit primes.

Case 1: 2M2 \in M. Then the 5 must occur in a two-digit prime number.

Case 1.1: 53M53 \in M. Then 89M89 \in M must also be true, otherwise the digit 8 would not occur.

Case 1.1.1: 61M61 \in M. Then, to cover the digit 4, 47M47 \in M must also be true. We get M1={2,53,89,61,47}M_{1}=\{2,53,89,61,47\}.

Case 1.1.2: 67M67 \in M. Then, to cover the digit 4, 41M41 \in M must also be true, so we get M2={2,53,89,67,41}M_{2}=\{2,53,89,67,41\}.

Case 1.2: 59M59 \in M. Then, to cover the 8, 83M83 \in M must also be true.

Case 1.2.1: 61M61 \in M. To cover the 4, 47M47 \in M must also be true.

We get M3={2,59,83,61,47}M_{3}=\{2,59,83,61,47\}.

Case 1.2.2: 67M67 \in M. To cover the 4, 41M41 \in M must also be true, so M4={2,59,83,67,41}M_{4}=\{2,59,83,67,41\} follows.

Case 2: 23M23 \in M. Then, to cover the digit 8, 89M89 \in M must also be true. It follows that the 5 can only stand alone, so 5M5 \in M. To cover the digits 4 and 6, there are now again two possibilities, so we get the two sets M5={23,89,5,61,47}M_{5}=\{23,89,5,61,47\} and M6={23,89,5,67,41}M_{6}=\{23,89,5,67,41\}.

Case 3: 29M29 \in M. Then, analogous to the second case, 83M83 \in M and 5M5 \in M follow. Again, the same two possibilities arise to cover the digits 4 and 6, so we finally get the two sets M7={29,83,5,61,47}M_{7}=\{29,83,5,61,47\} and M8={29,83,5,67,41}M_{8}=\{29,83,5,67,41\}.

The case distinction is complete, so there are exactly these eight sets that satisfy the problem statement.

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