Problem

Source: Serbian National Olympiad 2012, Problem 6

Tags: combinatorics, weights



We are given $n>1$ piles of coins. There are two different types of coins: real and fake coins; they all look alike, but coins of the same type have the same mass, while the coins from different types have different masses. Coins that belong to the same pile are of the same type. We know the mass of real coin. Find the minimal number of weightings on digital scale that we need in order to conclude: which piles consists of which type of coins and also the mass of fake coin. (We assume that every pile consists from infinite number of coins.)