Let $p_n(k)$ be the number of permutations of the set $\{1,2,3,\ldots,n\}$ which have exactly $k$ fixed points. Prove that $\sum_{k=0}^nk p_n(k)=n!$.[i](IMO Problem 1)[/i] [b][i]Original formulation [/i][/b] Let $S$ be a set of $n$ elements. We denote the number of all permutations of $S$ that have exactly $k$ fixed points by $p_n(k).$ Prove: (a) $\sum_{k=0}^{n} kp_n(k)=n! \ ;$ (b) $\sum_{k=0}^{n} (k-1)^2 p_n(k) =n! $ [i]Proposed by Germany, FR[/i]

Let $ S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\}$ be a $ (k \plus{} l)$-element set of real numbers contained in the interval $ [0, 1]$; $ k$ and $ l$ are positive integers. A $ k$-element subset $ A\subset S$ is called [i]nice[/i] if \[ \left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}\] Prove that the number of nice subsets is at least $ \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}$. [i]Proposed by Andrey Badzyan, Russia[/i]

A very well known family of mathematicians has three children called [i]Antonia, Bernhard[/i] and [i]Christian[/i]. Each evening one of the children has to do the dishes. One day, their dad decided to construct of plan that says which child has to do the dishes at which day for the following $55$ days. Let $x$ be the number of possible such plans in which Antonia has to do the dishes on three consecutive days at least once. Furthermore, let $y$ be the number of such plans in which there are three consecutive days in which Antonia does the dishes on the first, Bernhard on the second and Christian on the third day. Determine, whether $x$ and $y$ are different and if so, then decide which of those is larger.

Let $N$ be the number of integral solutions of the equation \[x^2 - y^2 = z^3 - t^3\] satisfying the condition $0 \leq x, y, z, t \leq 10^6$, and let $M$ be the number of integral solutions of the equation \[x^2 - y^2 = z^3 - t^3 + 1\] satisfying the condition $0 \leq x, y, z, t \leq 10^6$. Prove that $N >M.$

Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that: [b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color, and [b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$. [i]Author: Gerhard Wöginger, Netherlands[/i]

How many ordered pairs of integers $(m,n)$ are there such that $m$ and $n$ are the legs of a right triangle with an area equal to a prime number not exceeding $80$?

Three boxes contain 600 balls each. The first box contains 600 identical red balls, the second box contains 600 identical white balls and the third box contains 600 identical blue balls. From these three boxes, 900 balls are chosen. In how many ways can the balls be chosen? For example, one can choose 250 red balls, 187 white balls and 463 balls, or one can choose 360 red balls and 540 blue balls.

2500 chess kings have to be placed on a $100 \times 100$ chessboard so that [b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex); [b](ii)[/b] each row and each column contains exactly 25 kings. Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) [i]Proposed by Sergei Berlov, Russia[/i]

The number of functions $g:\mathbb{R}^4\to\mathbb{R}$ such that, $\forall a,b,c,d,e,f\in\mathbb{R}$ : (i) $g(1,0,0,1)=1$ (ii) $g(ea,b,ec,d)=eg(a,b,c,d)$ (iii) $g(a+e, b, c+f, d)= g(a,b,c,d)+g(e,b,f,d)$ (iv) $g(a,b,c,d)+g(b,a,d,c)=0$ is : (A)$1$ (B)$0$ (C)$\text{infinitely many}$ (D)$\text{None of these}$ [Hide=Hint(given in question)] Think of matrices[/hide]

Consider all segments dividing the area of a triangle $ABC$ in two equal parts. Find the length of the shortest segment among them, if the side lengths $a,$ $b,$ $c$ of triangle $ABC$ are given. How many of these shortest segments exist ?

Denote $U$ as the set of $20$ diagonals of the regular polygon $P_1P_2P_3P_4P_5P_6P_7P_8$. Find the number of sets $S$ which satisfies the following conditions. 1. $S$ is a subset of $U$. 2. If $P_iP_j \in S$ and $P_j P_k \in S$, and $i \neq k$, $P_iP_k \in S$.

For a positive integer $n$, denote $p(n)$ to be the number of nonnegative integer tuples $(x,y,z,w)$ such that $x+y+2z+3w=n-1$. Also, denote $q(n)$ to be the number of nonnegative integer tuples $(a,b,c,d)$ such that (i). $a+b+c+d=n$. (ii). $a \ge b$, $c \ge d$, $a \ge d$. (iii). $b < c$. Prove that for all $n$, $p(n) = q(n)$.

What is the maximal number of regions a circle can be divided in by segments joining $n$ points on the boundary of the circle ? [i]Posted already on the board I think...[/i]

From a bag containing 5 pairs of socks, each pair a different color, a random sample of 4 single socks is drawn. Any complete pairs in the sample are discarded and replaced by a new pair draw from the bag. The process continues until the bag is empty or there are 4 socks of different colors held outside the bag. What is the probability of the latter alternative?

What is the sum of all two-digit positive integer $n<50$ for which the sum of the squares of first $n$ positive integers is not a divisor of $(2n)!$ ?

There are $2^{10}=1024$ possible 10-letter strings in which each letter is either an A or a B. Find the number of such strings that do not have more than 3 adjacent letters that are identical.

Robert has 4 indistinguishable gold coins and 4 indistinguishable silver coins. Each coin has an engraving of one face on one side, but not on the other. He wants to stack the eight coins on a table into a single stack so that no two adjacent coins are face to face. Find the number of possible distinguishable arrangements of the 8 coins.

Fifteen freshmen are sitting in a circle around a table, but the course assistant (who remains standing) has made only six copies of today’s handout. No freshman should get more than one handout, and any freshman who does not get one should be able to read a neighbor’s. If the freshmen are distinguishable but the handouts are not, how many ways are there to distribute the six handouts subject to the above conditions?

Consider all segments dividing the area of a triangle $ABC$ in two equal parts. Find the length of the shortest segment among them, if the side lengths $a,$ $b,$ $c$ of triangle $ABC$ are given. How many of these shortest segments exist ?

An auditorium has two rows of seats, with $50$ seats in each row. $100$ indistinguishable people sit in the seats one at a time, subject to the condition that each person, except for the first person to sit in each row, must sit to the left or right of an occupied seat, and no two people can sit in the same seat. In how many ways can this process occur?

In some foreign country's government, there are 12 ministers. Each minister has 5 friends and 6 enemies in the government (friendship/enemyship is a symmetric relation). A triplet of ministers is called [b]uniform[/b] if all three of them are friends with each other, or all three of them are enemies. How many uniform triplets are there?

A rectangle is partitioned into 5 regions as shown. Each region is to be painted a solid color - red, orange, yellow, blue, or green - so that regions that touch are painted different colors, and colors can be used more than once. How many different colorings are possible? [asy] size(5.5cm); draw((0,0)--(0,2)--(2,2)--(2,0)--cycle); draw((2,0)--(8,0)--(8,2)--(2,2)--cycle); draw((8,0)--(12,0)--(12,2)--(8,2)--cycle); draw((0,2)--(6,2)--(6,4)--(0,4)--cycle); draw((6,2)--(12,2)--(12,4)--(6,4)--cycle); [/asy] $\textbf{(A) }120\qquad\textbf{(B) }270\qquad\textbf{(C) }360\qquad\textbf{(D) }540\qquad\textbf{(E) }720$

Let $ a_1 \geq a_2 \geq a_3 \in \mathbb{Z}^\plus{}$ be given and let N$ (a_1, a_2, a_3)$ be the number of solutions $ (x_1, x_2, x_3)$ of the equation \[ \sum^3_{k\equal{}1} \frac{a_k}{x_k} \equal{} 1.\] where $ x_1, x_2,$ and $ x_3$ are positive integers. Prove that \[ N(a_1, a_2, a_3) \leq 6 a_1 a_2 (3 \plus{} ln(2 a_1)).\]

A box contains $28$ red balls, $20$ green balls, $19$ yellow balls, $13$ blue balls, $11$ white balls, and $9$ black balls. What is the minimum number of balls that must be drawn from the box without replacement to guarantee that at least $15$ balls of a single color will be drawn$?$ $\textbf{(A) } 75 \qquad\textbf{(B) } 76 \qquad\textbf{(C) } 79 \qquad\textbf{(D) } 84 \qquad\textbf{(E) } 91$

In the following illustration, starting from point X, we move one square along the segment until we arrive at point Y. Calculate the number of times a point has passed once and does not pass again, from X to Y. (However, starting point X is considered to have passed.)