A discrete mathematics problem by Alejandro Castillo

Given a set AA has nn elements, namely {1,2,3,,n} \{1,2,3, \ldots , n \} . If you want to divide this set in 12 subsets (no empty) such that the sum of each subset of AA is the same, what is the smallest possible value of nn?

×

Problem Loading...

Note Loading...

Set Loading...