Several sets of prime numbers, such as \{7,83,421,659\}, use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?
Answer Choices
A. 193
B. 207
C. 225
D. 252
E. 477
Several sets of prime numbers, such as \{7,83,421,659\}, use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?
Answer Choices
A. 193
B. 207
C. 225
D. 252
E. 477