¿ìè¶ÌÊÓƵ

Trisquare

I invite you to place a digit in each of the nine spaces in a 3 × 3 array so that each digit occurs its own number of times (e.g. if 3 occurs it must occur exactly three times). You can then read eight numbers: three across, three down, and two diagonals read from the top down.

What will be the sum of all the digits used if all these numbers are different and the sum cannot be written using digits from the square?

WIN £15 will be awarded to the sender of the first correct answer opened on Monday 29 March. The Editor’s decision is final. Please send entries to Enigma 1584, ¿ìè¶ÌÊÓƵ, Lacon House, 84 Theobald’s Road, London WC1X 8NS, or to enigma@newscientist.com (please include your postal address).

Answer to 1578 About turn: 20 counters is the smallest number possible

The winner Richard Brookfield of Worcester, UK