You are requested to partition the set of 10 digits (0,1,…,9) into a maximal number of subsets, such that in each set it is possible to create a prime number
using all its members.
What is the highest prime thus created?
(In reply to Lucky 7
by Steve Herman)
Although not anticipated by me it certainly qualfies as a valid solution, since the text did nor preclude use of math. symbols.
Whether this is the maximal prime under the broad definition is hard to say, may be the last two sets are :
8/4 and 60!-1 or 8-1 and 64!-0! or 6-1 and 48!!!!-0! or similar
iff any of the bolded numbers happens to be prime (Charlie might find one, but without proving that no bigger example exists.)
So - since the restricted version leads to a unique solution, let stick to it. I should have specify what is meant by "create a prime".