Primes again!

Let \(S\) be a set of prime numbers such that every digit from \(1,2,3,4,5,6,7,8,9\) appear only once in the set.

Let \(T\) the sum of those primes in \(S\). What is the smallest possible \(T\)?

As an explicit example, we could have \(S=\{5,7,293,4861\}\) so \(T=5166\).

×

Problem Loading...

Note Loading...

Set Loading...