Let $R$ be a set of exactly $6$ elements. A set $F$ of subsets of $R$ is called an $S$-family over $R$ if and only if it satisfies the following three conditions: (i) For no two sets $X, Y$ in $F$ is $X \subseteq Y$ ; (ii) For any three sets $X, Y,Z$ in $F$, $X \cup Y \cup Z \neq R,$ (iii) $\bigcup_{X \in F} X = R$

Let $p$ be a prime number. At a school of $p^{2020}$ students it is required that each club consist of exactly $p$ students. Is it possible for each pair of students to have exactly one club in common?

There are 2023 employees in the office, each of them knowing exactly $1686$ of the others. For any pair of employees they either both know each other or both don’t know each other. Prove that we can find $7$ employees each of them knowing all $6$ others.

There are $ n$ markers, each with one side white and the other side black. In the beginning, these $ n$ markers are aligned in a row so that their white sides are all up. In each step, if possible, we choose a marker whose white side is up (but not one of the outermost markers), remove it, and reverse the closest marker to the left of it and also reverse the closest marker to the right of it. Prove that, by a finite sequence of such steps, one can achieve a state with only two markers remaining if and only if $ n \minus{} 1$ is not divisible by $ 3$. [i]Proposed by Dusan Dukic, Serbia[/i]

There are $n$ snails on the plane where the $i$ snail has $a_i$ attack and $d_i$ defense, where $a_i, d_i\in \mathbb{R}$ and each snail has a distinct attack and a distinct defense. We said a 4-tuple of subsets of snails $(S_1, S_2, S_3, S_4)$ is [b]balanced[/b] if $|S_1|+|S_3|$ is either $\lceil n/2\rceil$ or $\lfloor n/2\rfloor$ and there exist real numbers $A, D$ such that \begin{align*} S_1=\{i\ |\ a_i\geq A\text{ and } d_i\geq D, 1\leq i\leq n\}\\ S_2=\{i\ |\ a_i<A\text{ and } d_i\geq D, 1\leq i\leq n\}\\ S_3=\{i\ |\ a_i< A\text{ and } d_i< D, 1\leq i\leq n\}\\ S_4=\{i\ |\ a_i\geq A\text{ and } d_i< D, 1\leq i\leq n\} \end{align*} Find the largest integer $k$ such that there is always at least $k$ [b]balanced[/b] 4-tuples of subsets. [i]Proposed by redshrimp[/i]

A 2-player game is played on $n\geq 3$ points, where no 3 points are collinear. Each move consists of selecting 2 of the points and drawing a new line segment connecting them. The first player to draw a line segment that creates an odd cycle loses. (An odd cycle must have all its vertices among the $n$ points from the start, so the vertices of the cycle cannot be the intersections of the lines drawn.) Find all $n$ such that the player to move first wins.

The pieces in a game are squares of side $1$ with their sides colored with $4$ colors: blue, red, yellow and green, so that each piece has one side of each color. There are pieces in every possible color arrangement, and the game has a million pieces of each kind. With the pieces, rectangular puzzles are assembled, without gaps or overlaps, so that two pieces that share a side have that side of the same color. Determine if with this procedure you can make a rectangle of $99\times 2007$ with one side of each color. And $100\times 2008$? And $99\times 2008$?

Let $\mathbb{R}^n$ be the $n$-dimensional Euclidean space. Determine the smallest number $g(n)$ of a points of a set in $\mathbb{R}^n$ such that every point in $\mathbb{R}^n$ is an irrational distance from at least one point in that set.

Prove that if a graph $\mathcal{G}$ on $n\ge 3$ vertices has a unique $3$-coloring, then $\mathcal{G}$ has at least $2n-3$ edges. (A graph is $3$-colorable when there exists a coloring of its vertices with $3$ colors such that no two vertices of the same color are connected by an edge. The graph can be $3$-colored uniquely if there do not exist vertices $u$ and $v$ of the graph that are painted different colors in one $3$-coloring, yet are colored the same in another.)

Let us have $n$ ( $n>3$) balls with different rays. On each ball it is written an integer number. Determine the greatest natural number $d$ such that for any numbers written on the balls, we can always find at least 4 different ways to choose some balls with the sum of the numbers written on them divisible by $d$.

Initially in every cell of a $5\times 5$ board is the number $0$. In one move you may take any cell of this board and add $1$ to it and all of its adjacent cells (two cells are adjacent if they share an edge). After a finite number of moves, number $n$ is written in all cells. Find all possible values of $n$.

In the game "cat and mouse" the cat chases the mouse in either labyrinth $A, B$ or $C$ . [img]https://cdn.artofproblemsolving.com/attachments/4/5/429d106736946011f4607cf95956dcb0937c84.png[/img] The cat makes the first move starting at the point marked "$K$" , moving along a marked line to an adjacent point . The mouse then moves , under the same rules, starting from the point marked "$M$" . Then the cat moves again, and so on . If, at a point of time , the cat and mouse are at the same point the cat eats the mouse. Is there available to the cat a strategy which would enable it to catch the mouse , in cases $A, B$ and $C$? (A. Sosinskiy, Moscow)

Bob has $3$ different fountain pens and $11$ different ink colors. How many ways can he fill his fountain pens with ink if he can only put one ink in each pen?

$101$ wise men stand in a circle. Each of them either thinks that the Earth orbits Jupiter or that Jupiter orbits the Earth. Once a minute, all the wise men express their opinion at the same time. Right after that, every wise man who stands between two people with a different opinion from him changes his opinion himself. The rest do not change. Prove that at one point they will all stop changing opinions.

Seventeen people correspond by mail with one another-each one with all the rest. In their letters only three different topics are discussed. each pair of correspondents deals with only one of these topics. Prove that there are at least three people who write to each other about the same topic.

We have triangulated a convex $(n+1)$-gon $P_0P_1\dots P_n$ (i.e., divided it into $n-1$ triangles with $n-2$ non-intersecting diagonals). Prove that the resulting triangles can be labelled with the numbers $1,2,\dots,n-1$ such that for any $i\in\{1,2,\dots,n-1\}$, $P_i$ is a vertex of the triangle with label $i$.

We are given $ 3^{2k}$ apparently identical coins,one of which is fake,being lighter than the others. We also dispose of three apparently identical balances without weights, one of which is broken (and yields outcomes unrelated to the actual situations). How can we find the fake coin in $ 3k\plus{}1$ weighings?

Five people are standing in a straight line, and the distance between any two people is a unique positive integer number of units. Find the least possible distance between the leftmost and rightmost people in the line in units.

[b]p1.[/b] There are $32$ balls in a box: $6$ are blue, $8$ are red, $4$ are yellow, and $14$ are brown. If I pull out three balls at once, what is the probability that none of them are brown? [b]p2.[/b] Circles $A$ and $B$ are concentric, and the area of circle $A$ is exactly $20\%$ of the area of circle $B$. The circumference of circle $B$ is $10$. A square is inscribed in circle $A$. What is the area of that square? [b]p3.[/b] If $x^2 +y^2 = 1$ and $x, y \in R$, let $q$ be the largest possible value of $x+y$ and $p$ be the smallest possible value of $x + y$. Compute $pq$. [b]p4.[/b] Yizheng and Jennifer are playing a game of ping-pong. Ping-pong is played in a series of consecutive matches, where the winner of a match is given one point. In the scoring system that Yizheng and Jennifer use, if one person reaches $11$ points before the other person can reach $10$ points, then the person who reached $11$ points wins. If instead the score ends up being tied $10$-to-$10$, then the game will continue indefinitely until one person’s score is two more than the other person’s score, at which point the person with the higher score wins. The probability that Jennifer wins any one match is $70\%$ and the score is currently at $9$-to-$9$. What is the probability that Yizheng wins the game? [b]p5.[/b] The squares on an $8\times 8$ chessboard are numbered left-to-right and then from top-to-bottom (so that the top-left square is $\#1$, the top-right square is $\#8$, and the bottom-right square is $\#64$). $1$ grain of wheat is placed on square $\#1$, $2$ grains on square $\#2$, $4$ grains on square $\#3$, and so on, doubling each time until every square of the chessboard has some number of grains of wheat on it. What fraction of the grains of wheat on the chessboard are on the rightmost column? [b]p6.[/b] Let $f$ be any function that has the following property: For all real numbers $x$ other than $0$ and $1$, $$f \left( 1 - \frac{1}{x} \right) + 2f \left( \frac{1}{1 - x}\right)+ 3f(x) = x^2.$$ Compute $f(2)$. [b]p7.[/b] Find all solutions of: $$(x^2 + 7x + 6)^2 + 7(x^2 + 7x + 6)+ 6 = x.$$ [b]p8.[/b] Let $\vartriangle ABC$ be a triangle where $AB = 25$ and $AC = 29$. $C_1$ is a circle that has $AB$ as a diameter and $C_2$ is a circle that has $BC$ as a diameter. $D$ is a point on $C_1$ so that $BD = 15$ and $CD = 21$. $C_1$ and $C_2$ clearly intersect at $B$; let $E$ be the other point where $C_1$ and $C_2$ intersect. Find all possible values of $ED$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $n$ points in the plane so that no two pairs are equidistant. Each point is connected to the nearest point by a segment. Show that no point is connected to more than five points.

Let $n$ be a positive integer. Andrés has $n+1$ cards and each of them has a positive integer written, in such a way that the sum of the $n+1$ numbers is $3n$. Show that Andrés can place one or more cards in a red box and one or more cards in a blue box in such a way that the sum of the numbers of the cards in the red box is equal to twice the sum of the numbers of the cards in the blue box. Clarification: Some of Andrés's letters can be left out of the boxes.

Let $m$ and $n$ be positive integers. Determine the number of ways to fill each cell of an $m \times n $ table with a number from $\{-2, -1, 1, 2\}$ so that the product of the numbers written in each row and column is $-2$.

Two types of tiles, depicted on the figure below, are given. [img]https://wiki-images.artofproblemsolving.com//2/23/Izrezak.PNG[/img] Find all positive integers $n$ such that an $n\times n$ board consisting of $n^2$ unit squares can be covered without gaps with these two types of tiles (rotations and reflections are allowed) so that no two tiles overlap and no part of any tile covers an area outside the $n\times n$ board. \\ [i]Proposed by Art Waeterschoot[/i]

Given positive integer $n,k$ such that $2 \le n <2^k$. Prove that there exist a subset $A$ of $\{0,1,\cdots,n\}$ such that for any $x \neq y \in A$, ${y\choose x}$ is even, and $$|A| \ge \frac{{k\choose \lfloor \frac{k}{2} \rfloor}}{2^k} \cdot (n+1)$$

Let $n, k$ be positive integers with $k \geq 3$. The edges of of a complete graph $K_n$ are colored in $k$ colors, such that for any color $i$ and any two vertices, there exists a path between them, consisting only of edges in color $i$. Prove that there exist three vertices $A, B, C$ of $K_n$, such that $AB, BC$ and $CA$ are all distinctly colored.