It is desired to choose n integers from the collection of 2n integers, namely, 0,0,1,1,2,2,…,n−1,n−1 such that the average of these n chosen integers is itself an integer and as minimum as possible. Show that this can be done for each positive integer n and find this minimum value for each n. number theory unsolvednumber theory