MathDB

O 23

Source:

May 25, 2007

induction

Problem Statement

Let

k, m, n

be integers such that

1<n\le m-1 \le k

. Determine the maximum size of a subset

S

of the set

\{ 1,2, \cdots, k \}

such that no

n

distinct elements of

S

add up to

m

.