Brandon wants to split his orchestra of $20$ violins, $15$ violas, $10$ cellos, and $5$ basses into three distinguishable groups, where all of the players of each instrument are indistinguishable. He wants each group to have at least one of each instrument and for each group to have more violins than violas, more violas than cellos, and more cellos than basses. How many ways are there for Brandon to split his orchestra following these conditions?

Consider a grid of black and white squares with $3$ rows and $n$ columns. If there is a non-empty sequence of white squares $s_1$, $...$, $s_m$ such that $s_1$ is in the top row and $s_m$ is in the bottom row and consecutive squares in the sequence share an edge, then we say that the grid percolates. Let $T_n$ be the number of grids which do not percolate. There exists constants a, b such that $\frac{T_n}{ab^n}$ approaches $ 1$ as $n$ approaches $\infty$. Then $b$ is expressible as $(x+ \sqrt{y})/z$ for squarefree $y$ and coprime $x, z$. Find $x + y + z$.

Let $n$ be a natural number and $L = Z^2$ the set of points on the plane with integer coordinates. Every point in $L$ is colored now in one of the colors red or green. Show that there are $n$ different points $x_1,...,x_n \in L$ all of which have the same color and whose center of gravity is also in $L$ and is of the same color.

Zeros and ones are placed in each square of a rectangular board. Such a board is said to be [i]varied[/i] if each row contains at least one $0$ and at least two $1$s. Given n$\geq 3,$ find all integers $k>1$ with the following property: The columns of each varied board of $k$ rows and n columns can be permuted so that in each row of the new board the $1$s do not form a block (that is, there are at least two $1$s that are separated by one or more $0$s).

We have tiles (which are build from squares of side length 1) of following shapes: [asy] unitsize(0.5 cm); draw((1,0)--(2,0)); draw((1,1)--(2,1)); draw((1,0)--(1,1)); draw((2,0)--(2,1)); draw((0,1)--(1,1)); draw((0,2)--(1,2)); draw((0,1)--(0,2)); draw((1,1)--(1,2)); draw((0, 0)--(1, 0)); draw((0, 0)--(0, 1)); draw((5,0)--(6,0)); draw((5,1)--(6,1)); draw((5,0)--(5,1)); draw((6,0)--(6,1)); draw((4,1)--(5,1)); draw((5,2)--(6,2)); draw((5,1)--(5,2)); draw((6,1)--(6,2)); draw((4, 0)--(5, 0)); draw((4, 0)--(4, 1)); draw((6,2)--(7,2)); draw((7,1)--(7,2)); draw((6,1)--(7,1)); draw((11,0)--(12,0)); draw((11,1)--(12,1)); draw((11,0)--(11,1)); draw((12,0)--(12,1)); draw((10,1)--(11,1)); draw((10,2)--(11,2)); draw((10,1)--(10,2)); draw((11,1)--(11,2)); draw((10, 0)--(11, 0)); draw((10, 0)--(10, 1)); draw((9, 2)--(9, 1)); draw((9,1)--(10, 1)); draw((9,2)--(10,2)); [/asy] For each odd integer $n \ge 7$, determine minimal number of these tiles needed to arrange square with side of length $n$. (Attention: Tiles can be rotated, but they can't overlap.)

In how many ways can we construct a square with dimensions $4\times 4$ using $4$ white, $4$ green , $4$ red and 4 $blue$ squares of dimensions $1\times 1$, such that in every horizontal and in every certical line, squares have different colours .

In a rectangular array of nonnegative reals with $m$ rows and $n$ columns, each row and each column contains at least one positive element. Moreover, if a row and a column intersect in a positive element, then the sums of their elements are the same. Prove that $m=n$.

There are $ n \geq 5$ pairwise different points in the plane. For every point, there are just four points whose distance from which is $ 1$. Find the maximum value of $ n$.

[b]Problem 6.[/b] Let $p>2$ be prime. Find the number of the subsets $B$ of the set $A=\{1,2,\ldots,p-1\}$ such that, the sum of the elements of $B$ is divisible by $p.$ [i] Ivan Landgev[/i]

In each square of an $n\times{n}$ grid there is a lamp. If the lamp is touched it changes its state every lamp in the same row and every lamp in the same column (the one that are on are turned off and viceversa). At the begin, all the lamps are off. Show that lways is possible, with an appropriated sequence of touches, that all the the lamps on the board end on and find, in function of $n$ the minimal number of touches that are necessary to turn on every lamp.

On an infinite white checkered sheet, a square $Q$ of size $12$ × $12$ is selected. Petya wants to paint some (not necessarily all!) cells of the square with seven colors of the rainbow (each cell is just one color) so that no two of the $288$ three-cell rectangles whose centers lie in $Q$ are the same color. Will he succeed in doing this? (Two three-celled rectangles are painted the same if one of them can be moved and possibly rotated so that each cell of it is overlaid on the cell of the second rectangle having the same color.) (Bogdanov. I)

Find the smallest constant $c$ such that for every $4$ points in a unit square there are two a distance $\leq c$ apart.

Two players, \(A\) (first player) and \(B\), take alternate turns in playing a game using 2016 chips as follows: [i]the player whose turn it is, must remove \(s\) chips from the remaining pile of chips, where \(s \in \{ 2,4,5 \}\)[/i]. No one can skip a turn. The player who at some point is unable to make a move (cannot remove chips from the pile) loses the game. Who among the two players can force a win on this game?

Joao had blue, white and red pearls and with them he made a necklace with $20$ pearls that has as many blue as white pearls. João noticed that, regardless of how he cut the necklace into two parts, both with an even number of pearls, one of the parts would always have more blue pearls than white ones. How many red pearls are in Joao's necklace?

A marker is placed at the origin of an integer lattice. Calvin and Hobbes play the following game. Calvin starts the game and each of them takes turns alternatively. At each turn, one can choose two (not necessarily distinct) integers $a, b$, neither of which was chosen earlier by any player and move the marker by $a$ units in the horizontal direction and $b$ units in the vertical direction. Hobbes wins if the marker is back at the origin any time after the first turn. Prove or disprove that Calvin can prevent Hobbes from winning. Note: A move in the horizontal direction by a positive quantity will be towards the right, and by a negative quantity will be towards the left (and similar directions in the vertical case as well).

Given a sequence $1,1,2,2,3,3,\ldots,1986,1986$, determine, with proof, if we can rearrange the sequence so that for any integer $1\le k \le 1986$ there are exactly $k$ numbers between the two “$k$”s.

Let $M\subset \Bbb{N}^*$ such that $|M|=2004.$ If no element of $M$ is equal to the sum of any two elements of $M,$ find the least value that the greatest element of $M$ can take.

Let $n>1$ be an integer and $S_n$ the set of all permutations $\pi : \{1,2,\cdots,n \} \to \{1,2,\cdots,n \}$ where $\pi$ is bijective function. For every permutation $\pi \in S_n$ we define: \[ F(\pi)= \sum_{k=1}^n |k-\pi(k)| \ \ \text{and} \ \ M_{n}=\frac{1}{n!}\sum_{\pi \in S_n} F(\pi) \] where $M_n$ is taken with all permutations $\pi \in S_n$. Calculate the sum $M_n$.

A sequence $a_1,\ldots,a_n$ of positive integers is given. For each $l$ from $1$ to $n-1$ the array $(gcd(a_1,a_{1+l}),\ldots,gcd(a_n,a_{n+l}))$ is considered, where indices are taken modulo $n$. It turned out that all this arrays consist of the same $n$ pairwise distinct numbers and differ only,possibly, by their order. Can $n$ be a) $21$ b) $2021$

An L-shape is one of the following four pieces, each consisting of three unit squares: [asy] size(300); defaultpen(linewidth(0.8)); path P=(1,2)--(0,2)--origin--(1,0)--(1,2)--(2,2)--(2,1)--(0,1); draw(P); draw(shift((2.7,0))*rotate(90,(1,1))*P); draw(shift((5.4,0))*rotate(180,(1,1))*P); draw(shift((8.1,0))*rotate(270,(1,1))*P); [/asy] A $5\times 5$ board, consisting of $25$ unit squares, a positive integer $k\leq 25$ and an unlimited supply of L-shapes are given. Two players A and B, play the following game: starting with A they play alternatively mark a previously unmarked unit square until they marked a total of $k$ unit squares. We say that a placement of L-shapes on unmarked unit squares is called $\textit{good}$ if the L-shapes do not overlap and each of them covers exactly three unmarked unit squares of the board. B wins if every $\textit{good}$ placement of L-shapes leaves uncovered at least three unmarked unit squares. Determine the minimum value of $k$ for which B has a winning strategy.

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Each square of an $n \times n$ grid is coloured either blue or red, where $n$ is a positive integer. There are $k$ blue cells in the grid. Pat adds the sum of the squares of the numbers of blue cells in each row to the sum of the squares of the numbers of blue cells in each column to form $S_B$. He then performs the same calculation on the red cells to compute $S_R$. If $S_B- S_R = 50$, determine (with proof) all possible values of $k$.

p1. One day, a researcher placed two groups of species that were different, namely amoeba and bacteria in the same medium, each in a certain amount (in unit cells). The researcher observed that on the next day, which is the second day, it turns out that every cell species divide into two cells. On the same day every cell amoeba prey on exactly one bacterial cell. The next observation carried out every day shows the same pattern, that is, each cell species divides into two cells and then each cell amoeba prey on exactly one bacterial cell. Observation on day $100$ shows that after each species divides and then each amoeba cell preys on exactly one bacterial cell, it turns out kill bacteria. Determine the ratio of the number of amoeba to the number of bacteria on the first day. p2. It is known that $n$ is a positive integer. Let $f(n)=\frac{4n+\sqrt{4n^2-1}}{\sqrt{2n+1}+\sqrt{2n-1}}$. Find $f(13) + f(14) + f(15) + ...+ f(112).$ p3. Budi arranges fourteen balls, each with a radius of $10$ cm. The first nine balls are placed on the table so that form a square and touch each other. The next four balls placed on top of the first nine balls so that they touch each other. The fourteenth ball is placed on top of the four balls, so that it touches the four balls. If Bambang has fifty five balls each also has a radius of $10$ cm and all the balls are arranged following the pattern of the arrangement of the balls made by Budi, calculate the height of the center of the topmost ball is measured from the table surface in the arrangement of the balls done by Bambang. p4. Given a triangle $ABC$ whose sides are $5$ cm, $ 8$ cm, and $\sqrt{41}$ cm. Find the maximum possible area of ​​the rectangle can be made in the triangle $ABC$. p5. There are $12$ people waiting in line to buy tickets to a show with the price of one ticket is $5,000.00$ Rp.. Known $5$ of them they only have $10,000$ Rp. in banknotes and the rest is only has a banknote of $5,000.00$ Rp. If the ticket seller initially only has $5,000.00$ Rp., what is the probability that the ticket seller have enough change to serve everyone according to their order in the queue?

A box contains 900 cards numbered from 100 to 999. Cards are drawn randomly, one at a time, without replacement, and the sum of their digits is recorded. What is the minimum number of cards that must be drawn to guarantee that at least three of these sums are the same?

There are $27$ boxes located in a row; each contains at least $12$ marbles. The allowed operation is transfer a ball from a box to its neighbor on the right, as long as said neighbor contains more pellets than the box from which the transfer will be made. We will say that a distribution initial of the balls is [i]happy [/i] if it is possible to achieve, by means of a succession of permitted operations, that all the balls are in the same box. Determine what is the smallest total number of marbles with the that you can have a happy initial layout.