We want to find the sum of a set of prime numbers such that the digits from 1 to 9 are used only once.
That sum is equal to 1,350.
First, the digits that are primes in our range can be used alone (but we can also use in a composition if we need to).
These are:
2, 3, 5, and 7.
So now we need to make primes with the other ones:
1, 4, 6, 8, and 9.
Because all primes different than 2 end with an odd number, we can make only one or two with the digits that we have left.
To use the 8 and the 1, we can write the prime number:
821 (this implies that we don't use the number 2 alone).
Then the digits that are left are:
4, 6, and 9.
We know that 467 is a prime number, then we can use the 7 and write that number.
Then we just have the 9 left.
knowing that 59 is a prime number, we can finally use all our digits.
Then our set will be:
{3, 59, 467, 821}
The sum of these numbers is:
3 + 59 + 467 + 821 = 1,350
If you want to learn more, you can read:
https://brainly.com/question/11211106
