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.

Let $r$ be a positive integer. Find the smallest positive integer $m$ satisfying the condition: For all sets $A_1, A_2, \dots, A_r$ with $A_i \cap A_j = \emptyset$, for all $i \neq j$, and $\bigcup_{k = 1}^{r} A_k = \{ 1, 2, \dots, m \}$, there exists $a, b \in A_k$ for some $k$ such that $1 \leq \frac{b}{a} \leq 1 + \frac{1}{2022}$.

A stage course is attended by $n \ge 4$ students. The day before the final exam, each group of three students conspire against another student to throw him/her out of the exam. Prove that there is a student against whom there are at least $\sqrt[3]{(n-1)(n- 2)} $conspirators.

$5$ airway companies operate in a country consisting of $36$ cities. Between any pair of cities exactly one company operates two way flights. If some air company operates between cities $A, B$ and $B, C$ we say that the triple $A, B, C$ is [i]properly-connected[/i]. Determine the largest possible value of $k$ such that no matter how these flights are arranged there are at least $k$ properly-connected triples.

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]

For which $n{}$ can we partition a regular $n{}$-gon into finitely many triangles such that no two triangles share a side? [i]Based on a problem of the 2017 Miklós Schweitzer competition[/i]

[u]Townspeople and Goons[/u] In the city of Lincoln, there is an empty jail, at least two townspeople and at least one goon. A game proceeds over several days, starting with morning. $\bullet$ Each morning, one randomly selected unjailed person is placed in jail. If at this point all goons are jailed, and at least one townsperson remains, then the townspeople win. If at this point all townspeople are jailed and at least one goon remains, then the goons win. $\bullet$ Each evening, if there is at least one goon and at least one townsperson not in jail, then one randomly selected townsperson is jailed. If at this point there are at least as many goons remaining as townspeople remaining, then the goons win. The game ends immediately after any group wins. [b]p1. [/b]Find the probability that the townspeople win if there are initially two townspeople and one goon. [b]p2.[/b] Find the smallest positive integer $n$ such that, if there are initially $2n$ townspeople and $1$ goon, then the probability the townspeople win is greater than $50\%$. [b]p3.[/b] Find the smallest positive integer $n$ such that, if there are initially $n + 1$ townspeople and $n$ goons, then the probability the townspeople win is less than $1\%$. [b]p4[/b]. Suppose there are initially $1001$ townspeople and two goons. What is the probability that, when the game ends, there are exactly $1000$ people in jail? [b]p5.[/b] Suppose that there are initially eight townspeople and one goon. One of the eight townspeople is named Jester. If Jester is sent to jail during some morning, then the game ends immediately in his sole victory. (However, the Jester does not win if he is sent to jail during some night.) Find the probability that only the Jester wins.

In how many ways can you choose $ k $ squares on a chessboard $ n \times n $ ( $ k \leq n $) so that no two of the chosen squares lie in the same row or column?

Prove the following identity for every $ n\in N$: $ \sum_{j\plus{}h\equal{}n,j\geq h}\frac{(\minus{}1)^h2^{j\minus{}h}\binom{j}{h}}{j}\equal{}\frac{2}{n}$

To each point of $\mathbb{Z}^3$ we assign one of $p$ colors. Prove that there exists a rectangular parallelepiped with all its vertices in $\mathbb{Z}^3$ and of the same color.

The $27$ points $(a,b,c)$ of the space are marked such that $a$, $b$ and $c$ take the values $0$, $1$ or $2$. We will call these points "junctures". Using $54$ rods of length $1$, all the joints that are at a distance of $1$ are joined together. A cubic structure of $2\times 2\times 2$ is thus formed. An ant starts from a juncture $A$ and moves along the rods; When it reaches a juncture it turns $90^\circ$ and changes rod. If the ant returns to $A$ and has not visited any juncture more than once except $A$, which it visited $2$ times, at the beginning of the walk and at the end of it, what is the greatest length that the path of the ant can have?

$60$ symbols, each of which is either $X$ or $O$, are written consecutively on a strip of paper. This strip must then be cut into pieces with each piece containing symbols symmetric about their centre, e.g. $O, XX, OXXXXX, XOX$, etc. (a) Prove that there is a way of cutting the strip so that there are no more than $24$ such pieces. (b) Give an example of such an arrangement of the signs for which the number of pieces cannot be less than $15$. (c) Try to improve the result of (b).

How many squares different in size or location can be drawn on an $8 \times 8$ chess board? Each square drawn must consist of whole chess board’s squares.

Given some red and blue points. Some of them are connected by the segments. Let us call "exclusive" the point, if its colour differs from the colour of more than half of the connected points. Every move one arbitrary "exclusive" point is repainted to the other colour. Prove that after the finite number of moves there will remain no "exclusive" points.

[b]p1.[/b] An organization decides to raise funds by holding a $\$60$ a plate dinner. They get prices from two caterers. The first caterer charges $\$50$ a plate. The second caterer charges according to the following schedule: $\$500$ set-up fee plus $\$40$ a plate for up to and including $61$ plates, and $\$2500$ $\log_{10}\left(\frac{p}{4}\right)$ for $p > 61$ plates. a) For what number of plates $N$ does it become at least as cheap to use the second caterer as the first? b) Let $N$ be the number you found in a). For what number of plates $X$ is the second caterer's price exactly double the price for $N$ plates? c) Let $X$ be the number you found in b). When X people appear for the dinner, how much profit does the organization raise for itself by using the second caterer? [b]p2.[/b] Let $N$ be a positive integer. Prove the following: a) If $N$ is divisible by $4$, then $N$ can be expressed as the sum of two or more consecutive odd integers. b) If $N$ is a prime number, then $N$ cannot be expressed as the sum of two or more consecutive odd integers. c) If $N$ is twice some odd integer, then $N$ cannot be expressed as the sum of two or more consecutive odd integers. [b]p3.[/b] Let $S =\frac{1}{1^2} +\frac{1}{2^2}+\frac{1}{3^2}+\frac{1}{4^2}+...$ a) Find, in terms of $S$, the value of $S =\frac{1}{2^2} +\frac{1}{4^2}+\frac{1}{6^2}+\frac{1}{8^2}+...$ b) Find, in terms of $S$, the value of$S =\frac{1}{1^2} +\frac{1}{3^2}+\frac{1}{5^2}+\frac{1}{7^2}+...$ c) Find, in terms of $S$, the value of$S =\frac{1}{1^2} -\frac{1}{2^2}+\frac{1}{3^2}-\frac{1}{4^2}+...$ [b]p4.[/b] Let $\{P_1, P_2, P_3, ...\}$ be an infinite set of points on the $x$-axis having positive integer coordinates, and let $Q$ be an arbitrary point in the plane not on the $x$-axis. Prove that infinitely many of the distances $|P_iQ|$ are not integers. a) Draw a relevant picture. b) Provide a proof. [b]p5.[/b] Point $P$ is an arbitrary point inside triangle $ABC$. Points $X$, $Y$ , and $Z$ are constructed to make segments $PX$, $PY$ , and $PZ$ perpendicular to $AB$, $BC$, and $CA$, respectively. Let $x$, $y$, and $z$ denote the lengths of the segments $PX$, $PY$ , and $PZ$, respectively. a) If triangle $ABC$ is an equilateral triangle, prove that $x + y + z$ does not change regardless of the location of $P$ inside triangle ABC. b) If triangle $ABC$ is an isosceles triangle with $|BC| = |CA|$, prove that $x + y + z$ does not change when $P$ moves along a line parallel to $AB$. c) Now suppose that triangle $ABC$ is scalene (i.e., $|AB|$, $|BC|$, and $|CA|$ are all different). Prove that there exists a line for which $x+y+z$ does not change when $P$ moves along this line. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\triangle ABC$ be a triangle, and let $P_1,\cdots,P_n$ be points inside where no three given points are collinear. Prove that we can partition $\triangle ABC$ into $2n+1$ triangles such that their vertices are among $A,B,C,P_1,\cdots,P_n$, and at least $n+\sqrt{n}+1$ of them contain at least one of $A,B,C$.

Player $A$ places an odd number of boxes around a circle and distributes $2013$ balls into some of these boxes. Then the player $B$ chooses one of these boxes and takes the balls in it. After that the player $A$ chooses half of the remaining boxes such that none of two are consecutive and take the balls in them. If player $A$ guarantees to take $k$ balls, find the maximum possible value of $k$.

[i]25 problems for 30 minutes[/i] [b]p1.[/b] Compute the sum $2019 + 201 + 20 + 2$. [b]p2.[/b] The sequence $100, 102, 104,..., 996$ and $998$ is the sequence of all three-digit even numbers. How many three digit even numbers are there? [b]p3.[/b] Find the units digit of $25\times 37\times 113\times 22$. [b]p4.[/b] Samuel has a number in his head. He adds $4$ to the number and then divides the result by $2$. After doing this, he ends up with the same number he had originally. What is his original number? [b]p5.[/b] According to Shay's Magazine, every third president is terrible (so the third, sixth, ninth president and so on were all terrible presidents). If there have been $44$ presidents, how many terrible presidents have there been in total? [b]p6.[/b] In the game Tic-Tac-Toe, a player wins by getting three of his or her pieces in the same row, column, or diagonal of a $3\times 3$ square. How many configurations of $3$ pieces are winning? Rotations and reflections are considered distinct. [b]p7.[/b] Eddie is a sad man. Eddie is cursed to break his arm $4$ times every $20$ years. How many times would he break his arm by the time he reaches age $100$? [b]p8. [/b]The figure below is made from $5$ congruent squares. If the figure has perimeter $24$, what is its area? [img]https://cdn.artofproblemsolving.com/attachments/1/9/6295b26b1b09cacf0c32bf9d3ba3ce76ddb658.png[/img] [b]p9.[/b] Sancho Panza loves eating nachos. If he eats $3$ nachos during the first minute, $4$ nachos during the second, $5$ nachos during the third, how many nachos will he have eaten in total after $15$ minutes? [b]p10.[/b] If the day after the day after the day before Wednesday was two days ago, then what day will it be tomorrow? [b]p11.[/b] Neetin the Rabbit and Poonam the Meerkat are in a race. Poonam can run at $10$ miles per hour, while Neetin can only hop at $2$ miles per hour. If Neetin starts the race $2$ miles ahead of Poonam, how many minutes will it take for Poonam to catch up with him? [b]p12.[/b] Dylan has a closet with t-shirts: $3$ gray, $4$ blue, $2$ orange, $7$ pink, and $2$ black. Dylan picks one shirt at random from his closet. What is the probability that Dylan picks a pink or a gray t-shirt? [b]p13.[/b] Serena's brain is $200\%$ the size of Eric's brain, and Eric's brain is $200\%$ the size of Carlson's. The size of Carlson's brain is what percent the size of Serena's? [b]p14.[/b] Find the sum of the coecients of $(2x + 1)^3$ when it is fully expanded. [b]p15. [/b]Antonio loves to cook. However, his pans are weird. Specifically, the pans are rectangular prisms without a top. What is the surface area of the outside of one of Antonio's pans if their volume is $210$, and their length and width are $6$ and $5$, respectively? [b]p16.[/b] A lattice point is a point on the coordinate plane with $2$ integer coordinates. For example, $(3, 4)$ is a lattice point since $3$ and $4$ are both integers, but $(1.5, 2)$ is not since $1.5$ is not an integer. How many lattice points are on the graph of the equation $x^2 + y^2 = 625$? [b]p17.[/b] Jonny has a beaker containing $60$ liters of $50\%$ saltwater ($50\%$ salt and $50\%$ water). Jonny then spills the beaker and $45$ liters pour out. If Jonny adds $45$ liters of pure water back into the beaker, what percent of the new mixture is salt? [b]p18.[/b] There are exactly 25 prime numbers in the set of positive integers between $1$ and $100$, inclusive. If two not necessarily distinct integers are randomly chosen from the set of positive integers from $1$ to $100$, inclusive, what is the probability that at least one of them is prime? [b]p19.[/b] How many consecutive zeroes are at the end of $12!$ when it is expressed in base $6$? [b]p20.[/b] Consider the following figure. How many triangles with vertices and edges from the following figure contain exactly $1$ black triangle? [img]https://cdn.artofproblemsolving.com/attachments/f/2/a1c400ff7d06b583c1906adf8848370e480895.png[/img] [b]p21.[/b] After Akshay got kicked o the school bus for rowdy behavior, he worked out a way to get home from school with his dad. School ends at $2:18$ pm, but since Akshay walks slowly he doesn't get to the front door until $2:30$. His dad doesn't like to waste time, so he leaves home everyday such that he reaches the high school at exactly $2:30$ pm, instantly picks up Akshay and turns around, then drives home. They usually get home at $3:30$ pm. However, one day Akshay left school early at exactly $2:00$ pm because he was expelled. Trying to delay telling his dad for as long as possible, Akshay starts jogging home. His dad left home at the regular time, saw Akshay on the way, picked him up and turned around instantly. They then drove home while Akshay's dad yelled at him for being a disgrace. They reached home at $3:10$ pm. How long had Akshay been walking before his dad picked him up? [b]p22.[/b] In quadrilateral $ABCD$, diagonals $AC$ and $BD$ intersect at $O$. Then $\angle BOC = \angle BCD$, $\angle COD =\angle BAD$, $AB = 4$, $DC = 6$, and $BD = 5$. What is the length of $BO$? [b]p23.[/b] A standard six-sided die is rolled. The number that comes up first determines the number of additional times the die will be rolled (so if the first number is $3$, then the die will be rolled $3$ more times). Each time the die is rolled, its value is recorded. What is the expected value of the sum of all the rolls? [b]p24.[/b] Dora has a peculiar calculator that can only perform $2$ operations: either adding $1$ to the current number or squaring the current number. Each minute, Dora randomly chooses an operation to apply to her number. She starts with $0$. What is the expected number of minutes it takes Dora's number to become greater than or equal to $10$? [b]p25.[/b] Let $\vartriangle ABC$ be such that $AB = 2$, $BC = 1$, and $\angle ACB = 90^o$. Let points $D$ and $E$ be such that $\vartriangle ADE$ is equilateral, $D$ is on segment $\overline{BC}$, and $D$ and $E$ are not on the same side of $\overline{AC}$. Segment $\overline{BE}$ intersects the circumcircle of $\vartriangle ADE$ at a second point $F$. If $BE =\sqrt{6}$, find the length of $\overline{BF}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $S$ be the sum of integer weights that come with a two pan balance Scale, say $\omega_1 \le \omega_2 \le \omega_3 \le ... \le\omega_n$. Show that all integer-weighted objects in the range $1$ to $S$ can be weighed exactly if and only if $\omega_1=1$ and $$\omega_{j+1} \le 2 \left( \sum_{l=1}^{j} \omega_l\right) +1$$

[b]p1.[/b] Find the unknown angle $a$ of the triangle inscribed in the square. [img]https://cdn.artofproblemsolving.com/attachments/b/1/4aab5079dea41637f2fa22851984f886f034df.png[/img] [b]p2.[/b] Draw a polygon in the plane and a point outside of it with the following property: no edge of the polygon is completely visible from that point (in other words, the view is obstructed by some other edge). [b]p3.[/b] This problem has two parts. In each part, $2022$ real numbers are given, with some additional property. (a) Suppose that the sum of any three of the given numbers is an integer. Show that the total sum of the $2022$ numbers is also an integer. (b) Suppose that the sum of any five of the given numbers is an integer. Show that 5 times the total sum of the $2022$ numbers is also an integer, but the sum itself is not necessarily an integer. [b]p4.[/b] Replace stars with digits so that the long multiplication in the example below is correct. [img]https://cdn.artofproblemsolving.com/attachments/9/7/229315886b5f122dc0675f6d578624e83fc4e0.png[/img] [b]p5.[/b] Five nodes of a square grid paper are marked (called marked points). Show that there are at least two marked points such that the middle point of the interval connecting them is also a node of the square grid paper [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=\dfrac{8}{3} \\ \dfrac{yz}{y+z}=\dfrac{12}{5} \\\dfrac{xz}{x+z}=\dfrac{24}{7} \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A lame rook lies on a $9\times 9$ chessboard. It can move one cell horizontally or vertically. The rook made $n{}$ moves, visited each cell at most once, and did not make two moves consecutively in the same direction. What is the largest possible value of $n{}$? [i]From the folklore[/i]

Is it possible to complete the following square knowning that each row and column make an aritmetic progression?

The numbers from $1$ to $2025$ are arranged in some order in the cells of the $1 \times 2025$ strip. Let's call a [i]flip[/i] an operation that takes two arbitrary cells of a strip and swaps the numbers written in them, but only if the larger of these numbers is located to the left of the smaller one. A [i]flop[/i] is a set of several flips that do not contain common cells that are executed simultaneously. (For example, a simultaneous flip between the 2nd and 8th cells and a flip between the 5th and 101st cells.) Prove that there exists a sequence of $66$ flops such that for any initial arrangement, applying this sequence of flops to it will result in the numbers being ordered from left to right in ascending order.

In the movie ”Prison break $4$”. Michael Scofield has to break into The Company. There, he encountered a kind of code to protect Scylla from being taken away. This code require picking out every number in a $2015\times 2015$ grid satisfying: i) The number right above of this number is $\equiv 1 \mod 2$ ii) The number right on the right of this number is $\equiv 2 \mod 3$ iii) The number right below of this number is $\equiv 3 \mod 4$ iv) The number right on the right of this number is $\equiv 4 \mod 5$ . How many number does Schofield have to choose? Also, in a $n\times n$ grid, the numbers from $ 1$ to $n^2$ are arranged in the following way : On the first row, the numbers are written in an ascending order $1, 2, 3, 4, ..., n$, each cell has one number. On the second row, the number are written in descending order $2n, 2n -1, 2n- 2, ..., n + 1$. On the third row, it is ascending order again $2n + 1, 2n + 2, ..., 3n$. The numbers are written like that until $n$th row. For example, this is how a $3$ $\times$ $3$ board looks like:[img]https://cdn.artofproblemsolving.com/attachments/8/7/0a5c8aba6543fd94fd24ae4b9a30ef8a32d3bd.png[/img]

[hide=C stands for Cantor, G stands for Gauss]they had two problem sets under those two names[/hide] [b]C1.[/b] Mr. Pham flips $2018$ coins. What is the difference between the maximum and minimum number of heads that can appear? [b]C2 / G1.[/b] Brandon wants to maximize $\frac{\Box}{\Box} +\Box$ by placing the numbers $1$, $2$, and $3$ in the boxes. If each number may only be used once, what is the maximum value attainable? [b]C3.[/b] Guang has $10$ cents consisting of pennies, nickels, and dimes. What are all the possible numbers of pennies he could have? [b]C4.[/b] The ninth edition of Campbell Biology has $1464$ pages. If Chris reads from the beginning of page $426$ to the end of page$449$, what fraction of the book has he read? [b]C5 / G2.[/b] The planet Vriky is a sphere with radius $50$ meters. Kyerk starts at the North Pole, walks straight along the surface of the sphere towards the equator, runs one full circle around the equator, and returns to the North Pole. How many meters did Kyerk travel in total throughout his journey? [b]C6 / G3.[/b] Mr. Pham is lazy and decides Stan’s quarter grade by randomly choosing an integer from $0$ to $100$ inclusive. However, according to school policy, if the quarter grade is less than or equal to $50$, then it is bumped up to $50$. What is the probability that Stan’s final quarter grade is $50$? [b]C7 / G5.[/b] What is the maximum (finite) number of points of intersection between the boundaries of a equilateral triangle of side length $1$ and a square of side length $20$? [b]C8.[/b] You enter the MBMT lottery, where contestants select three different integers from $1$ to $5$ (inclusive). The lottery randomly selects two winning numbers, and tickets that contain both of the winning numbers win. What is the probability that your ticket will win? [b]C9 / G7.[/b] Find a possible solution $(B, E, T)$ to the equation $THE + MBMT = 2018$, where $T, H, E, M, B$ represent distinct digits from $0$ to $9$. [b]C10.[/b] $ABCD$ is a unit square. Let $E$ be the midpoint of $AB$ and $F$ be the midpoint of $AD$. $DE$ and $CF$ meet at $G$. Find the area of $\vartriangle EFG$. [b]C11.[/b] The eight numbers $2015$, $2016$, $2017$, $2018$, $2019$, $2020$, $2021$, and $2022$ are split into four groups of two such that the two numbers in each pair differ by a power of $2$. In how many different ways can this be done? [b]C12 / G4.[/b] We define a function f such that for all integers $n, k, x$, we have that $$f(n, kx) = k^n f(n, x) and f(n + 1, x) = xf(n, x).$$ If $f(1, k) = 2k$ for all integers $k$, then what is $f(3, 7)$? [b]C13 / G8.[/b] A sequence of positive integers is constructed such that each term is greater than the previous term, no term is a multiple of another term, and no digit is repeated in the entire sequence. An example of such a sequence would be $4$, $79$, $1035$. How long is the longest possible sequence that satisfies these rules? [b]C14 / G11.[/b] $ABC$ is an equilateral triangle of side length $8$. $P$ is a point on side AB. If $AC +CP = 5 \cdot AP$, find $AP$. [b]C15.[/b] What is the value of $(1) + (1 + 2) + (1 + 2 + 3) + ... + (1 + 2 + ... + 49 + 50)$? [b]G6.[/b] An ant is on a coordinate plane. It starts at $(0, 0)$ and takes one step each second in the North, South, East, or West direction. After $5$ steps, what is the probability that the ant is at the point $(2, 1)$? [b]G10.[/b] Find the set of real numbers $S$ so that $$\prod_{c\in S}(x^2 + cxy + y^2) = (x^2 - y^2)(x^{12} - y^{12}).$$ [b]G12.[/b] Given a function $f(x)$ such that $f(a + b) = f(a) + f(b) + 2ab$ and $f(3) = 0$, find $f\left( \frac12 \right)$. [b]G13.[/b] Badville is a city on the infinite Cartesian plane. It has $24$ roads emanating from the origin, with an angle of $15$ degrees between each road. It also has beltways, which are circles centered at the origin with any integer radius. There are no other roads in Badville. Steven wants to get from $(10, 0)$ to $(3, 3)$. What is the minimum distance he can take, only going on roads? [b]G14.[/b] Team $A$ and Team $B$ are playing basketball. Team A starts with the ball, and the ball alternates between the two teams. When a team has the ball, they have a $50\%$ chance of scoring $1$ point. Regardless of whether or not they score, the ball is given to the other team after they attempt to score. What is the probability that Team $A$ will score $5$ points before Team $B$ scores any? [b]G15.[/b] The twelve-digit integer $$\overline{A58B3602C91D},$$ where $A, B, C, D$ are digits with $A > 0$, is divisible by $10101$. Find $\overline{ABCD}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].