This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

Mexican Quarantine Mathematical Olympiad, #6
Oriol has a finite collection of cards, each one with a positive integer written on it. We say the collection is $n$-[i]complete[/i] if for any integer $k$ from $1$ to $n$ (inclusive), he can choose some cards such that the sum of the numbers on them is exactly $k$. Suppose that Oriol's collection is $n$-complete, but it stops being $n$-complete if any card is removed from it. What is the maximum possible sum of the numbers on all the cards? [i]Proposed by Ariel García[/i]
multiset cards combinatorics number theory