Školjka

%V0 There are $10001$ students at an university. Some students join together to form several clubs (a student may belong to different clubs). Some clubs join together to form several societies (a club may belong to different societies). There are a total of $k$ societies. Suppose that the following conditions hold: i.) Each pair of students are in exactly one club. ii.) For each student and each society, the student is in exactly one club of the society. iii.) Each club has an odd number of students. In addition, a club with ${2m+1}$ students ($m$ is a positive integer) is in exactly $m$ societies. Find all possible values of $k$. RemarkIn IMOTC 2005, it is given that $m=2005$.

%V0 This ISL 2005 problem has not been used in any TST I know. A pity, since it is a nice problem, but in its shortlist formulation, it is absolutely incomprehensible. Here is a mathematical restatement of the problem: Let $k$ be a nonnegative integer. A forest consists of rooted (i. e. oriented) trees. Each vertex of the forest is either a leaf or has two successors. A vertex $v$ is called an extended successor of a vertex $u$ if there is a chain of vertices $u_{0}=u$, $u_{1}$, $u_{2}$, ..., $u_{t-1}$, $u_{t}=v$ with $t>0$ such that the vertex $u_{i+1}$ is a successor of the vertex $u_{i}$ for every integer $i$ with $0\leq i\leq t-1$. A vertex is called dynastic if it has two successors and each of these successors has at least $k$ extended successors. Prove that if the forest has $n$ vertices, then there are at most $\frac{n}{k+2}$ dynastic vertices.

%V0 Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which $$k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.$$ Find the number of elements of the set $A_n.$

%V0 Consider $2009$ cards, each having one gold side and one black side, lying on parallel on a long table. Initially all cards show their gold sides. Two player, standing by the same long side of the table, play a game with alternating moves. Each move consists of choosing a block of $50$ consecutive cards, the leftmost of which is showing gold, and turning them all over, so those which showed gold now show black and vice versa. The last player who can make a legal move wins. (a) Does the game necessarily end? (b) Does there exist a winning strategy for the starting player? Proposed by Michael Albert, Richard Guy, New Zealand

%V0 Dano je $n+1$ prirodnih brojeva čiji je zbroj $3n$ i oni su poredani u krug. Dokaži da postoji nekoliko uzastopnih brojeva (moguće i samo $1$) čiji je zbroj jednak točno $2n$ .

%V0 Let $n \geq 3$ be an integer. At a MEMO-like competition, there are $3n$ participants, there are n languages spoken, and each participant speaks exactly three different languages. Prove that at least $\left\lceil\frac{2n}{9}\right\rceil$ of the spoken languages can be chosen in such a way that no participant speaks more than two of the chosen languages. Note. $\lceil x\rceil$ is the smallest integer which is greater than or equal to $x$.