The following matrix problem occurred to me. I figured out the answer and would like to pose the problem. It's easy but would be best for an undergrad math major. The question: Consider a square n by n matrix with entries 1, 2, ..., n squared. Find a way to arrange these entries so that the absolute value of the determinate of this matrix is a minimum.