For each positive integer $n$, decide whether it is possible to tile a square with exactly $n+1$ similar rectangles, each with a positive area and aspect ratio $1:n$.

[b]p1.[/b] Given a group of $n$ people. An $A$-list celebrity is one that is known by everybody else (that is, $n - 1$ of them) but does not know anybody. A $B$-list celebrity is one that is known by exactly $n - 2$ people but knows at most one person. (a) What is the maximum number of $A$-list celebrities? You must prove that this number is attainable. (b) What is the maximum number of $B$-list celebrities? You must prove that this number is attainable. [b]p2.[/b] A polynomial $p(x)$ has a remainder of $2$, $-13$ and $5$ respectively when divided by $x+1$, $x-4$ and $x-2$. What is the remainder when $p(x)$ is divided by $(x + 1)(x - 4)(x - 2)$? [b]p3.[/b] (a) Let $x$ and y be positive integers satisfying $x^2 + y = 4p$ and $y^2 + x = 2p$, where $p$ is an odd prime number. Prove: $x + y = p + 1$. (b) Find all values of $x, y$ and $p$ that satisfy the conditions of part (a). You will need to prove that you have found all such solutions. [b]p4.[/b] Let function $f(x, y, z)$ be defined as following: $$f(x, y, z) = \cos^2(x - y) + \cos^2(y - z) + \cos^2(z - x), x, y, z \in R.$$ Find the minimum value and prove the result. [b]p5.[/b] In the diagram below, $ABC$ is a triangle with side lengths $a = 5$, $b = 12$,$ c = 13$. Let $P$ and $Q$ be points on $AB$ and $AC$, respectively, chosen so that the segment $PQ$ bisects the area of $\vartriangle ABC$. Find the minimum possible value for the length $PQ$. [img]https://cdn.artofproblemsolving.com/attachments/b/2/91a09dd3d831b299b844b07cd695ddf51cb12b.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url]. Thanks to gauss202 for sending the problems.

$10$ rectangles have their vertices lie on a circle. The vertices divide the circle into $40$ equal arcs. Prove that two of the rectangles are congruent. [i]Proposed by Evan Chang (squareman), USA[/i]

Let $a_1,a_2,\cdots$ be a strictly increasing sequence on positive integers. Is it always possible to partition the set of natural numbers $\mathbb{N}$ into infinitely many subsets with infinite cardinality $A_1,A_2,\cdots$, so that for every subset $A_i$, if we denote $b_1<b_2<\cdots$ be the elements of $A_i$, then for every $k\in \mathbb{N}$ and for every $1\le i\le a_k$, it satisfies $b_{i+1}-b_{i}\le k$?

Sean is a biologist, and is looking at a strng of length $66$ composed of the letters $A$, $T$, $C$, $G$. A [i]substring[/i] of a string is a contiguous sequence of letters in the string. For example, the string $AGTC$ has $10$ substrings: $A$, $G$, $T$, $C$, $AG$, $GT$, $TC$, $AGT$, $GTC$, $AGTC$. What is the maximum number of distinct substrings of the string Sean is looking at?

A version of billiards is played on a right triangular table, with a pocket in each of the three corners, and one of the acute angles being $30^o$. A ball is played from just in front of the pocket at the $30^o$. vertex toward the midpoint of the opposite side. Prove that if the ball is played hard enough, it will land in the pocket of the $60^o$ vertex after $8$ reflections.

Let $n$ be a positive integer, where $n \geq 3$ and let $a_1, a_2, ..., a_n$ be the lengths of sides of some $n$-gon. Prove that $$a_1 + a_2 + ... + a_n \geq \sqrt{2 \cdot (a_1^2 + a_2^2 + ... + a_n^2)} $$

[b]p1.[/b] Suppose that Yunseo wants to order a pizza that is cut into $4$ identical slices. For each slice, there are $2$ toppings to choose from: pineapples and apples. Each slice must have exactly one topping. How many distinct pizzas can Yunseo order? Pizzas that can be obtained by rotating one pizza are considered the same. [b]p2.[/b] How many triples of distinct positive integers $(E, M, C)$ are there such that $E = MC^2$ and $E \le 50$? [b]p3.[/b] Given that the cubic polynomial $p(x)$ has leading coefficient $1$ and satisfies $p(0) = 0$, $p(1) = 1$, and $p(2) = 2$. Find $p(3)$. [b]p4.[/b] Olaf asks Anna to guess a two-digit number and tells her that it’s a multiple of $7$ with two distinct digits. Anna makes her first guess. Olaf says one digit is right but in the wrong place. Anna adjusts her guess based on Olaf’s comment, but Olaf answers with the same comment again. Anna now knows what the number is. What is the sum of all the numbers that Olaf could have picked? [b]p5.[/b] Vincent the Bug draws all the diagonals of a regular hexagon with area $720$, splitting it into many pieces. Compute the area of the smallest piece. [b]p6.[/b] Given that $y - \frac{1}{y} = 7 + \frac{1}{7}$, compute the least integer greater than $y^4 + \frac{1}{y^4}$. [b]p7.[/b] At $9:00$ A.M., Joe sees three clouds in the sky. Each hour afterwards, a new cloud appears in the sky, while each old cloud has a $40\%$ chance of disappearing. Given that the expected number of clouds that Joe will see right after $1:00$ P.M. can be written in the form $p/q$ , where $p$ and $q$ are relatively prime positive integers, what is $p + q$? [b]p8.[/b] Compute the unique three-digit integer with the largest number of divisors. [b]p9.[/b] Jo has a collection of $101$ books, which she reads one each evening for $101$ evenings in a predetermined order. In the morning of each day that Jo reads a book, Amy chooses a random book from Jo’s collection and burns one page in it. What is the expected number of pages that Jo misses? [b]p10.[/b] Given that $x, y, z$ are positive real numbers satisfying $2x + y = 14 - xy$, $3y + 2z = 30 - yz$, and $z + 3x = 69 - zx$, the expression $x + y + z$ can be written as $p\sqrt{q} - r$, where $p, q, r$ are positive integers and $q$ is not divisible by the square of any prime. Compute $p + q + r$. [b]p11.[/b] In rectangle $TRIG$, points $A$ and $L$ lie on sides $TG$ and $TR$ respectively such that $TA = AG$ and $TL = 2LR$. Diagonal $GR$ intersects segments $IL$ and $IA$ at $B$ and $E$ respectively. Suppose that the area of the convex pentagon with vertices $TABLE$ is equal to $21$. What is the area of $TRIG$? [b]p12.[/b] Call a number nice if it can be written in the form $2^m \cdot 3^n$, where $m$ and $n$ are nonnegative integers. Vincent the Bug fills in a $3$ by $3$ grid with distinct nice numbers, such that the product of the numbers in each row and each column are the same. What is the smallest possible value of the largest number Vincent wrote? [b]p13.[/b] Let $s(n)$ denote the sum of digits of positive integer $n$ and define $f(n) = s(202n) - s(22n)$. Given that $M$ is the greatest possible value of $f(n)$ for $0 < n < 350$ and $N$ is the least value such that $f(N) = M$, compute $M + N$. [b]p14.[/b] In triangle $ABC$, let M be the midpoint of $BC$ and let $E, F$ be points on $AB, AC$, respectively, such that $\angle MEF = 30^o$ and $\angle MFE = 60^o$. Given that $\angle A = 60^o$, $AE = 10$, and $EB = 6$,compute $AB + AC$. [b]p15.[/b] A unit cube moves on top of a $6 \times 6$ checkerboard whose squares are unit squares. Beginning in the bottom left corner, the cube is allowed to roll up or right, rolling about its bottom edges to travel from square to square, until it reaches the top right corner. Given that the side of the cube facing upwards in the beginning is also facing upwards after the cube reaches the top right corner, how many total paths are possible? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

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$.

In how many ways can you choose several numbers from the numbers $1,2,3,..., 11$ so that among the selected numbers there are not three consecutive numbers?

There are $100$ students who praticipate at exam.Also there are $25$ members of jury.Each student is checked by one jury.Known that every student likes $10$ jury $a)$ Prove that we can select $7$ jury such that any student likes at least one jury. $b)$ Prove that we can make this every student will be checked by the jury that he likes and every jury will check at most $10$ students.

In the picture below, a white square is surrounded by four black squares and three white squares. They are surrounded by seven black squares. [img]https://i.stack.imgur.com/Dalmm.png[/img] What is the maximum number of white squares that can be surrounded by $ n $ black squares?

We write $1$ or $-1$ on each unit square of a $2007 \times 2007$ board. Find the number of writings such that for every square on the board the absolute value of the sum of numbers on the square is less then or equal to $1$.

Among a set of $32$ coins , all identical in appearance, $30$ are real and $2$ are fake. Any two real coins have the same weight . The fake coins have the same weight , which is different from the weight of a real coin. How can one divide the coins into two groups of equal total weight by using a balance at most $4$ times? (A Shapovalov)

4 tokens are placed in the plane. If the tokens are now at the vertices of a convex quadrilateral $P$, then the following move could be performed: choose one of the tokens and shift it in the direction perpendicular to the diagonal of $P$ not containing this token; while shifting tokens it is prohibited to get three collinear tokens. Suppose that initially tokens were at the vertices of a rectangle $\Pi$, and after a number of moves tokens were at the vertices of one another rectangle $\Pi'$ such that $\Pi'$ is similar to $\Pi$ but not equal to $\Pi $. Prove that $\Pi$ is a square.

$2^{n-1}$ subsets are choosen from a set with $n$ elements, such that every three of these subsets have an element in common. Show that all subsets have an element in common.

There are $N$ monsters, each with a positive weight. On each step, two of the monsters are merged into one, whose weight is the sum of weights for the two original monsters. At the end, all monsters will be merged into one giant monster. During this process, if at any mergence, one of the two monsters has a weight greater than $2.020$ times the other monster's weight, we will call this mergence [b]dangerous[/b]. The dangerous level of a sequence of mergences is the number of dangerous mergence throughout its process. Prove that, no matter how the weights being distributed among the monsters, "for every step, merge the lightest two monsters" is always one of the merging sequences that obtain the minimum possible dangerous level. [i]Proposed by houkai[/i]

A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$

Find the greatest natural number $N$ such that, for any arrangement of the numbers $1, 2, \ldots, 400$ in a chessboard $20 \times 20$, there exist two numbers in the same row or column, which differ by at least $N.$

Ten points are marked in the plane so that no three of them lie on a line. Each pair of points is connected with a segment. Each of these segments is painted with one of $k$ colors, in such a way that for any $k$ of the ten points, there are $k$ segments each joining two of them and no two being painted with the same color. Determine all integers $k$, $1\leq k\leq 10$, for which this is possible.

a) What is the least number of points that can be chosen on a circle of length $1956$, so that for each of these points there is exactly one chosen point at distance $1$, and exactly one chosen point at distance $2$ (distances are measured along the circle)? b) On a circle of length $15$ there are selected $n$ points such that for each of them there is exactly one selected point at distance $1$ from it, and exactly one is selected point at distance $2$ from it. (All distances are measured along the circle.) Prove that $n$ is divisible by $10$.

Each two of $n$ students, who attended an activity, have different ages. It is given that each student shook hands with at least one student, who did not shake hands with anyone younger than the other. Find all possible values of $n$.

Given a set $S_n = \{1, 2, 3, \ldots, n\}$, we define a [i]preference list[/i] to be an ordered subset of $S_n$. Let $P_n$ be the number of preference lists of $S_n$. Show that for positive integers $n > m$, $P_n - P_m$ is divisible by $n - m$. [i]Note: the empty set and $S_n$ are subsets of $S_n$.[/i]

Let $n\geq 2$ be a positive integer. We call a [i]vertex[/i] every point in the coordinate plane, whose $x$ and $y$ coordinates both are from the set $\{1,2,3,...,n\}$. We call a segment between two vertices an [i]edge[/i], if its length if $1$. We've colored some edges red, such that between any two vertices, there is a unique path of red edges (a path may contain each edge at most once). The red edge $f$ is [i]vital[/i] for an edge $e$, if the path of red edges connecting the two endpoints of $e$ contain $f$. Prove that there is a red edge, such that it is vital for at least $n$ edges.

A $2010\times 2010$ board is divided into corner-shaped figures of three cells. Prove that it is possible to mark one cell in each figure such that each row and each column will have the same number of marked cells. [i]I. Bogdanov & O. Podlipsky[/i]