Three families of parallel lines are drawn,$10$ lines each, are drawn. What is the greatest number of triangles they can cut from plane?

Let $n$ be a positive integer, set $S_n = \{ (a_1,a_2,\cdots,a_{2^n}) \mid a_i=0 \ \text{or} \ 1, 1 \leq i \leq 2^n\}$. For any two elements $a=(a_1,a_2,\cdots,a_{2^n})$ and $b=(b_1,b_2,\cdots,b_{2^n})$ of $S_n$, define \[ d(a,b)= \sum_{i=1}^{2^n} |a_i - b_i| \] We call $A \subseteq S_n$ a $\textsl{Good Subset}$ if $d(a,b) \geq 2^{n-1}$ holds for any two distinct elements $a$ and $b$ of $A$. How many elements can the $\textsl{Good Subset}$ of $S_n$ at most have?

Determine all positive real numbers $ a$ such that there exists a positive integer $ n$ and sets $ A_1, A_2, \ldots, A_n$ satisfying the following conditions: (1) every set $ A_i$ has infinitely many elements; (2) every pair of distinct sets $ A_i$ and $ A_j$ do not share any common element (3) the union of sets $ A_1, A_2, \ldots, A_n$ is the set of all integers; (4) for every set $ A_i,$ the positive difference of any pair of elements in $ A_i$ is at least $ a^i.$

On a board there are $n$ nails, each two connected by a rope. Each rope is colored in one of $n$ given distinct colors. For each three distinct colors, there exist three nails connected with ropes of these three colors. a) Can $n$ be $6$ ? b) Can $n$ be $7$ ?

You have $128$ teams in a single elimination tournament. The Engineers and the Crimson are two of these teams. Each of the $128$ teams in the tournament is equally strong, so during each match, each team has an equal probability of winning. Now, the $128$ teams are randomly put into the bracket. What is the probability that the Engineers play the Crimson sometime during the tournament?

Let $t = (a, b, c)$, and let us define $f^1 (t) = (a + b, b + c, c + a)$ and $f^k (t) = f^{k-1}(f^1(t))$ for all $k > 1$. Furthermore, a permutation of $t$ has the same elements, just in a different order (e.g., $(b, c, a)$). If $f^{2013}(s)$ is a permutation of $s$ for some $s = (k, m, n)$, where $k, m$, and $n$ are integers such that $|k|, |m|, |n|\le 10$, how many possible values of $s$ are there?

Given a positive integer $n\ge 3$, colour each cell of an $n\times n$ square array with one of $\lfloor (n+2)^2/3\rfloor$ colours, each colour being used at least once. Prove that there is some $1\times 3$ or $3\times 1$ rectangular subarray whose three cells are coloured with three different colours. [i](Russia) Ilya Bogdanov, Grigory Chelnokov, Dmitry Khramtsov[/i]

Amy and Bob play a game. They alternate turns, with Amy going first. At the start of the game, there are $20$ cookies on a red plate and $14$ on a blue plate. A legal move consists of eating two cookies taken from one plate, or moving one cookie from the red plate to the blue plate (but never from the blue plate to the red plate). The last player to make a legal move wins; in other words, if it is your turn and you cannot make a legal move, you lose, and the other player has won. Which player can guarantee that they win no matter what strategy their opponent chooses? Prove that your answer is correct.

Given $(2m+1)$ different integers, each absolute value is not greater than $(2m-1)$. Prove that it is possible to choose three numbers among them, with their sum equal to zero.

A collection of \( n \) balls is distributed in several boxes, with no box containing 100 or more balls. In one move, we can remove several (at least one, possibly all) balls from one box. Find the smallest positive integer \( n \) with the following property: regardless of the distribution, we can make moves such that each non-empty box contains the same number of balls and the total number of remaining balls is at least 100.

$5$ points are given in the plane, any three non-collinear and any four non-concyclic. If three points determine a circle that has one of the remaining points inside it and the other one outside it, then the circle is said to be [i]good[/i]. Let the number of good circles be $n$; find all possible values of $n$.

Let $P_1, P_2,..., P_n$ be a convex $n$-gon. If all lines $P_iP_j$ are joined, what is the maximum possible number of intersections in terms of $n$ obtained from strictly inside the polygon?

A postman wants to divide $n$ packages with weights $1, 2, 3, 4, n$ into three groups of exactly the same weight. Can he do this if (a) $n = 2011$ ? (b) $n = 2012$ ?

There are $n\ge 3$ students in a classroom. Every day, the teacher separates the students into at least two non-empty groups, and each pair of students from the same group will shake hands once. Suppose after $k$ days, each pair of students has shaken hands exactly once, and $k$ is as minimal as possible. Prove that $$\sqrt{n} \le k-1 \le 2\sqrt{n}$$ [i]Proposed by Wong Jer Ren[/i]

2. Let $A_1,A_2,...,A_n$be distinct subsets of an n-element set $ X$ ($n \geq 2$). Show that there exists an element $x$ of $X$ such that the sets $A_1\setminus \{x\}$ ,:......., $A_n\setminus \{x\}$ are all distinct.

Let $K$ denote the set $\{a, b, c, d, e\}$. $F$ is a collection of $16$ different subsets of $K$, and it is known that any three members of $F$ have at least one element in common. Show that all $16$ members of $F$ have exactly one element in common.

$N$ coins are placed on a table, $N - 1$ are genuine and have the same weight, and one is fake, with a different weight. Using a two pan balance, the goal is to determine with certainty the fake coin, and whether it is lighter or heavier than a genuine coin. Whenever one can deduce that one or more coins are genuine, they will be inmediately discarded and may no longer be used in subsequent weighings. Determine all $N$ for which the goal is achievable. (There are no limits regarding how many times one may use the balance). Note: the only difference between genuine and fake coins is their weight; otherwise, they are identical.

Let $r$ be a positive integer, and let $a_0 , a_1 , \cdots $ be an infinite sequence of real numbers. Assume that for all nonnegative integers $m$ and $s$ there exists a positive integer $n \in [m+1, m+r]$ such that \[ a_m + a_{m+1} +\cdots +a_{m+s} = a_n + a_{n+1} +\cdots +a_{n+s} \] Prove that the sequence is periodic, i.e. there exists some $p \ge 1 $ such that $a_{n+p} =a_n $ for all $n \ge 0$.

In a football tournament of one round (each team plays each other once, $2$ points for win , $1$ point for draw and $0$ points for loss), $28$ teams compete. During the tournament more than $75\%$ of the matches finished in a draw . Prove that there were two teams who finished with the same number of points. (M . Vora, gymnasium student , Hungary)

A domino has a left end and a right end, each of a certain color. Alice has four dominos, colored red-red, red-blue, blue-red, and blue-blue. Find the number of ways to arrange the dominos in a row end-to-end such that adjacent ends have the same color. The dominos cannot be rotated.

[b]p1.[/b] Find the largest $4$ digit integer that is divisible by $2$ and $5$, but not $3$. [b]p2.[/b] The diagram below shows the eight vertices of a regular octagon of side length $2$. These vertices are connected to form a path consisting of four crossing line segments and four arcs of degree measure $270^o$. Compute the area of the shaded region. [center][img]https://cdn.artofproblemsolving.com/attachments/0/0/eec34d8d2439b48bb5cca583462c289287f7d0.png[/img][/center] [b]p3.[/b] Consider the numbers formed by writing full copies of $2023$ next to each other, like so: $$2023202320232023...$$ How many copies of $2023$ are next to each other in the smallest multiple of $11$ that can be written in this way? [b]p4.[/b] A positive integer $n$ with base-$10$ representation $n = a_1a_2 ...a_k$ is called [i]powerful [/i] if the digits $a_i$ are nonzero for all $1 \le i \le k$ and $$n = a^{a_1}_1 + a^{a_2}_2 +...+ a^{a_k}_k .$$ What is the unique four-digit positive integer that is [i]powerful[/i]? [b]p5.[/b] Six $(6)$ chess players, whose names are Alice, Bob, Crystal, Daniel, Esmeralda, and Felix, are sitting in a circle to discuss future content pieces for a show. However, due to fights they’ve had, Bob can’t sit beside Alice or Crystal, and Esmeralda can’t sit beside Felix. Determine the amount of arrangements the chess players can sit in. Two arrangements are the same if they only differ by a rotation. [b]p6.[/b] Given that the infinite sum $\frac{1}{1^4} +\frac{1}{2^4} +\frac{1}{3^4} +...$ is equal to $\frac{\pi^4}{90}$, compute the value of $$\dfrac{\dfrac{1}{1^4} +\dfrac{1}{2^4} +\dfrac{1}{3^4} +...}{\dfrac{1}{1^4} +\dfrac{1}{3^4} +\dfrac{1}{5^4} +...}$$ [b]p7.[/b] Triangle $ABC$ is equilateral. There are $3$ distinct points, $X$, $Y$ , $Z$ inside $\vartriangle ABC$ that each satisfy the property that the distances from the point to the three sides of the triangle are in ratio $1 : 1 : 2$ in some order. Find the ratio of the area of $\vartriangle ABC$ to that of $\vartriangle XY Z$. [b]p8.[/b] For a fixed prime $p$, a finite non-empty set $S = \{s_1,..., s_k\}$ of integers is $p$-[i]admissible [/i] if there exists an integer $n$ for which the product $$(s_1 + n)(s_2 + n) ... (s_k + n)$$ is not divisible by $p$. For example, $\{4, 6, 8\}$ is $2$-[i]admissible[/i] since $(4+1)(6+1)(8+1) = 315$ is not divisible by $2$. Find the size of the largest subset of $\{1, 2,... , 360\}$ that is two-,three-, and five-[i]admissible[/i]. [b]p9.[/b] Kwu keeps score while repeatedly rolling a fair $6$-sided die. On his first roll he records the number on the top of the die. For each roll, if the number was prime, the following roll is tripled and added to the score, and if the number was composite, the following roll is doubled and added to the score. Once Kwu rolls a $1$, he stops rolling. For example, if the first roll is $1$, he gets a score of $1$, and if he rolls the sequence $(3, 4, 1)$, he gets a score of $3 + 3 \cdot 4 + 2 \cdot 1 = 17$. What is his expected score? [b]p10.[/b] Let $\{a_1, a_2, a_3, ...\}$ be a geometric sequence with $a_1 = 4$ and $a_{2023} = \frac14$ . Let $f(x) = \frac{1}{7(1+x^2)}$. Find $$f(a_1) + f(a_2) + ... + f(a_{2023}).$$ [b]p11.[/b] Let $S$ be the set of quadratics $x^2 + ax + b$, with $a$ and $b$ real, that are factors of $x^{14} - 1$. Let $f(x)$ be the sum of the quadratics in $S$. Find $f(11)$. [b]p12.[/b] Find the largest integer $0 < n < 100$ such that $n^2 + 2n$ divides $4(n- 1)! + n + 4$. [b]p13.[/b] Let $\omega$ be a unit circle with center $O$ and radius $OQ$. Suppose $P$ is a point on the radius $OQ$ distinct from $Q$ such that there exists a unique chord of $\omega$ through $P$ whose midpoint when rotated $120^o$ counterclockwise about $Q$ lies on $\omega$. Find $OP$. [b]p14.[/b] A sequence of real numbers $\{a_i\}$ satisfies $$n \cdot a_1 + (n - 1) \cdot a_2 + (n - 2) \cdot a_3 + ... + 2 \cdot a_{n-1} + 1 \cdot a_n = 2023^n$$ for each integer $n \ge 1$. Find the value of $a_{2023}$. [b]p15.[/b] In $\vartriangle ABC$, let $\angle ABC = 90^o$ and let $I$ be its incenter. Let line $BI$ intersect $AC$ at point $D$, and let line $CI$ intersect $AB$ at point $E$. If $ID = IE = 1$, find $BI$. [b]p16.[/b] For a positive integer $n$, let $S_n$ be the set of permutations of the first $n$ positive integers. If $p = (a_1, ..., a_n) \in S_n$, then define the bijective function $\sigma_p : \{1,..., n\} \to \{1, ..., n\}$ such that $\sigma_p (i) = a_i$ for all integers $1 \le i \le n$. For any two permutations $p, q \in S_n$, we say $p$ and $q$ are friends if there exists a third permutation $r \in S_n$ such that for all integers $1 \le i \le n$, $$\sigma_p(\sigma_r (i)) = \sigma_r(\sigma_q(i)).$$ Find the number of friends, including itself, that the permutation $(4, 5, 6, 7, 8, 9, 10, 2, 3, 1)$ has in $S_{10}$. PS. You had better use hide for answers.

Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.

Let $P(n)$ be the number of ways to split a natural number $n$ to the sum of powers of two, when the order does not matter. For example $P(5) = 4$, as $5=4+1=2+2+1=2+1+1+1=1+1+1+1+1$. Prove that for any natural the identity $P(n) + (-1)^{a_1} P(n-1) + (-1)^{a_2} P(n-2) + \ldots + (-1)^{a_{n-1}} P(1) + (-1)^{a_n} = 0,$ is true, where $a_k$ is the number of units in the binary number record $k$ . [url=http://matol.kz/comments/2720/show]source[/url]

We are given a row of $n\geq7$ tiles. In the leftmost 3 tiles, there is a white piece each, and in the rightmost 3 tiles, there is a black piece each. The white and black players play in turns (the white starts). In each move, a player may take a piece of their color, and move it to an adjacent tile, so long as it's not occupied by a piece of the [u]same color[/u]. If the new tile is empty, nothing happens. If the tile is occupied by a piece of the [u]opposite color[/u], both pieces are destroyed (both white and black). The player who destroys the last two pieces wins the game. Which player has a winning strategy, and what is it? (The answer may depend on $n$)

Let $P$ be a regular polygon with $ 4k + 1 $ sides (where $ k $ is a natural) whose vertices are $ A_1, A_2, ..., A_ {4k + 1} $ (in that order ). Each vertex $ A_j $ of $P$ is assigned a natural of the set $ \{1,2, ..., 4k + 1 \} $ such that no two vertices are assigned the same number. On $P$ the following operation is performed: Let $ B_j $ be the midpoint of the side $ A_jA_ {j + 1} $ for $ j = 1,2, ..., 4k + 1 $ (where is consider $ A_ {4k + 2} = A_1 $). If $ a $, $ b $ are the numbers assigned to $ A_ {j} $ and $ A_ {j + 1} $, respectively, the midpoint $ B_j $ is written the number $ 7a-3b $. By doing this with each of the $ 4k + 1 $ sides, the $ 4k + 1 $ vertices initially arranged are erased. We will say that a natural $ m $ is [i]fatal [/i] if for all natural $ k $ , no matter how the vertices of $P$ are initially arranged, it is impossible to obtain $ 4k + 1 $ equal numbers through a finite amount of operations from $ m $. a) Determine if the $ 2010 $ is fatal or not. Justify. b) Prove that there are infinite fatal numbers. [color=#f00]PS. A help in translation of the 2nd paragraph is welcome[/color]. [hide=Original wording]Diremos que un natural $m$ es fatal si no importa cómo se disponen inicialmente los vértices de ${P}$, es imposible obtener mediante una cantidad finita de operaciones $4k+1$ números iguales a $m$.[/hide]