Let the numbers 1,2,…,n2 be written in the cells of an n×n square board so that the entries in each column are arranged increasingly. What are the smallest and greatest possible sums of the numbers in the kth row? (k a positive integer, 1≤k≤n.) combinatorics proposedcombinatorics