The letters A-H are different digits from 1 to 9.
Read from left to right and top down, the four numbers formed are primes.
There is not just one solution. (Flipping along the diagonal A-H does not present a different solution).
Suppose "0" is allowed, and A cannot have that value, what other unique solutions are available?
(In reply to
re(2): part 1 computer solution by brianjn)
The "essence" of the comment was simply that it was unnecessary to code to test for the additonal two 3-digit primes when including the middle square as the number of distinct ending digits of primes is four (1, 3, 7, 9). I admire Charlie's ability to solve these problems with his coding, yet sometimes one can apply simple logic to solve the problem more readily. Of course, to provide the large list of solutions is indeed better left to the coding. For this I say "Well done, Charlie!".
|
|
Posted by Dej Mar
on 2009-07-12 15:26:16 |
re(3): part 1 computer solution
