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 Hard 8 by tomarken)

8 sets ok, but if 6!-1 is prime  or (8!)!-1 is prime you get a higher result- so one cannot specify the  highest prime thus created.

Please read my previous post.

Posted by Ady TZIDON on 2014-05-16 12:15:42