Hosted by The Math Forum
Problem of the Week 1202
Find a 3×3 array of distinct positive integers so that:
The idea is to minimize the sum of the nine entries. Here a "triangle" is a
Unsolved problem: Same thing, but with "perimeter" replaced by "area." For this, consider only the rows and columns (not the diagonals; such is called a "semi-magic square"). Further, allow the entries to be any real numbers, but still aim for distinct entries (or possibly the weaker condition, that the triangles be distinct).
Source: Lee Sallows, Nijmegen, The Netherlands.