Find nine 11-digit pandigital prime numbers P<Q<R<S<T<U<V<W<X that can be written in a column so that each of the first 10 columns of digits has 9 distinct digits.
Find the set with smallest X.
Running the experiment a bit further:
There are 9 million (9,069,536) solutions
that have the same first three lines as the one listed
in the first post.
The next set (again with millions of examples) have the
same first two lines and then a different 3rd line
and lines beyond. This is the first:
90112354687 1
81021436759 90784
72234068519 152076
64340785129 342453
53405127869 306236
45673871209 441731
36587210497 371614
27869543071 663421
18756902347 629225
Again, this is from the small domain where
the digits 2-5 in rows 1-5 are small: 0-5
and are shown here underlined.
I suspect there are many millions more solutions with this
minimum X
Finding these above took several hours of CPU time
Edited on December 10, 2023, 4:51 am
many solutions
