Enigma 1462
Posted on: Tuesday 11/27, 2007; 8:39 PM
List of all 3tuples of numbers of red, blue, and yellow cubes. The upper limit of each of these is constrained by the known number of digits of the cubes of these numbers in the red and yellow cases, and the square of the number in the blue case.
Select the cases where red volume is a 3digit number, and the blue area is a 2digit number, and the yellow volume is a 4digit number, and the first digit of the red volume is the same a the first digit of the blue area, and the the last digit of the blue area is the same as the last digit of the yellow volume.
Check the digits corresponding to the letters in "nil", "no", and "zero". Only the first case is admissable because it has all digits distinct for all these letters.
1. Choose the first case above which thus fixes the values of {n, i, l, o, z, e, r}. 2. Compute the volumes of the 3 coloured cubes. 3. Generate a list of permutations of these volumes, because which pile is which is unknown. 4. List all the possible alternative cases of {t,h,g}, i.e. permutations of one base case. 5. For each of these cases of {t,h,g} compute the total volume "nothing". 6. Generate a list of the numbers of cubes in each of the 3 piles, where the 3rd pile is the one with the unknown number.
For each member of the list of volumes (see step 3 above) and each possible total volume (see step 5 above) generate an equation for the number of cubes in the unknown pile, and label each equation with the colour of the unknown pile.
How many cubes are in the remaining pile and what is their colour? This is the only integer solution that can found to any of the above equations.
Permalink Notebook

Blogged from
A WorkLife FrameWork by
Scientific Arts 