There are $19$ lines in the plane dividing the plane into exactly $97$ pieces. (a) Prove that among these pieces there is at least one triangle. (b) Show that it is indeed possible to place $19$ lines in the above way.

On a Cartesian plane, $n$ parabolas are drawn, all of which are graphs of quadratic trinomials. No two of them are tangent. They divide the plane into many areas, one of which is above all the parabolas. Prove that the border of this area has no more than $2(n-1)$ corners (i.e. the intersections of a pair of parabolas).

[b]N[/b]ew this year at HMNT: the exciting game of RNG baseball! In RNG baseball, a team of infinitely many people play on a square field, with a base at each vertex; in particular, one of the bases is called the home base. Every turn, a new player stands at home base and chooses a number n uniformly at random from $\{0, 1, 2, 3, 4\}$. Then, the following occurs: • If $n>0$, then the player and everyone else currently on the field moves (counterclockwise) around the square by n bases. However, if in doing so a player returns to or moves past the home base, he/she leaves the field immediately and the team scores one point. • If $n=0$ (a strikeout), then the game ends immediately; the team does not score any more points. What is the expected number of points that a given team will score in this game?

The load for the space station "Salute" is packed in containers. There are more than $35$ containers, and the total weight is $18$ metric tons. There are $7$ one-way transport spaceships "Progress", each able to bring $3$ metric tons to the station. It is known that they are able to take an arbitrary subset of $35$ containers. Prove that they are able to take all the load.

Ayala and Barvaz play a game: Ayala initially gives Barvaz two $100\times100$ tables of positive integers, such that the product of numbers in each table is the same. In one move, Barvaz may choose a row or column in one of the tables, and change the numbers in it (to some positive integers), as long as the total product remains the same. Barvaz wins if after $N$ such moves, he manages to make the two tables equal to each other, and otherwise Ayala wins. a. For which values of $N$ does Barvaz have a winning strategy? b. For which values of $N$ does Barvaz have a winning strategy, if all numbers in Ayalah’s tables must be powers of $2$?

There are $100$ cities in a country, some of them being joined by roads. Any four cities are connected to each other by at least two roads. Assume that there is no path passing through every city exactly once. Prove that there are two cities such that every other city is connected to at least one of them.

[b]p1.[/b] The oil pipeline passes by three villages $A$, $B$, $C$. In the first village, $30\%$ of the initial amount of oil is drained, in the second - $40\%$ of the amount that will reach village $B$, and in the third - $50\%$ of the amount that will reach village $C$ What percentage of the initial amount of oil reaches the end of the pipeline? [b]p2.[/b] There are several ordinary irreducible fractions (not necessarily proper) with natural numerators and denominators (and the denominators are greater than $1$). The product of all fractions is equal to $10$. All numerators and denominators are increased by $1$. Can the product of the resulting fractions be greater than $10$? [b]p3.[/b] The garland consists of $10$ light bulbs connected in series. Exactly one of the light bulbs has burned out, but it is not known which one. There is a suitable light bulb available to replace a burnt out one. To unscrew a light bulb, you need $10$ seconds, to screw it in - also $10$ seconds (the time for other actions can be neglected). Is it possible to be guaranteed to find a burnt out light bulb: a) in $10$ minutes, b) in $5$ minutes? [b]p4.[/b] When fast and slow athletes run across the stadium in one direction, the fast one overtakes the slow one every $15$ minutes, and when they run towards each other, they meet once every $5$ minutes. How many times is the speed of a fast runner greater than the speed of a slow runner? [b]p5.[/b] Petya was $35$ minutes late for school. Then he decided to run to the kiosk for ice cream. But when he returned, the second lesson had already begun. He immediately ran for ice cream a second time and was gone for the same amount of time. When he returned, it turned out that he was late again, and he had to wait $50$ minutes before the start of the fourth lesson. How long does it take to run from school to the ice cream stand and back if each lesson, including recess after it, lasts $55$ minutes? [b]p6.[/b] In a convex heptagon, draw as many diagonals as possible so that no three of them are sides of the same triangle, the vertices of which are at the vertices of the original heptagon. [b]p7.[/b] In the writing of the antipodes, numbers are also written with the digits $0, ..., 9$, but each of the numbers has different meanings for them and for us. It turned out that the equalities are also true for the antipodes $5 * 8 + 7 + 1 = 48$ $2 * 2 * 6 = 24$ $5* 6 = 30$ a) How will the equality $2^3 = ...$ in the writing of the antipodes be continued? b) What does the number 9 mean among the Antipodes? Clarifications: a) It asks to convert $2^3$ in antipodes language, and write with what number it is equal and find a valid equality in both numerical systems. b) What does the digit $9$ mean among the antipodes, i.e. with which digit is it equal in our number system? [b]p8.[/b] They wrote the numbers $1, 2, 3, 4, ..., 1996, 1997$ in a row. Which digits were used more when writing these numbers - ones or twos? How long? [b]p9.[/b] On the number axis there lives a grasshopper who can jump $1$ and $4$ to the right and left. Can he get from point $1$ to point $2$ of the numerical axis $in 1996$ jumps if he must not get to points with coordinates divisible by $ 4$ (points $0$, $\pm 4$, $\pm 8$, etc.)? [b]p10.[/b] Is there a convex quadrilateral that can be cut along a straight line into two parts of the same size and shape, but neither the diagonal nor the straight line passing through the midpoints of opposite sides divides it into two equal parts? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

[i]25 problems for 30 minutes[/i] [b]p1.[/b] Somya has a football game $4$ days from today. If the day before yesterday was Wednesday, what day of the week is the game? [b]p2.[/b] Sammy writes the following equation: $$\frac{2 + 2}{8 + 8}=\frac{x}{8}.$$ What is the value of $x$ in Sammy's equation? [b]p3.[/b] On $\pi$ day, Peter buys $7$ pies. The pies costed $\$3$, $\$1$, $\$4$, $\$1$, $\$5$, $\$9$, and $\$2$. What was the median price of Peter's $7$ pies in dollars? [b]p4.[/b] Antonio draws a line on the coordinate plane. If the line passes through the points ($1, 3$) and ($-1,-1$), what is slope of the line? [b]p5.[/b] Professor Varun has $25$ students in his science class. He divides his students into the maximum possible number of groups of $4$, but $x$ students are left over. What is $x$? [b]p6.[/b] Evaluate the following: $$4 \times 5 \div 6 \times 3 \div \frac47$$ [b]p7.[/b] Jonny, a geometry expert, draws many rectangles with perimeter $16$. What is the area of the largest possible rectangle he can draw? [b]p8.[/b] David always drives at $60$ miles per hour. Today, he begins his trip to MIT by driving $60$ miles. He stops to take a $20$ minute lunch break and then drives for another $30$ miles to reach the campus. What is the total time in minutes he spends getting to MIT? [b]p9.[/b] Richard has $5$ hats: blue, green, orange, red, and purple. Richard also has 5 shirts of the same colors: blue, green, orange, red, and purple. If Richard needs a shirt and a hat of different colors, how many outts can he wear? [b]p10.[/b] Poonam has $9$ numbers in her bag: $1, 2, 3, 4, 5, 6, 7, 8, 9$. Eric runs by with the number $36$. How many of Poonam's numbers evenly divide Eric's number? [b]p11.[/b] Serena drives at $45$ miles per hour. If her car runs at $6$ miles per gallon, and each gallon of gas costs $2$ dollars, how many dollars does she spend on gas for a $135$ mile trip? [b]p12.[/b] Grace is thinking of two integers. Emmie observes that the sum of the two numbers is $56$ but the difference of the two numbers is $30$. What is the sum of the squares of Grace's two numbers? [b]p13.[/b] Chang stands at the point ($3,-3$). Fang stands at ($-3, 3$). Wang stands in-between Chang and Fang; Wang is twice as close to Fang as to Chang. What is the ordered pair that Wang stands at? [b]p14.[/b] Nithin has a right triangle. The longest side has length $37$ inches. If one of the shorter sides has length $12$ inches, what is the perimeter of the triangle in inches? [b]p15.[/b] Dora has $2$ red socks, $2$ blue socks, $2$ green socks, $2$ purple socks, $3$ black socks, and $4$ gray socks. After a long snowstorm, her family loses electricity. She picks socks one-by-one from the drawer in the dark. How many socks does she have to pick to guarantee a pair of socks that are the same color? [b]p16.[/b] Justin selects a random positive $2$-digit integer. What is the probability that the sum of the two digits of Justin's number equals $11$? [b]p17.[/b] Eddie correctly computes $1! + 2! + .. + 9! + 10!$. What is the remainder when Eddie's sum is divided by $80$? [b]p18.[/b] $\vartriangle PQR$ is drawn such that the distance from $P$ to $\overline{QR}$ is $3$, the distance from $Q$ to $\overline{PR}$ is $4$, and the distance from $R$ to $\overline{PQ}$ is $5$. The angle bisector of $\angle PQR$ and the angle bisector of $\angle PRQ$ intersect at $I$. What is the distance from $I$ to $\overline{PR}$? [b]p19.[/b] Maxwell graphs the quadrilateral $|x - 2| + |y + 2| = 6$. What is the area of the quadrilateral? [b]p20.[/b] Uncle Gowri hits a speed bump on his way to the hospital. At the hospital, patients who get a rare disease are given the option to choose treatment $A$ or treatment $B$. Treatment $A$ will cure the disease $\frac34$ of the time, but since the treatment is more expensive, only $\frac{8}{25}$ of the patients will choose this treatment. Treatment $B$ will only cure the disease $\frac{1}{2}$ of the time, but since it is much more aordable, $\frac{17}{25}$ of the patients will end up selecting this treatment. Given that a patient was cured, what is the probability that the patient selected treatment $A$? [b]p21.[/b] In convex quadrilateral $ABCD$, $AC = 28$ and $BD = 15$. Let $P, Q, R, S$ be the midpoints of $AB$, $BC$, $CD$ and $AD$ respectively. Compute $PR^2 + QS^2$. [b]p22.[/b] Charlotte writes the polynomial $p(x) = x^{24} - 6x + 5$. Let its roots be $r_1$, $r_2$, $...$, $r_{24}$. Compute $r^{24}_1 +r^{24}_2 + r^{24}_3 + ... + r^{24}_24$. [b]p23.[/b] In rectangle $ABCD$, $AB = 6$ and $BC = 4$. Let $E$ be a point on $CD$, and let $F$ be the point on $AB$ which lies on the bisector of $\angle BED$. If $FD^2 + EF^2 = 52$, what is the length of $BE$? [b]p24.[/b] In $\vartriangle ABC$, the measure of $\angle A$ is $60^o$ and the measure of $\angle B$ is $45^o$. Let $O$ be the center of the circle that circumscribes $\vartriangle ABC$. Let $I$ be the center of the circle that is inscribed in $\vartriangle ABC$. Finally, let $H$ be the intersection of the $3$ altitudes of the triangle. What is the angle measure of $\angle OIH$ in degrees? [b]p25.[/b] Kaitlyn fully expands the polynomial $(x^2 + x + 1)^{2018}$. How many of the coecients are not divisible by $3$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For a family gathering, $8$ people order one dish each. The family sits around a circular table. Find the number of ways to place the dishes so that each person’s dish is either to the left, right, or directly in front of them. [i]Proposed by Nicole Sim[/i]

Put the numbers $1,2,3,...,n$ on the circumference of a circle in such a way that the difference between neighboring numbers is at most $2$. Prove that there is just one solution (if regard is paid only to the order in which the numbers are arranged).

Let $k$ be a natural number. Determine the number of non-congruent triangles with the vertices at vertices of a given regular $6k$-gon.

All the squares of a board of $(n+1)\times(n-1)$ squares are painted with [b]three colors[/b] such that, for any two different columns and any two different rows, the 4 squares in their intersections they don't have all the same color. Find the greatest possible value of $n$.

Let $$\begin{array}{cccc}{a_{1,1}} & {a_{1,2}} & {a_{1,3}} & {\dots} \\ {a_{2,1}} & {a_{2,2}} & {a_{2,3}} & {\cdots} \\ {a_{3,1}} & {a_{3,2}} & {a_{3,3}} & {\cdots} \\ {\vdots} & {\vdots} & {\vdots} & {\ddots}\end{array}$$ be a doubly infinite array of positive integers, and suppose each positive integer appears exactly eight times in the array. Prove that $a_{m, n}>m n$ for some pair of positive integers $(m, n) .$

An ant walks on the interior surface of a cube, he moves on a straight line. If ant reaches to an edge the he moves on a straight line on cube's net. Also if he reaches to a vertex he will return his path. a) Prove that for each beginning point ant can has infinitely many choices for his direction that its path becomes periodic. b) Prove that if if the ant starts from point $A$ and its path is periodic, then for each point $B$ if ant starts with this direction, then his path becomes periodic.

(a) In this drawing, there are three squares on each side of the square. Place a natural number in each of the boxes so that the sum of the numbers of two adjacent boxes is always odd. [img]https://cdn.artofproblemsolving.com/attachments/e/6/75517b7d49857abd3f8f0430a70ae5b0eb1554.gif[/img] (b) In this drawing, there are now four squares on each side of the triangle. Justify why a natural number cannot be placed in each box so that the sum of the numbers in two adjacent boxes is always odd. [img] https://cdn.artofproblemsolving.com/attachments/c/8/061895b9c1cdcb132f7d37087873b7de3fb5f3.gif[/img] (c) If you now draw a polygon with$ 51$ sides and on each side you place $50$ boxes, taking care that there is a box at each vertex. Can you place a natural number in each box so that the sum of the numbers in two adjacent boxes is always odd? Why?

[u]Round 1[/u] [b]p1.[/b] When Shiqiao sells a bale of kale, he makes $x$ dollars, where $$x =\frac{1 + 2 + 3 + 4 + 5 + 6 + 7 + 8}{3 + 4 + 5 + 6}.$$ Find $x$. [b]p2.[/b] The fraction of Shiqiao’s kale that has gone rotten is equal to $$\sqrt{ \frac{100^2}{99^2} -\frac{100}{99}}.$$ Find the fraction of Shiqiao’s kale that has gone rotten. [b]p3.[/b] Shiqiao is growing kale. Each day the number of kale plants doubles, but $4$ of his kale plants die afterwards. He starts with $6$ kale plants. Find the number of kale plants Shiqiao has after five days. [u]Round 2[/u] [b]p4.[/b] Today the high is $68$ degrees Fahrenheit. If $C$ is the temperature in Celsius, the temperature in Fahrenheit is equal to $1.8C + 32$. Find the high today in Celsius. [b]p5.[/b] The internal angles in Evan’s triangle are all at most $68$ degrees. Find the minimum number of degrees an angle of Evan’s triangle could measure. [b]p6.[/b] Evan’s room is at $68$ degrees Fahrenheit. His thermostat has two buttons, one to increase the temperature by one degree, and one to decrease the temperature by one degree. Find the number of combinations of $10$ button presses Evan can make so that the temperature of his room never drops below $67$ degrees or rises above $69$ degrees. [u]Round 3[/u] [b]p7.[/b] In a digital version of the SAT, there are four spaces provided for either a digit $(0-9)$, a fraction sign $(\/)$, or a decimal point $(.)$. The answer must be in simplest form and at most one space can be a non-digit character. Determine the largest fraction which, when expressed in its simplest form, fits within this space, but whose exact decimal representation does not. [b]p8.[/b] Rounding Rox picks a real number $x$. When she rounds x to the nearest hundred, its value increases by $2.71828$. If she had instead rounded $x$ to the nearest hundredth, its value would have decreased by $y$. Find $y$. [b]p9.[/b] Let $a$ and $b$ be real numbers satisfying the system of equations $$\begin{cases} a + \lfloor b \rfloor = 2.14 \\ \lfloor a \rfloor + b = 2.72 \end{cases}$$ Determine $a + b$. [u]Round 4[/u] [b]p10.[/b] Carol and Lily are playing a game with two unfair coins, both of which have a $1/4$ chance of landing on heads. They flip both coins. If they both land on heads, Lily loses the game, and if they both land on tails, Carol loses the game. If they land on different sides, Carol and Lily flip the coins again. They repeat this until someone loses the game. Find the probability that Lily loses the game. [b]p11.[/b] Dongchen is carving a circular coin design. He carves a regular pentagon of side length $1$ such that all five vertices of the pentagon are on the rim of the coin. He then carves a circle inside the pentagon so that the circle is tangent to all five sides of the pentagon. Find the area of the region between the smaller circle and the rim of the coin. [b]p12.[/b] Anthony flips a fair coin six times. Find the probability that at some point he flips $2$ heads in a row. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3248731p29808147]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are 20 buns with jam and 20 buns with treacle arranged in a row in random order. Alice and Bob take in turn a bun from any end of the row. Alice starts, and wants to finally obtain 10 buns of each type; Bob tries to prevent this. Is it true for any order of the buns that Alice can win no matter what are the actions of Bob? [i]Alexandr Gribalko[/i]

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or [*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter. [i]Proposed by Aron Thomas[/i]

Nils has an $M \times N$ board where $M$ and $N$ are positive integers, and a tile shaped as shown below. What is the smallest number of squares that Nils must color, so that it is impossible to place the tile on the board without covering a colored square? The tile can be freely rotated and mirrored, but it must completely cover four squares. [asy] usepackage("tikz"); label("% \begin{tikzpicture} \draw[step=1cm,color=black] (0,0) grid (2,1); \draw[step=1cm,color=black] (1,1) grid (3,2); \fill [yellow] (0,0) rectangle (2,1); \fill [yellow] (1,1) rectangle (3,2); \draw[step=1cm,color=black] (0,0) grid (2,1); \draw[step=1cm,color=black] (1,1) grid (3,2); \end{tikzpicture} "); [/asy]

Let $w = w_1 w_2 \dots w_n$ be a word. Define a [i]substring[/i] of $w$ to be a word of the form $w_i w_{i + 1} \dots w_{j - 1} w_j$, for some pair of positive integers $1 \le i \le j \le n$. Show that $w$ has at most $n$ distinct palindromic substrings. For example, $aaaaa$ has $5$ distinct palindromic substrings, and $abcata$ has $5$ ($a$, $b$, $c$, $t$, $ata$).

Four points are given inside or on the boundary of a unit square. Prove that at least two of these points are on a mutual distance at most $1.$

The squares of an infinite chessboard are numbered $1,2,\ldots $ along a spiral, as shown in the picture. A [i]rightline[/i] is the sequence of the numbers in the squares obtained by starting at one square at going to the right. a) Prove that exists a rightline without multiples of $3$. b) Prove that there are infinitely many pairwise disjoint rightlines not containing multiples of $3$.

Players $A$ and $B$ play a game with $N \geq 2012$ coins and $2012$ boxes arranged around a circle. Initially $A$ distributes the coins among the boxes so that there is at least $1$ coin in each box. Then the two of them make moves in the order $B,A,B,A,\ldots $ by the following rules: [b](a)[/b] On every move of his $B$ passes $1$ coin from every box to an adjacent box. [b](b)[/b] On every move of hers $A$ chooses several coins that were [i]not[/i] involved in $B$'s previous move and are in different boxes. She passes every coin to an adjacent box. Player $A$'s goal is to ensure at least $1$ coin in each box after every move of hers, regardless of how $B$ plays and how many moves are made. Find the least $N$ that enables her to succeed.

A rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary. [i]Author: Kei Irie, Japan[/i]

Among the coordinates $(x,y)$ $(1\leq x,y\leq 101)$, choose some points such that there does not exist $4$ points which form a isoceles trapezium with its base parallel to either the $x$ or $y$ axis(including rectangles). Find the maximum number of coordinate points that can be chosen.