26 cards with 1 number each , two of 1-13
Source: XV May Olympiad (Olimpiada de Mayo) 2009 L1 P3
September 22, 2022
combinatorics
Problem Statement
There are cards and each one has a number written on it. There are two with , two with , two with , and so on up to two with and two with . You have to distribute the cards in piles so that the following two conditions are met:
If two cards have the same number they are in the same pile.
No pile contains a card whose number is equal to the sum of the numbers of two cards in that same pile.
Determine what is the minimum number of stacks to make. Give an example with the distribution of the cards for that number of stacks and justify why it is impossible to have fewer stacks.Clarification: Two squares are neighbors if they have a common side.