21 people take a test with 15 true or false questions. It is known that every 2 people have at least 1 correct answer in common. What is the minimum number of people that could have correctly answered the question which the most people were correct on?

For a convex polygon (i.e. all angles less than $180^\circ$) call a diagonal [i]bisector[/i] if its bisects both area and perimeter of the polygon. What is the maximum number of bisector diagonals for a convex pentagon? [i]Proposed by Morteza Saghafian[/i]

In a scientific conference, all participants can speak in total $2 \cdot n$ languages ($n \geq 2$). Each participant can speak exactly two languages and each pair of two participants can have at most one common language. It is known that for every integer $k$, $1 \leq k \leq n-1$ there are at most $k-1$ languages such that each of these languages is spoken by at most $k$ participants. Show that we can choose a group from $2 \cdot n$ participants which in total can speak $2 \cdot n$ languages and each language is spoken by exactly two participants from this group.

Prove that among any $10$ entries of the table $$0 \,\,\,\, 1 \,\,\,\, 2 \,\,\,\, 3 \,\,\,\, ... \,\,\,\, 9$$ $$9 \,\,\,\, 0 \,\,\,\, 1 \,\,\,\, 2 \,\,\,\, ... \,\,\,\, 8$$ $$8 \,\,\,\, 9 \,\,\,\, 0 \,\,\,\, 1 \,\,\,\, ... \,\,\,\, 7$$ $$1 \,\,\,\, 2 \,\,\,\, 3 \,\,\,\, 4 \,\,\,\, ... \,\,\,\, 0$$ standing in different rows and different columns, at least two are equal. (A Savin)

[b]p1.[/b] (See the diagram below.) $ABCD$ is a square. Points $G$, $H$, $I$, and $J$ are chosen in the interior of $ABCD$ so that: (i) $H$ is on $\overline{AG}$, $I$ is on $\overline{BH}$, $J$ is on $\overline{CI}$, and $G$ is on $\overline{DJ}$ (ii) $\vartriangle ABH \sim \vartriangle BCI \sim \vartriangle CDJ \sim \vartriangle DAG$ and (iii) the radii of the inscribed circles of $\vartriangle ABH$, $\vartriangle BCI$, $\vartriangle CDJ$, $\vartriangle DAK$, and $GHIJ$ are all the same. What is the ratio of $\overline{AB}$ to $\overline{GH}$? [img]https://cdn.artofproblemsolving.com/attachments/f/b/47e8b9c1288874bc48462605ecd06ddf0f251d.png[/img] [b]p2.[/b] The three solutions $r_1$, $r_2$, and $r_3$ of the equation $$x^3 + x^2 - 2x - 1 = 0$$ can be written in the form $2 \cos (k_1 \pi)$, $2 \cos (k_2 \pi)$, and $2 \cos (k_3 \pi)$ where $0 \le k_1 < k_2 < k_3 \le 1$. What is the ordered triple $(k_1, k_2, k_3)$? [b]p3.[/b] $P$ is a convex polyhedron, all of whose faces are either triangles or decagons ($10$-sided polygon), though not necessarily regular. Furthermore, at each vertex of $P$ exactly three faces meet. If $P$ has $20$ triangular faces, how many decagonal faces does P have? [b]p4.[/b] $P_1$ is a parabola whose line of symmetry is parallel to the $x$-axis, has $(0, 1)$ as its vertex, and passes through $(2, 2)$. $P_2$ is a parabola whose line of symmetry is parallel to the $y$-axis, has $(1, 0)$ as its vertex, and passes through $(2, 2)$. Find all four points of intersection between $P_1$ and $P_2$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The graph $G$ is not $3$-coloured. Prove that $G$ can be divided into two graphs $M$ and $N$ such that $M$ is not $2$-coloured and $N$ is not $1$-coloured. [i]V. Dolnikov[/i]

Consider 2009 cards which are lying in sequence on a table. Initially, all cards have their top face white and bottom face black. The cards are enumerated from 1 to 2009. Two players, Amir and Ercole, make alternating moves, with Amir starting. Each move consists of a player choosing a card with the number $k$ such that $k < 1969$ whose top face is white, and then this player turns all cards at positions $k,k+1,\ldots,k+40.$ 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? [i]Also compare shortlist 2009, combinatorics problem C1.[/i]

[b]p1.[/b] Find $$2^{\left(0^{\left(2^3\right)}\right)}$$ [b]p2.[/b] Amy likes to spin pencils. She has an $n\%$ probability of dropping the $n$th pencil. If she makes $100$ attempts, the expected number of pencils Amy will drop is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [b]p3.[/b] Determine the units digit of $3 + 3^2 + 3^3 + 3^4 +....+ 3^{2022} + 3^{2023}$. [b]p4.[/b] Cyclic quadrilateral $ABCD$ is inscribed in circle $\omega$ with center $O$ and radius $20$. Let the intersection of $AC$ and $BD$ be $E$, and let the inradius of $\vartriangle AEB$ and $\vartriangle CED$ both be equal to $7$. Find $AE^2 - BE^2$. [b]p5.[/b] An isosceles right triangle is inscribed in a circle which is inscribed in an isosceles right triangle that is inscribed in another circle. This larger circle is inscribed in another isosceles right triangle. If the ratio of the area of the largest triangle to the area of the smallest triangle can be expressed as $a+b\sqrt{c}$, such that $a, b$ and $c$ are positive integers and no square divides $c$ except $1$, find $a + b + c$. [b]p6.[/b] Jonny has three days to solve as many ISL problems as he can. If the amount of problems he solves is equal to the maximum possible value of $gcd \left(f(x), f(x+1) \right)$ for $f(x) = x^3 +2$ over all positive integer values of $x$, then find the amount of problems Jonny solves. [b]p7.[/b] Three points $X$, $Y$, and $Z$ are randomly placed on the sides of a square such that $X$ and $Y$ are always on the same side of the square. The probability that non-degenerate triangle $\vartriangle XYZ$ contains the center of the square can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]p8.[/b] Compute the largest integer less than $(\sqrt7 +\sqrt3)^6$. [b]p9.[/b] Find the minimum value of the expression $\frac{(x+y)^2}{x-y}$ given $x > y > 0$ are real numbers and $xy = 2209$. [b]p10.[/b] Find the number of nonnegative integers $n \le 6561$ such that the sum of the digits of $n$ in base $9$ is exactly $4$ greater than the sum of the digits of $n$ in base $3$. [b]p11.[/b] Estimation (Tiebreaker) Estimate the product of the number of people who took the December contest, the sum of all scores in the November contest, and the number of incorrect responses for Problem $1$ and Problem $2$ on the October Contest. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\pi$ be a permutation of the numbers from $ 2$ through $2012$. Find the largest possible value of $$\log_2 \pi(2) \cdot \log_3 \pi(3) ...\log_{2012} \pi(2012).$$

Nikees has a set $S$ of $n$ points on a plane and decides to colour them. All $\dbinom{n}{2}$ line segments are drawn and they have distinct lengths. Find the maximum number of colours that are used at least once, given that: (a) For each point $P$, the two endpoints of the longest line segment connecting $P$ must be of the same colour. (b) For each point $P$, the two endpoints of the shortest line segment connecting $P$ must be of the same colour.

Eight men had participated in the chess tournament. (Each meets each, draws are allowed, giving $1/2$ of point, winner gets $1$.) Everyone has different number of points. The second one has got as many points as the four weakest participants together. What was the result of the play between the third prizer and the chess-player that have occupied the seventh place?

Given a (simple) graph $G$ with $n \geq 2$ vertices $v_1, v_2, \dots, v_n$ and $m \geq 1$ edges, Joël and Robert play the following game with $m$ coins: [list=i] [*]Joël first assigns to each vertex $v_i$ a non-negative integer $w_i$ such that $w_1+\cdots+w_n=m$. [*]Robert then chooses a (possibly empty) subset of edges, and for each edge chosen he places a coin on exactly one of its two endpoints, and then removes that edge from the graph. When he is done, the amount of coins on each vertex $v_i$ should not be greater than $w_i$. [*]Joël then does the same for all the remaining edges. [*]Joël wins if the number of coins on each vertex $v_i$ is equal to $w_i$. [/list] Determine all graphs $G$ for which Joël has a winning strategy.

A [b][u]word[/u][/b] is formed by a number of letters of the alphabet. We show words with capital letters. A [b][u]sentence[/u][/b] is formed by a number of words. For example if $A=aa$ and $B=ab$ then the sentence $AB$ is equivalent to $aaab$. In this language, $A^n$ indicates $\underbrace{AA \cdots A}_{n}$. We have an equation when two sentences are equal. For example $XYX=YZ^2$ and it means that if we write the alphabetic letters forming the words of each sentence, we get two equivalent sequences of alphabetic letters. An equation is [b][u]simplified[/u][/b], if the words of the left and the right side of the sentences of the both sides of the equation are different. Note that every word contains one alphabetic letter at least. $\text{a})$We have a simplified equation in terms of $X$ and $Y$. Prove that both $X$ and $Y$ can be written in form of a power of a word like $Z$.($Z$ can contain only one alphabetic letter). $\text{b})$ Words $W_1,W_2,\cdots , W_n$ are the answers of a simplified equation. Prove that we can produce these $n$ words with fewer words. $\text{c})$ $n$ words $W_1,W_2,\cdots , W_n$ are the answers of a simplified system of equations. Define graph $G$ with vertices ${1,2 \cdots ,n}$ such that $i$ and $j$ are connected if in one of the equations, $W_i$ and $W_j$ be the two words appearing in the right side of each side of the equation.($\cdots W_i = \cdots W_j$). If we denote by $c$ the number of connected components of $G$, prove that these $n$ words can be produced with at most $c$ words. [i]Proposed by Mostafa Einollah Zadeh Samadi[/i]

Let $M>1$ be a natural number. Tom and Jerry play a game. Jerry wins if he can produce a function $f: \mathbb{N} \rightarrow \mathbb{N}$ satisfying [list] [*]$f(M) \ne M$ [/*] [*] $f(k)<2k$ for all $k \in \mathbb{N}$[/*] [*] $f^{f(n)}(n)=n$ for all $n \in \mathbb{N}$. For each $\ell>0$ we define $f^{\ell}(n)=f\left(f^{\ell-1}(n)\right)$ and $f^0(n)=n$[/*] [/list] Tom wins otherwise. Prove that for infinitely many $M$, Tom wins, and for infinitely many $M$, Jerry wins. [i]Proposed by Anant Mudgal[/i]

At the meeting, each person is familiar with 22 people. If two persons $A$ and $B$ know each with one another, among the remaining people they do not have a common friend. For each pair individuals $A$ and $B$ are not familiar with each other, there are among the remaining six common acquaintances. How many people were at the meeting?

A convex $2004$-sided polygon $P$ is given such that no four vertices are cyclic. We call a triangle whose vertices are vertices of $P$ thick if all other $2001$ vertices of $P$ lie inside the circumcircle of the triangle, and thin if they all lie outside its circumcircle. Prove that the number of thick triangles is equal to the number of thin triangles.

Find the smallest positive integer $n$ for which there exist integers $x_{1} < x_{2} <...< x_{n}$ such that every integer from $1000$ to $2000$ can be written as a sum of some of the integers from $x_1,x_2,..,x_n$ without repetition.

There are $b$ boys and $g$ girls, with $g \ge 2b-1$, at presence at a party. Each boy invites a girl for the first dance. Prove that this can be done in such a way that either a boy is dancing with a girl he knows or all the girls he knows are not dancing.

Let $n$ be a positive integer. Mariano divides a rectangle into $n^2$ smaller rectangles by drawing $n-1$ vertical lines and $n-1$ horizontal lines, parallel to the sides of the larger rectangle. On every step, Emilio picks one of the smaller rectangles and Mariano tells him its area. Find the least positive integer $k$ for which it is possible that Emilio can do $k$ conveniently thought steps in such a way that with the received information, he can determine the area of each one of the $n^2$ smaller rectangles.

Two squirrels, Bushy and Jumpy, have collected 2021 walnuts for the winter. Jumpy numbers the walnuts from 1 through 2021, and digs 2021 little holes in a circular pattern in the ground around their favourite tree. The next morning Jumpy notices that Bushy had placed one walnut into each hole, but had paid no attention to the numbering. Unhappy, Jumpy decides to reorder the walnuts by performing a sequence of 2021 moves. In the $k$-th move, Jumpy swaps the positions of the two walnuts adjacent to walnut $k$. Prove that there exists a value of $k$ such that, on the $k$-th move, Jumpy swaps some walnuts $a$ and $b$ such that $a<k<b$.

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

We call a graph with n vertices $k-flowing-chromatic$ if: 1. we can place a chess on each vertex and any two neighboring (connected by an edge) chesses have different colors. 2. we can choose a hamilton cycle $v_1,v_2,\cdots , v_n$, and move the chess on $v_i$ to $v_{i+1}$ with $i=1,2,\cdots ,n$ and $v_{n+1}=v_1$, such that any two neighboring chess also have different colors. 3. after some action of step 2 we can make all the chess reach each of the n vertices. Let T(G) denote the least number k such that G is k-flowing-chromatic. If such k does not exist, denote T(G)=0. denote $\chi (G)$ the chromatic number of G. Find all the positive number m such that there is a graph G with $\chi (G)\le m$ and $T(G)\ge 2^m$ without a cycle of length small than 2017.

An insect is on a square ceiling side $1$. The insect can jump to the midpoint of the segment joining it to any of the four corners of the ceiling. Show that in $8$ jumps it can get to within $1/100$ of any chosen point on the ceiling

Let $m$ be a positive integer with $m \leq 2024$. Ana and Banana play a game alternately on a $1\times2024$ board, with squares initially painted white. Ana starts the game. Each move by Ana consists of choosing any $k \leq m$ white squares on the board and painting them all green. Each Banana play consists of choosing any sequence of consecutive green squares and painting them all white. What is the smallest value of $m$ for which Ana can guarantee that, after one of her moves, the entire board will be painted green?

We consider the following figure: [See attachment] We are looking for labellings of the nine fields with the numbers 1, 2, ..., 9. Each of these numbers has to be used exactly once. Moreover, the six sums of three resp. four numbers along the drawn lines have to be be equal. Give one such labelling. Show that all such labellings have the same number in the top field. How many such labellings do there exist? (Two labellings are considered different, if they disagree in at least one field.) (Walther Janous)