\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!
\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!
Let be such a set. We give for some digits all one- and two-digit prime numbers in which they are contained as a digit:
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: . Then the 5 must occur in a two-digit prime number.
Case 1.1: . Then must also be true, otherwise the digit 8 would not occur.
Case 1.1.1: . Then, to cover the digit 4, must also be true. We get .
Case 1.1.2: . Then, to cover the digit 4, must also be true, so we get .
Case 1.2: . Then, to cover the 8, must also be true.
Case 1.2.1: . To cover the 4, must also be true.
We get .
Case 1.2.2: . To cover the 4, must also be true, so follows.
Case 2: . Then, to cover the digit 8, must also be true. It follows that the 5 can only stand alone, so . To cover the digits 4 and 6, there are now again two possibilities, so we get the two sets and .
Case 3: . Then, analogous to the second case, and follow. Again, the same two possibilities arise to cover the digits 4 and 6, so we finally get the two sets and .
The case distinction is complete, so there are exactly these eight sets that satisfy the problem statement.