MathDB
Permutations of 1,2,..,k in the rows of an array

Source: Kürschak 2009, problem 1

July 8, 2014
combinatorics unsolvedcombinatorics

Problem Statement

Let n,kn,k be arbitrary positive integers. We fill the entries of an n×kn\times k array with integers such that all the nn rows contain the integers 1,2,…,k1,2,\dots,k in some order. Add up the numbers in all kk columns – let SS be the largest of these sums. What is the minimal value of SS?
Back to ProblemsView on AoPS