Prove that for arbitary positive integer $ n\geq 4$, there exists a permutation of the subsets that contain at least two elements of the set $ G_{n} \equal{} \{1,2,3,\cdots,n\}$: $ P_{1},P_{2},\cdots,P_{2^n \minus{} n \minus{} 1}$ such that $ |P_{i}\cap P_{i \plus{} 1}| \equal{} 2,i \equal{} 1,2,\cdots,2^n \minus{} n \minus{} 2.$

At the end of the school year it became clear that for any arbitrarily chosen group of no less than 5 students, 80% of the marks “F” received by this group were given to no more than 20% of the students in the group. Prove that at least 3/4 of all “F” marks were given to the same student.

Let $ n$ and $ m$ be given positive integers. In one move, a chess piece called an $ (n,m)$-crocodile goes $ n$ squares horizontally or vertically and then goes $ m$ squares in a perpendicular direction. Prove that the squares of an infinite chessboard can be painted in black and white so that this chess piece always moves from a black square to a white one or vice-versa.

A salmon in a mountain river must overpass two waterfalls. In every minute, the probability of the salmon to overpass the first waterfall is $p > 0$, and the probability to overpass the second waterfall is $q > 0$. These two events are assumed to be independent. Compute the probability that the salmon did not overpass the first waterfall in $n$ minutes, assuming that it did not overpass both waterfalls in that time.

A circle is divided by $2019$ points into equal parts. Two players delete these points in turns. A player wins, if after his turn it is possible to draw a diameter of the circle such that there are no undeleted points on one side of it. Which player has a winning strategy?

Let $M$ be a finite set of real numbers with the following property: From three different elements of $M$ can always be chosen two whose sum is located in $M$. How many elements can $M$ have at most?

It was noted that during one day in a town, each person made at most one phone call. Prove that the people in the town can be divided into three groups such that no two persons in the same group talked by phone that day.

Alice and Bob are going to play a game called extra tricky double rock paper scissors (ETDRPS). In ETDRPS, each player simultaneously selects [i]two [/i] moves, one for his or her right hand, and one for his or her left hand. Whereas Alice can play rock, paper, or scissors, Bob is only allowed to play rock or scissors. After revealing their moves, the players compare right hands and left hands separately. Alice wins if she wins [i]strictly [/i] more hands than Bob. Otherwise, Bob wins. For example, if Alice and Bob were to both play rock with their right hands and scissors with their left hands, then both hands would be tied, so Bob would win the game. However, if Alice were to instead play rock with both hands, then Alice would win the left hand. The right hand would still be tied, so Alice would win the game. Assuming both players play optimally, compute the probability that Alice will win the game.

[b]p1.[/b] What is $\sqrt[2015]{2^01^5}$? [b]p2.[/b] What is the ratio of the area of square $ABCD$ to the area of square $ACEF$? [b]p3.[/b] $2015$ in binary is $11111011111$, which is a palindrome. What is the last year which also had this property? [b]p4.[/b] What is the next number in the following geometric series: $1020100$, $10303010$, $104060401$? [b]p5.[/b] A circle has radius $A$ and area $r$. If $A = r^2\pi$, then what is the diameter, $C$, of the circle? [b]p6.[/b] If $$O + N + E = 1$$ $$T + H + R + E + E = 3$$ $$N + I + N + E = 9$$ $$T + E + N = 10$$ $$T + H + I + R + T + E + E + N = 13$$ Then what is the value of $O$? [b]p7.[/b] By shifting the initial digit, which is $6$, of the positive integer $N$ to the end (for example, $65$ becomes $56$), we obtain a number equal to $\frac{N}{4}$ . What is the smallest such $N$? [b]p8.[/b] What is $\sqrt[3]{\frac{2015!(2013!)+2014!(2012!)}{2013!(2012!)}}$ ? [b]p9.[/b] How many permutations of the digits of $1234$ are divisible by $11$? [b]p10.[/b] If you choose $4$ cards from a normal $52$ card deck (with replacement), what is the probability that you will get exactly one of each suit (there are $4$ suits)? [b]p11.[/b] If $LMT$ is an equilateral triangle, and $MATH$ is a square, such that point $A$ is in the triangle, then what is $HL/AL$? [b]p12.[/b] If $$\begin{tabular}{cccccccc} & & & & & L & H & S\\ + & & & & H & I & G & H \\ + & & S & C & H & O & O & L \\ \hline = & & S & O & C & O & O & L \\ \end{tabular}$$ and $\{M, A, T,H, S, L,O, G, I,C\} = \{0, 1, 2, 3,4, 5, 6, 7, 8, 9\} $, then what is the ordered pair $(M + A +T + H, [T + e + A +M])$ where $e$ is $2.718...$and $[n]$ is the greatest integer less than or equal to $n$ ? [b]p13.[/b] There are $5$ marbles in a bag. One is red, one is blue, one is green, one is yellow, and the last is white. There are $4$ people who take turns reaching into the bag and drawing out a marble without replacement. If the marble they draw out is green, they get to draw another marble out of the bag. What is the probability that the $3$rd person to draw a marble gets the white marble? [b]p14.[/b] Let a "palindromic product" be a product of numbers which is written the same when written back to front, including the multiplication signs. For example, $234 * 545 * 432$, $2 * 2 *2 *2$, and $14 * 41$ are palindromic products whereas $2 *14 * 4 * 12$, $567 * 567$, and $2* 2 * 3* 3 *2$ are not. 2015 can be written as a "palindromic product" in two ways, namely $13 * 5 * 31$ and $31 * 5 * 13$. How many ways can you write $2016$ as a palindromic product without using 1 as a factor? [b]p15.[/b] Let a sequence be defined as $S_n = S_{n-1} + 2S_{n-2}$, and $S_1 = 3$ and $S_2 = 4$. What is $\sum_{n=1}^{\infty}\frac{S_n}{3^n}$ ? [b]p16.[/b] Put the numbers $0-9$ in some order so that every $2$-digit substring creates a number which is either a multiple of $7$, or a power of $2$. [b]p17.[/b] Evaluate $\dfrac{8+ \dfrac{8+ \dfrac{8+...}{3+...}}{3+ \dfrac{8+...}{3+...}}}{3+\dfrac{8+ \dfrac{8+...}{3+...}}{ 3+ \dfrac{8+...}{3+...}}}$, assuming that it is a positive real number. [b]p18.[/b] $4$ non-overlapping triangles, each of area $A$, are placed in a unit circle. What is the maximum value of $A$? [b]p19.[/b] What is the sum of the reciprocals of all the (positive integer) factors of $120$ (including $1$ and $120$ itself). [b]p20.[/b] How many ways can you choose $3$ distinct elements of $\{1, 2, 3,...,4000\}$ to make an increasing arithmetic series? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ [I]Netherlands[/i]

Let $n \geq 2$ be a given integer. At any point $(i, j)$ with $i, j \in\mathbb{ Z}$ we write the remainder of $i+j$ modulo $n$. Find all pairs $(a, b)$ of positive integers such that the rectangle with vertices $(0, 0)$, $(a, 0)$, $(a, b)$, $(0, b)$ has the following properties: [b](i)[/b] the remainders $0, 1, \ldots , n-1$ written at its interior points appear the same number of times; [b](ii)[/b] the remainders $0, 1, \ldots , n -1$ written at its boundary points appear the same number of times.

Let $ A \equal{} (a_{ij})$, where $ i,j \equal{} 1,2,\ldots,n$, be a square matrix with all $ a_{ij}$ non-negative integers. For each $ i,j$ such that $ a_{ij} \equal{} 0$, the sum of the elements in the $ i$th row and the $ j$th column is at least $ n$. Prove that the sum of all the elements in the matrix is at least $ \frac {n^2}{2}$.

Each grid point of a cartesian plane is colored with one of three colors, whereby all three colors are used. Show that one can always find a right-angled triangle, whose three vertices have pairwise different colors.

Let $T$ be a tree with$ n$ vertices. Choose a positive integer $k$ where $1 \le k \le n$ such that $S_k$ is a subset with $k$ elements from the vertices in $T$. For all $S \in S_k$, define $c(S)$ to be the number of component of graph from $S$ if we erase all vertices and edges in $T$, except all vertices and edges in $S$. Determine $\sum_{S\in S_k} c(S)$, expressed in terms of $n$ and $k$.

A $n \times n \times n$ cube is constructed using $1 \times 1 \times 1$ cubes, some of them black and others white, such that in each $n \times 1 \times 1$, $1 \times n \times 1$, and $1 \times 1 \times n$ subprism there are exactly two black cubes, and they are separated by an even number of white cubes (possibly 0). Show it is possible to replace half of the black cubes with white cubes such that each $n \times 1 \times 1$, $1 \times n \times 1$ and $1 \times 1 \times n$ subprism contains exactly one black cube.

There is a chessboard with $m$ columns and $n$ rows. In each blanks, an integer is given. If a rectangle $R$ (in this chessboard) has an integer $h$ satisfying the following two conditions, we call $R$ as a 'shelf'. (i) All integers contained in $R$ are bigger than $h$. (ii) All integers in blanks, which are not contained in $R$ but meet with $R$ at a vertex or a side, are not bigger than $h$. Assume that all integers are given to make shelves as much as possible. Find the number of shelves.

Let $F$ be a family of subsets of $S = \left \{ 1,2,...,n \right \}$ ($n \geq 2$). A valid play is to choose two disjoint sets $A$ and $B$ from $F$ and add $A \cup B$ to $F$ (without removing $A$ and $B$). Initially, $F$ has all the subsets that contain only one element of $S$. The goal is to have all subsets of $n - 1$ elements of $S$ in $F$ using valid plays. Determine the lowest number of plays required in order to achieve the goal.

Given a natural number $k> 1$. Prove that if through any edge of the graph $G$ passes less than $[e(k-1)! - 1]$ simple cycles, then the vertices of this graph can be colored with $k$ colors in the correct way.

Strings $a_1, a_2, ... , a_{2016}$ and $b_1, b_2, ... , b_{2016}$ each contain all natural numbers from $1$ to $2016$ exactly once each (in other words, they are both permutations of the numbers $1, 2, ..., 2016$). Prove that different indices $i$ and $j$ can be found such that $a_ib_i- a_jb_j$ is divisible by $2017$.

A certain class of $32$ pupils is organised into $33$ clubs , so that each club contains $3$ pupils and no two clubs have the same composition. Prove that there are two clubs which have exactly one common member.

Let $ A \equal{} \{1,2,\ldots,2008\}$ a) Find the number of subset of $ A$ which satisfy : the product of its elements is divisible by 7 b) Let $ N(i)$ denotes the number of subset of $ A$ which sum of its elements remains $ i$ when divided by 7. Prove that $ N(0) \minus{} N(1) \plus{} N(2) \minus{} N(3) \plus{} N(4) \minus{} N(5) \plus{} N(6)\minus{}N(7) \equal{} 0$ EDITED : thx for cosinator.. BTW, your statement and my correction give 80% hint of the solution :D

Let $N(a,b)$ be the number of ways to cover a table $a \times b$ with domino tiles. Let $M(a,2b+1)$ be the number of ways to cover a table $a \times 2b+1$ with domino tiles, such that there are [b]no[/b] vertical tile in the central column. Prove that $$M(2m,2n+1)=2^m \cdot N(2m,n)\cdot N(2m,n-1)$$

The figure shows all 6 colorings with for different colors of a $1\times 1$ square divided in four $\tfrac{1}{2} \times \tfrac{1}{2}$ cells (two colorings are considered equal if one is the result of rotating the other). Each of the $1\times 1$ colorings will be used as a piece for a puzzle. The pieces can be rotated but not reflected. Two pieces [i]fit[/i] if when sharing a side, the touching $\tfrac{1}{2} \times \tfrac{1}{2}$ cells are the same color respectively (see examples). ¿Is it possible to assemble a $3 \times 2$ puzzle using each of the 6 pieces exactly once and such that every pair of adjacent pieces fit? [img]https://imagizer.imageshack.com/img922/6019/ZUKcED.jpg[/img]

Each of the positive integers from $1$ to $2023,$ inclusive, are randomly colored either blue or red. For each nonempty subset of $S=\{1,2,\cdots,2023\},$ we define the score of that subset to be the positive difference between the number of blue integers and the number of red integers in that subset. Let $X$ be the expected value of the sum of the scores of all the nonempty subsets of $S$. What is the maximum integer $k$ such that $2^k$ divides $2^{2023}\cdot X$? [i]Proposed by Kyle Lee[/i]

Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions: \[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n; \] \[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n. \] [i]Author: Dusan Dukic, Serbia[/i]