Enigmatics |
|
Posted on: Tuesday 11/27, 2007; 8:35 PM Because this problem is so easy to solve I don't bother to make use of symmetry to simplify the search for a solution. Generate a list of permutations of the digits 1, 2, ..., 9. Arrange each of these sets of 9 digits into a 3 by 3 array and generate the corresponding 12 3-digit numbers by reading rows and columns both forwards and backwards. Select the cases which satisfy the required divisibility conditions. Extract the minimum and maximum 3-digit numbers from these (symmetrically related) results. |
Blogged from |
||||
