A three by three square is filled with positive integers. Each row contains three different integers, the sums of each row are all the same, and the products of each row are all different. What is the smallest possible value for the sum of each row?
Source: New Zealand NZMOC Camp Selection Problems 2011 Juniors 1
Tags: combinatorics
A three by three square is filled with positive integers. Each row contains three different integers, the sums of each row are all the same, and the products of each row are all different. What is the smallest possible value for the sum of each row?