First, list the single-digit prime numbers. Prime numbers are greater than 1 and have only two divisors: 1 and themselves. The single-digit primes are:
There are 4 distinct single-digit prime numbers available.
We need to form 3-digit numbers using three distinct digits from the set {2, 3, 5, 7}. Since the digits must be distinct and cannot include 0 (as 0 is not a prime digit), the order of the digits matters, and we are essentially finding the number of permutations.
We need to choose and arrange 3 digits out of the 4 available prime digits. This can be calculated using the permutation formula:
$ P(n, k) = \frac{n!}{(n-k)!} $
Where:
Substituting the values:
$ P(4, 3) = \frac{4!}{(4-3)!} = \frac{4!}{1!} $
Calculate the factorial:
$ 4! = 4 \times 3 \times 2 \times 1 = 24 $
$ 1! = 1 $
Therefore:
$ P(4, 3) = \frac{24}{1} = 24 $
Alternatively, consider the positions:
Total number of 3-digit numbers = $4 \times 3 \times 2 = 24$.
Thus, there are 24 possible 3-digit numbers that can be formed using three distinct single-digit prime numbers.
How many words can be formed with the letters of the word 'POSTMAN', if every word begins with T and ends with M?
In how many ways can cells in a $3 \times 3$ grid be shaded, such that each row and each column have exactly one shaded cell? An example of one valid shading is shown.
