**From New Scientist #2224, 5th February 2000** [link]

Harry, Tom and I were trying to find a 3-digit perfect square, a 3-digit triangular number and a 3-digit Fibonacci number that between them used nine different digits. (Triangular numbers are those that fit the formula n(n+1)/2; in the Fibonacci sequence the first two terms are 1 and 1, and every succeeding term is the sum of the previous two terms). We each found a valid solution and we each created a second valid solution by retaining two of the numbers of our first solution but changing the other one. Our six solutions were all different.

List in ascending order the numbers in the solution that none of us found.

[enigma1068]

### Like this:

Like Loading...

(See also:

Enigma 1153).This Python program runs in 81ms.

Run:[ @repl.it ]Solution:The set of numbers that was not found was: 378, 529, 610.Multiple output configuration in MiniZinc found the seven sets of numbers, one of which could be identified as the required solution – although not a rigorous programme solution.