Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

The vertices of a regular polygon with $N$ sides are marked on the blackboard. Ana and Beto play alternately, Ana begins. Each player, in turn, must do the following: $\bullet$ join two vertices with a segment, without cutting another already marked segment; or $\bullet$ delete a vertex that does not belong to any marked segment. The player who cannot take any action on his turn loses the game. Determine which of the two players can guarantee victory: a) if $N=28$ b) if $N=29$

[b]p1.[/b] It takes $12$ months for Santa Claus to pack gifts. It would take $20$ months for his apprentice to do the job. If they work together, how long will it take for them to pack the gifts? [b]p2.[/b] All passengers on a bus sit in pairs. Exactly $2/5$ of all men sit with women, exactly $2/3$ of all women sit with men. What part of passengers are men? [b]p3.[/b] There are $100$ colored balls in a box. Every $10$-tuple of balls contains at least two balls of the same color. Show that there are at least $12$ balls of the same color in the box. [b]p4.[/b] There are $81$ wheels in storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that one can determine which wheel is incorrectly marked with four measurements. [b]p5.[/b] Remove from the figure below the specified number of matches so that there are exactly $5$ squares of equal size left: (a) $8$ matches (b) $4$ matches [img]https://cdn.artofproblemsolving.com/attachments/4/b/0c5a65f2d9b72fbea50df12e328c024a0c7884.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Given two irreducible fractions. The denominator of the first fraction is $4$, the denominator of the second fraction is $6$. What can the denominator of the product of these fractions be equal to if the product is represented as an irreducible fraction? [b]p2.[/b] Three horses compete in the race. The player can bet a certain amount of money on each horse. Bets on the first horse are accepted in the ratio $1: 4$. This means that if the first horse wins, then the player gets back the money bet on this horse, and four more times the same amount. Bets on the second horse are accepted in the ratio $1:3$, on the third -$ 1:1$. Money bet on a losing horse is not returned. Is it possible to bet in such a way as to win whatever the outcome of the race? [b]p3.[/b] A quadrilateral is inscribed in a circle, such that the center of the circle, point $O$, is lies inside it. Let $K$, $L$, $M$, $N$ be the midpoints of the sides of the quadrilateral, following in this order. Prove that the bisectors of angles $\angle KOM$ and $\angle LOC$ are perpendicular (Fig.). [img]https://cdn.artofproblemsolving.com/attachments/b/8/ea4380698eba7f4cc2639ce20e3057e0294a7c.png[/img] [b]p4.[/b] Prove that the number$$\underbrace{33...33}_{1999 \,\,\,3s}1$$ is not divisible by $7$. [b]p5.[/b] In triangle $ABC$, the median drawn from vertex $A$ to side $BC$ is four times smaller than side $AB$ and forms an angle of $60^o$ with it. Find the greatest angle of this triangle. [b]p6.[/b] Given a $7\times 8$ rectangle made up of 1x1 cells. Cut it into figures consisting of $1\times 1$ cells, so that each figure consists of no more than $5$ cells and the total length of the cuts is minimal (give an example and prove that this cannot be done with a smaller total length of the cuts). You can only cut along the boundaries of the cells. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

[b]p1.[/b] Find the smallest positive integer which is $1$ more than multiple of $3$, $2$ more than a multiple of $4$, and $4$ more than a multiple of $7$. [b]p2.[/b] Let $p = 4$, and let $a =\sqrt1$, $b =\sqrt2$, $c =\sqrt3$, $...$. Compute the value of $(p-a)(p-b) ... (p-z)$. [b]p3.[/b] There are $6$ points on the circumference of a circle. How many convex polygons are there having vertices on these points? [b]p4.[/b] David and I each have a sheet of computer paper, mine evenly spaced by $19$ parallel lines into $20$ sections, and his evenly spaced by $29$ parallel lines into $30$ sections. If our two sheets are overlayed, how many pairs of lines are perfectly incident? [b]p5.[/b] A pyramid is created by stacking equilateral triangles of balls, each layer having one fewer ball per side than the triangle immediately beneath it. How many balls are used if the pyramid’s base has $5$ balls to a side? [b]p6.[/b] Call a positive integer $n$ good if it has $3$ digits which add to $4$ and if it can be written in the form $n = k^2$, where $k$ is also a positive integer. Compute the average of all good numbers. [b]p7.[/b] John’s birthday cake is a scrumptious cylinder of radius $6$ inches and height $3$ inches. If his friends cut the cake into $8$ equal sectors, what is the total surface area of a piece of birthday cake? [b]p8.[/b] Evaluate $\sum^{10}_{i=1}\sum^{10}_{j=1} ij$. [b]p9.[/b] If three numbers $a$, $b$, and $c$ are randomly selected from the interval $[-2, 2]$, what is the probability that $a^2 + b^2 + c^2 \ge 4$? [b]p10.[/b] Evaluate $\sum^{\infty}_{x=2} \frac{2}{x^2 - 1}.$ [b]p11.[/b] Consider $4x^2 - kx - 1 = 0$. If the roots of this polynomial are $\sin \theta$ and $\cos \theta$, compute $|k|$. [b]p12.[/b] Given that $65537 = 2^{16} + 1$ is a prime number, compute the number of primes of the form $2^n + 1$ (for $n \ge 0$) between $1$ and $10^6$. [b]p13.[/b] Compute $\sin^{-1}(36/85) + \cos^{-1}(4/5) + \cos^{-1}(15/17).$ [b]p14.[/b] Find the number of integers $n$, $1\le n \le 2003$, such that $n^{2003} - 1$ is a multiple of $10$. [b]p15.[/b] Find the number of integers $n,$ $1 \le n \le 120$, such that $n^2$ leaves remainder $1$ when divided by $120$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In an empty $100 \times 100$ grid, $300$ cells are colored blue, $3$ in each row and each column. Compute the largest positive integer $k$ such that you can always recolor $k$ of these blue cells red so that no contiguous $2 \times 2$ square has four red cells. [i]Arul Kolla[/i]

Dexter's Laboratory has $2024$ robots, each with a program setup by Dexter. One day, his naughty sister Dee Dee intrudes and writes an integer in $\{1, 2, \dots, 113\}$ on each of the robot's forehead. Each robot detects the numbers on all other robots' foreheads, and guess its own number base on its program, individually and simultaneously. Find the largest positive integer $k$ such that Dexter can setup the programs so that, no matter how the numbers distribute, there are always at least $k$ robots who guess their numbers right. [i]Proposed by sn6dh[/i]

Let $n$ be a fixed positive odd integer. Take $m+2$ [b]distinct[/b] points $P_0,P_1,\ldots ,P_{m+1}$ (where $m$ is a non-negative integer) on the coordinate plane in such a way that the following three conditions are satisfied: 1) $P_0=(0,1),P_{m+1}=(n+1,n)$, and for each integer $i,1\le i\le m$, both $x$- and $y$- coordinates of $P_i$ are integers lying in between $1$ and $n$ ($1$ and $n$ inclusive). 2) For each integer $i,0\le i\le m$, $P_iP_{i+1}$ is parallel to the $x$-axis if $i$ is even, and is parallel to the $y$-axis if $i$ is odd. 3) For each pair $i,j$ with $0\le i<j\le m$, line segments $P_iP_{i+1}$ and $P_jP_{j+1}$ share at most $1$ point. Determine the maximum possible value that $m$ can take.

Let $x_1,x_2,...,x_k$ be a sequence of integers. A rearrangement of this sequence (the numbers in the sequence listed in some other order) is called a [b]scramble[/b] if no number in the new sequence is equal to the number originally in its location. For example, if the original sequence is $1,3,3,5$ then $3,5,1,3$ is a scramble, but $3,3,1,5$ is not. A rearrangement is called a [b]two-two[/b] if exactly two of the numbers in the new sequence are each exactly two more than the numbers that originally occupied those locations. For example, $3,5,1,3$ is a two-two of the sequence $1,3,3,5$ (the first two values $3$ and $5$ of the new sequence are exactly two more than their original values $1$ and $3$). Let $n\geq 2$. Prove that the number of scrambles of $1,1,2,3,...,n-1,n$ is equal to the number of two-twos of $1,2,3,...,n,n+1$. (Notice that both sequences have $n+1$ numbers, but the first one contains two 1s.)

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

The set $S = \{1, 2, \dots, 2022\}$ is to be partitioned into $n$ disjoint subsets $S_1, S_2, \dots, S_n$ such that for each $i \in \{1, 2, \dots, n\}$, exactly one of the following statements is true: (a) For all $x, y \in S_i$, with $x \neq y, \gcd(x, y) > 1.$ (b) For all $x, y \in S_i$, with $x \neq y, \gcd(x, y) = 1.$ Find the smallest value of $n$ for which this is possible.

Several numbers are written in a row. In each move, Robert chooses any two adjacent numbers in which the one on the left is greater than the one on the right, doubles each of them and then switches them around. Prove that Robert can make only a finite number of moves.

A country has 1001 cities, and each two cities are connected by a one-way street. From each city exactly 500 roads begin, and in each city 500 roads end. Now an independent republic splits itself off the country, which contains 668 of the 1001 cities. Prove that one can reach every other city of the republic from each city of this republic without being forced to leave the republic.

In a group of $n$ persons, (i) each person is acquainted to exactly $k$ others, (ii) any two acquainted persons have exactly $l$ common acquaintances, (iii) any two non-acquainted persons have exactly $m$ common acquaintances. Prove that $m(n-k -1) = k(k -l -1)$.

Here $G_{n}$ denotes a simple undirected graph with $n$ vertices, $K_{n}$ denotes the complete graph with $n$ vertices, $K_{n,m}$ the complete bipartite graph whose components have $m$ and $n$ vertices, and $C_{n}$ a circuit with $n$ vertices. The number of edges in the graph $G_{n}$ is denoted $e(G_{n})$. (a) Let $p$ be a prime. Consider the graph whose vertices are the ordered pairs $(x, y)$ with $x, y \in\{0, 1, . . . , p-1\}$ and whose edges join vertices $(x, y)$ and $(x' , y')$ if and only if $xx'+yy'\equiv 1 \pmod{p}$ . Prove that this graph does not contain $C_{4}$ . (b) Prove that for infinitely many values $n$ there is a graph $G_{n}$ with $e(G_{n}) \geq \frac{n\sqrt{n}}{2}-n$ that does not contain $C_{4}$.

Given is an array $A$ of $2n$ numbers, where $n$ is a positive integer. Give an algorithm to create an array $prod$ of length $2n$ where $$prod[i] \, = \, A[i] \times A[i+1] \times \cdots \times A[i+n-1],$$ ($A[x]$ means $A[x \ \text{mod}\ 2n]$) in $O(n)$ time [b]withou[/b]t using division. Assume that all binary arithmetic operations are $O(1)$

We are given a chessboard with 100 rows and 100 columns. Two squares of the board are said to be adjacent if they have a common side. Initially all squares are white. a) Is it possible to colour an odd number of squares in such a way that each coloured square has an odd number of adjacent coloured squares? b) Is it possible to colour some squares in such a way that an odd number of them have exactly $4$ adjacent coloured squares and all the remaining coloured squares have exactly $2$ adjacent coloured squares? c) Is it possible to colour some squares in such a way that an odd number of them have exactly $2$ adjacent coloured squares and all the remaining coloured squares have exactly $4$ adjacent coloured squares?

A turtle runs away from an UFO with a speed of $0.2 \ m/s$. The UFO flies $5$ meters above the ground, with a speed of $20 \ m/s$. The UFO's path is a broken line, where after flying in a straight path of length $\ell$ (in meters) it may turn through for any acute angle $\alpha$ such that $\tan \alpha < \frac{\ell}{1000}$. When the UFO's center approaches within $13$ meters of the turtle, it catches the turtle. Prove that for any initial position the UFO can catch the turtle.

The vigilantes are a group of five superheroes, such that each one has one and only one of the following powers: hypnosis, super speed, shadow manipulation, immortality and super strength (each has a different power). On an adventure to the island of Philippines, they meet the sorcerer Vicencio, an old wise man who offers them the following ritual to help them: The ritual consists of a superhero $A$ acquiring the gift (s) of $B$ without $B$ acquiring the gift (s) of $A$. Determine the fewest number of rituals to be performed by the sorcerer Vicencio so that each superhero controls each of the five gifts. Clarification: At the end of the ritual, a superhero $A$ will have his gifts and those of a superhero $B$, but $B$ does not acquire those of $A$, but it does keep its own.

Find maximal value of positive integer $n$ such that there exists subset of $S=\{1,2,...,2001\}$ with $n$ elements, such that equation $y=2x$ does not have solutions in set $S \times S$

Assume that the following generating function equation is correct, prove the following statement: $\Pi_{i=1}^{\infty} (1+x^{3i})\Pi_{j=1}^{\infty} (1-x^{6j+3})=1$ Statement: The number of partitions of $n$ to numbers not of the form $6k+1$ or $6k-1$ is equal to the number of partitions of $n$ in which each summand appears at least twice. (10 points) [i]Proposed by Morteza Saghafian[/i]

In a school with double schooling, in the morning the language teacher divided the students into $200$ groups for an activity. In the afternoon, the math teacher divided the same students into $300$ groups for another activity. A student is considered [i]special[/i] if the group they belonged to in the afternoon is smaller than the group they belonged to in the morning. Find the minimum number of special students that can exist in the school. [b]Note:[/b] Each group has at least one student.

Given are $m\ge 3$ points in the plane. Prove that you can always choose three of these points $A,B,C$ such that $$\angle ABC \le \frac{180^o}{m}.$$

Milos arranged the numbers $1$ through $49$ into the cells of a $7\times7$ board. Djordje wants to guess the arrangement of the numbers. He can choose a square covering some cells of the board and ask Milos which numbers are found inside that square. At least, how many questions does Djordje need so as to be able to guess the arrangement of the numbers?

A graph $ G$ with $ n$ vertices is given. Some $ x$ of its edges are colored red so that each triangle has at most one red edge. The maximum number of vertices in $ G$ that induce a bipartite graph equals $ y.$ Prove that $ n\ge 4x/y.$