Let $n \geq 3$ be an integer. Consider the set $A=\{1,2,3,\ldots,n\}$, in each move, we replace the numbers $i, j$ by the numbers $i+j$ and $|i-j|$. After doing such moves all of the numbers are equal to $k$. Find all possible values for $k$.

Let $c\neq 1$ be a positive rational number. Show that it is possible to partition $\mathbb{N}$, the set of positive integers, into two disjoint nonempty subsets $A,B$ so that $x/y\neq c$ holds whenever $x$ and $y$ lie both in $A$ or both in $B$.

Let $ A \equal{} (a_{ij})$, where $ i,j \equal{} 1,2,\ldots,n$, be a square matrix with all $ a_{ij}$ non-negative integers. For each $ i,j$ such that $ a_{ij} \equal{} 0$, the sum of the elements in the $ i$th row and the $ j$th column is at least $ n$. Prove that the sum of all the elements in the matrix is at least $ \frac {n^2}{2}$.

If $5$ points are placed in the plane at lattice points (i.e. points $(x,y)$ where $x $and $y$ are both integers) such that no three are collinear, then there are $10$ triangles whose vertices are among these points. What is the minimum possible number of these triangles that have area greater than $1/2$?

For which positive integers $n \ge 3$ is it possible to mark $n$ points of a plane in such a way that, starting from one marked point and moving on each step to the marked point which is the second closest to the current point, one can walk through all the marked points and return to the initial one? For each point, the second closest marked point must be uniquely determined.

How many ways can we pick four $3$-element subsets of $\{1, 2, ..., 6\}$ so that each pair of subsets share exactly one element?

Consider the starting position in a game of bughouse. Exhibit a sequence of moves on both boards, indicating the chronology, such that at the end: (a) The positions on both boards are the same as the original positions. (b) It is White to play on one board, but Black to play on the other. (c) All four players still have the right to castle subsequently (equivalently, the kings and rooks haven’t moved). for each of the following cases : (a) without moving any pawns. (b) without moving any queen.

For even positive integer $n$ we put all numbers $1, 2, \cdots , n^2$ into the squares of an $n \times n$ chessboard (each number appears once and only once). Let $S_1$ be the sum of the numbers put in the black squares and $S_2$ be the sum of the numbers put in the white squares. Find all $n$ such that it is possible to have $\frac{S_1}{S_2}=\frac{39}{64}$.

Find the number of $n$-movement on the following graph, starting from $S$. [img]https://cdn.artofproblemsolving.com/attachments/2/0/4a23c83c7f5405575acbe6d09f202d87341337.png[/img]

A number of signal lights are equally spaced along a one-way railroad track, labeled in oder $ 1,2, \ldots, N, N \geq 2.$ As a safety rule, a train is not allowed to pass a signal if any other train is in motion on the length of track between it and the following signal. However, there is no limit to the number of trains that can be parked motionless at a signal, one behind the other. (Assume the trains have zero length.) A series of $ K$ freight trains must be driven from Signal 1 to Signal $ N.$ Each train travels at a distinct but constant spped at all times when it is not blocked by the safety rule. Show that, regardless of the order in which the trains are arranged, the same time will elapse between the first train's departure from Signal 1 and the last train's arrival at Signal $ N.$

[b]p1.[/b] What is $7\%$ of one half of $11\%$ of $20000$ ? [b]p2.[/b] Three circles centered at $A, B$, and $C$ are tangent to each other. Given that $AB = 8$, $AC = 10$, and $BC = 12$, find the radius of circle $ A$. [b]p3. [/b]How many positive integer values of $x$ less than $2012$ are there such that there exists an integer $y$ for which $\frac{1}{x} +\frac{2}{2y+1} =\frac{1}{y}$ ? [b]p4. [/b]The positive difference between $ 8$ and twice $x$ is equal to $11$ more than $x$. What are all possible values of $x$? [b]p5.[/b] A region in the coordinate plane is bounded by the equations $x = 0$, $x = 6$, $y = 0$, and $y = 8$. A line through $(3, 4)$ with slope $4$ cuts the region in half. Another line going through the same point cuts the region into fourths, each with the same area. What is the slope of this line? [b]p6.[/b] A polygon is composed of only angles of degrees $138$ and $150$, with at least one angle of each degree. How many sides does the polygon have? [b]p7.[/b] $M, A, T, H$, and $L$ are all not necessarily distinct digits, with $M \ne 0$ and $L \ne 0$. Given that the sum $MATH +LMT$, where each letter represents a digit, equals $2012$, what is the average of all possible values of the three-digit integer $LMT$? [b]p8. [/b]A square with side length $\sqrt{10}$ and two squares with side length $\sqrt{7}$ share the same center. The smaller squares are rotated so that all of their vertices are touching the sides of the larger square at distinct points. What is the distance between two such points that are on the same side of the larger square? [b]p9.[/b] Consider the sequence $2012, 12012, 20120, 20121, ...$. This sequence is the increasing sequence of all integers that contain “$2012$”. What is the $30$th term in this sequence? [b]p10.[/b] What is the coefficient of the $x^5$ term in the simplified expansion of $(x +\sqrt{x} +\sqrt[3]{x})^{10}$ ? PS. You had better use hide for answers.

The plane has been partitioned into $N$ regions by three bunches of parallel lines. What is the least number of lines needed in order that $N > 1981$?

[b]p1. [/b]Ed, Fred and George are playing on a see-saw that is slightly off center. When Ed sits on the left side and George, who weighs $100$ pounds, on the right side, they are perfectly balanced. Similarly, if Fred, who weighs $400$ pounds, sits on the left and Ed sits on the right, they are also perfectly balanced. Assuming the see-saw has negligible weight, what is the weight of Ed, in pounds? [b]p2.[/b] How many digits does the product $2^{42}\cdot 5^{38}$ have? [b]p3.[/b] Square $ABCD$ has equilateral triangles drawn external to each side, as pictured. If each triangle is folded upwards to meet at a point $E$, then a square pyramid can be made. If the center of square $ABCD$ is $O$, what is the measure of $\angle OEA$? [img]https://cdn.artofproblemsolving.com/attachments/9/a/39c0096ace5b942a9d3be1eafe7aa7481fbb9f.png[/img] [b]p4.[/b] How many solutions $(x, y)$ in the positive integers are there to $3x + 7y = 1337$ ? [b]p5.[/b] A trapezoid with height $12$ has legs of length $20$ and $15$ and a larger base of length $42$. What are the possible lengths of the other base? [b]p6.[/b] Let $f(x) = 6x + 7$ and $g(x) = 7x + 6$. Find the value of a such that $g^{-1}(f^{-1}(g(f(a)))) = 1$. [b]p7.[/b] Billy and Cindy want to meet at their favorite restaurant, and they have made plans to do so sometime between $1:00$ and $2:00$ this Sunday. Unfortunately, they didn’t decide on an exact time, so they both decide to arrive at a random time between $1:00$ and $2:00$. Silly Billy is impatient, though, and if he has to wait for Cindy, he will leave after $15$ minutes. Cindy, on the other hand, will happily wait for Billy from whenever she arrives until $2:00$. What is the probability that Billy and Cindy will be able to dine together? [b]p8.[/b] As pictured, lines are drawn from the vertices of a unit square to an opposite trisection point. If each triangle has legs with ratio $3 : 1$, what is the area of the shaded region? [img]https://cdn.artofproblemsolving.com/attachments/e/9/35a6340018edcddfcd7e085f8f6e56686a8e07.png[/img] [b]p9.[/b] For any positive integer $n$, let $f_1(n)$ denote the sum of the squares of the digits of $n$. For $k \ge 2$, let $f_k(n) = f_{k-1}(f_1(n))$. Then, $f_1(5) = 25$ and $f_3(5) = f_2(25) = 85$. Find $f_{2012}(15)$. [b]p10.[/b] Given that $2012022012$ has $ 8$ distinct prime factors, find its largest prime factor. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Jerry places at most one rook in each cell of a $2025 \times 2025$ grid of cells. A rook [i]attacks[/i] another rook if the two rooks are in the same row or column and there are no other rooks between them. Determine, with proof, the maximum number of rooks Jerry can place on the grid such that no rook attacks $4$ other rooks.

[u]Round 1[/u] [b]1.1.[/b] Suppose a certain menu has $3$ sandwiches and $5$ drinks. How many ways are there to pick a meal so that you have exactly a drink and a sandwich? [b]1.2.[/b] If $a + b = 4$ and $a + 3b = 222222$, find $10a + b$. [b]1.3.[/b] Compute $$\left\lfloor \frac{2019 \cdot 2017}{2018} \right\rfloor $$ where $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$. [u]Round 2[/u] [b]2.1.[/b] Andrew has $10$ water bottles, each of which can hold at most $10$ cups of water. Three bottles are thirty percent filled, five are twenty-four percent filled, and the rest are empty. What is the average amount of water, in cups, contained in the ten water bottles? [b]2.2.[/b] How many positive integers divide $195$ evenly? [b]2.3.[/b] Square $A$ has side length $\ell$ and area $128$. Square $B$ has side length $\ell/2$. Find the length of the diagonal of Square $B$. [u]Round 3[/u] [b]3.1.[/b] A right triangle with area $96$ is inscribed in a circle. If all the side lengths are positive integers, what is the area of the circle? Express your answer in terms of $\pi$. [b]3.2.[/b] A circular spinner has four regions labeled $3, 5, 6, 10$. The region labeled $3$ is $1/3$ of the spinner, $5$ is $1/6$ of the spinner, $6$ is $1/10$ of the spinner, and the region labeled $10$ is $2/5$ of the spinner. If the spinner is spun once randomly, what is the expected value of the number on which it lands? [b]3.3.[/b] Find the integer k such that $k^3 = 8353070389$ [u]Round 4[/u] [b]4.1.[/b] How many ways are there to arrange the letters in the word [b]zugzwang [/b] such that the two z’s are not consecutive? [b]4.2.[/b] If $O$ is the circumcenter of $\vartriangle ABC$, $AD$ is the altitude from $A$ to $BC$, $\angle CAB = 66^o$ and $\angle ABC = 44^o$, then what is the measure of $\angle OAD$ ? [b]4.3.[/b] If $x > 0$ satisfies $x^3 +\frac{1}{x^3} = 18$, find $x^5 +\frac{1}{x^5}$ [u]Round 5[/u] [b]5.1.[/b] Let $C$ be the answer to Question $3$. Neethen decides to run for school president! To be entered onto the ballot, however, Neethen needs $C + 1$ signatures. Since no one else will support him, Neethen gets the remaining $C$ other signatures through bribery. The situation can be modeled by $k \cdot N = 495$, where $k$ is the number of dollars he gives each person, and $N$ is the number of signatures he will get. How many dollars does Neethen have to bribe each person with to get exactly C signatures? [b]5.2.[/b] Let $A$ be the answer to Question $1$. With $3A - 1$ total votes, Neethen still comes short in the election, losing to Serena by just $1$ vote. Darn! Neethen sneaks into the ballot room, knowing that if he destroys just two ballots that voted for Serena, he will win the election. How many ways can Neethen choose two ballots to destroy? [b]5.3.[/b] Let $B$ be the answer to Question $2$. Oh no! Neethen is caught rigging the election by the principal! For his punishment, Neethen needs to run the perimeter of his school three times. The school is modeled by a square of side length $k$ furlongs, where $k$ is an integer. If Neethen runs $B$ feet in total, what is $k + 1$? (Note: one furlong is $1/8$ of a mile). [u]Round 6[/u] [b]6.1.[/b] Find the unique real positive solution to the equation $x =\sqrt{6 + 2\sqrt6 + 2x}- \sqrt{6 - 2\sqrt6 - 2x} -\sqrt6$. [b]6.2.[/b] Consider triangle ABC with $AB = 13$ and $AC = 14$. Point $D$ lies on $BC$, and the lengths of the perpendiculars from $D$ to $AB$ and $AC$ are both $\frac{56}{9}$. Find the largest possible length of $BD$. [b]6.3.[/b] Let $f(x, y) = \frac{m}{n}$, where $m$ is the smallest positive integer such that $x$ and $y$ divide $m$, and $n$ is the largest positive integer such that $n$ divides both $x$ and $y$. If $S = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$, what is the median of the distinct values that $f(a, b)$ can take, where $a, b \in S$? [u]Round 7[/u] [b]7.1.[/b] The polynomial $y = x^4 - 22x^2 - 48x - 23$ can be written in the form $$y = (x - \sqrt{a} - \sqrt{b} - \sqrt{c})(x - \sqrt{a} +\sqrt{b} +\sqrt{c})(x +\sqrt{a} -\sqrt{b} +\sqrt{c})(x +\sqrt{a} +\sqrt{b} -\sqrt{c})$$ for positive integers $a, b, c$ with $a \le b \le c$. Find $(a + b)\cdot c$. [b]7.2.[/b] Varun is grounded for getting an $F$ in every class. However, because his parents don’t like him, rather than making him stay at home they toss him onto a number line at the number $3$. A wall is placed at $0$ and a door to freedom is placed at $10$. To escape the number line, Varun must reach 10, at which point he walks through the door to freedom. Every $5$ minutes a bell rings, and Varun may walk to a different number, and he may not walk to a different number except when the bell rings. Being an $F$ student, rather than walking straight to the door to freedom, whenever the bell rings Varun just randomly chooses an adjacent integer with equal chance and walks towards it. Whenever he is at $0$ he walks to $ 1$ with a $100$ percent chance. What is the expected number of times Varun will visit $0$ before he escapes through the door to freedom? [b]7.3.[/b] Let $\{a_1, a_2, a_3, a_4, a_5, a_6\}$ be a set of positive integers such that every element divides $36$ under the condition that $a_1 < a_2 <... < a_6$. Find the probability that one of these chosen sets also satisfies the condition that every $a_i| a_j$ if $i|j$. [u]Round 8[/u] [b]8.[/b] How many numbers between $1$ and $100, 000$ can be expressed as the product of at most $3$ distinct primes? Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are 2000 cities in a country and no roads. Prove that some cities can be connected by a road such that there would be 2 cities with 1 road passing through them, there would be 2 cities with 2 roads passim through them,...,there would be 2 cities with 1000 roads passing through them. [I]Proposed by F. Bakharev[/i]

Take $k\in \mathbb{Z}_{\ge 1}$ and the sets $A_1,A_2,\dots, A_k$ consisting of $x_1,x_2,\dots ,x_k$ positive integers, respectively. For any two sets $A$ and $B$, define $A+B=\{a+b~|~a\in A,~b\in B\}$. Find the least and greatest number of elements the set $A_1+A_2+\dots +A_k$ may have. [i] (Andrei Bâra)[/i]

In each cell of a $4 \times 4$ table a digit $1$ or $2$ is written. Suppose that the sum of the digits in each of the four $3 \times 3$ sub-tables is divisible by $4$, but the sum of the digits in the entire table is not divisible by $4$. Find the greatest and the smallest possible value of the sum of the $16$ digits.

Let $p$ be a given prime number. For positive integers $n,k\geq2$ let $S_1, S_2,\dots, S_n$ be unit square sets constructed by choosing exactly one unit square from each of the columns from $p\times k$ chess board. If $|S_i \cap S_j|=1$ for all $1\leq i < j \leq n$ and for any duo of unit squares which are located at different columns there exists $S_i$ such that both of these unit squares are in $S_i$ find all duos of $(n,k)$ in terms of $p$. Note: Here we denote the number of rows by $p$ and the number of columns by $k$.

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

In a certain city there are $n$ straight streets, such that every two streets intersect, and no three streets pass through the same intersection. The City Council wants to organize the city by designating the main and the side street on every intersection. Prove that this can be done in such way that if one goes along one of the streets, from its beginning to its end, the intersections where this street is the main street, and the ones where it is not, will apear in alternating order. [i]Proposed by Serbia[/i]

Two points are selected in a convex pentagon. Prove that you can choose a quadrilateral with vertices at the vertices of a pentagon so that both selected points fall into it.

The localities $P_1, P_2, \dots, P_{1983}$ are served by ten international airlines $A_1,A_2, \dots , A_{10}$. It is noticed that there is direct service (without stops) between any two of these localities and that all airline schedules offer round-trip flights. Prove that at least one of the airlines can offer a round trip with an odd number of landings.

A sequence of $2n + 1$ non-negative integers $a_1, a_2, ..., a_{2n + 1}$ is given. There's also a sequence of $2n + 1$ consecutive cells enumerated from $1$ to $2n + 1$ from left to right, such that initially the number $a_i$ is written on the $i$-th cell, for $i = 1, 2, ..., 2n + 1$. Starting from this initial position, we repeat the following sequence of steps, as long as it's possible: [i]Step 1[/i]: Add up the numbers written on all the cells, denote the sum as $s$. [i]Step 2[/i]: If $s$ is equal to $0$ or if it is larger than the current number of cells, the process terminates. Otherwise, remove the $s$-th cell, and shift shift all cells that are to the right of it one position to the left. Then go to Step 1. Example: $(1, 0, 1, \underline{2}, 0) \rightarrow (1, \underline{0}, 1, 0) \rightarrow (1, \underline{1}, 0) \rightarrow (\underline{1}, 0) \rightarrow (0)$. A sequence $a_1, a_2,. . . , a_{2n+1}$ of non-negative integers is called balanced, if at the end of this process there’s exactly one cell left, and it’s the cell that was initially enumerated by $(n + 1)$, i.e. the cell that was initially in the middle. Find the total number of balanced sequences as a function of $n$. [i]Proposed by Viktor Simjanoski, North Macedonia[/i]

A rectangular board, where in each square there is a symbol, is said to be [i]magnificent [/i] if, for each line$ L$ and for each pair of columns $C$ and $D$, there is on the board another line $M$ exactly equal to $L$, except in columns $C$ and $D$, where $M$ has symbols different from those of $L$. What is the smallest possible number of rows on a magnificent board with $2023$ columns?