A discrete mathematics problem by Alejandro Castillo

Discrete Mathematics Level 4

Given a set \(A\) has \(n\) elements, namely \( \{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 \(A\) is the same, what is the smallest possible value of \(n\)?

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, conceptual quizzes.

Our wiki is made for math and science

Master advanced concepts through explanations, examples, and problems from the community.

Used and loved by 4 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.