A boy write three times the natural number $n$ in a blackboard. He then performed an operation of the following type several times: He erased one of the numbers and wrote in its place the sum of the two others minus $1$. After several moves, one of the three numbers in the blackboard is $900$. Find all the posible values of $n$.

We call a graph symmetric, if we can put its vertices on the plane such that if the edges are segments, the graph has a reflectional symmetry with respect to a line not passing through its vertices. Find the least value of $K$ such that the edges of every graph with $100$ vertices, can be divided into $K$ symmetric subgraphs.

Consider a right-angled triangle whose legs are $1$ cm long. Suppose that each point of the triangle was assigned a color from the set of Brown, Blue, Green and Orange colors. It proves that, whatever way this was done, there is at least one pair of points of the same color at a distance equal to or greater than $2-\sqrt 2$ cm from each other.

The [i]Olimpia[/i] country is formed by $n$ islands. The most populated one is called [i]Panacenter[/i], and every island has a different number of inhabitants. We want to build bridges between these islands, which we'll be able to travel in both directions, under the following conditions: a) No pair of islands is joined by more than one bridge. b) Using the bridges we can reach every island from Panacenter. c) If we want to travel from Panacenter to every other island, in such a way that we use each bridge at most once, the number of inhabitants of the islands we visit is strictly decreasing. Determine the number of ways we can build the bridges.

A frog is jumping between lattice points on the coordinate plane in the following way: On each jump, the frog randomly goes to one of the $8$ closest lattice points to it, such that the frog never goes in the same direction on consecutive jumps. If the frog starts at $(20, 19)$ and jumps to $(20, 20)$, then what is the expected value of the frog’s position after it jumps for an infinitely long time?

In a wagon, every $m \geq 3$ people have exactly one common friend. (When $A$ is $B$'s friend, $B$ is also $A$'s friend. No one was considered as his own friend.) Find the number of friends of the person who has the most friends.

Consider the set $S$ of lattice points with positive coordinates in the plane. For each point $P(a,b)$ from $S$, we draw a segment between it and each of the points in the set \[S(P)=\{(a+b,c)\mid c\in\mathbb{Z}, \, c>a+b\}.\] Show that there is no colouring of the points in $S$ with a finite number of colours such that every two points joined by a segment are coloured with different colours. [i]Ioan Tomescu[/i]

Let $n$ be a positive integer. Tasty and Stacy are given a circular necklace with $3n$ sapphire beads and $3n$ turquoise beads, such that no three consecutive beads have the same color. They play a cooperative game where they alternate turns removing three consecutive beads, subject to the following conditions: [list] [*]Tasty must remove three consecutive beads which are turquoise, sapphire, and turquoise, in that order, on each of his turns. [*]Stacy must remove three consecutive beads which are sapphire, turquoise, and sapphire, in that order, on each of her turns. [/list] They win if all the beads are removed in $2n$ turns. Prove that if they can win with Tasty going first, they can also win with Stacy going first. [i]Yannick Yao[/i]

Let $n=3k$ be a positive integer (with $k\geq 2$). An equilateral triangle is divided in $n^2$ unit equilateral triangles with sides parallel to the initial, forming a grid. We will call "trapezoid" the trapezoid which is formed by three equilateral triangles (one base is equal to one and the other is equal to two). We colour the points of the grid with three colours (red, blue and green) such that each two neighboring points have different colour. Finally, the colour of a "trapezoid" will be the colour of the midpoint of its big base. Find the number of all "trapezoids" in the grid (not necessarily disjoint) and determine the number of red, blue and green "trapezoids".

You are given $25$ pieces of cheese of different weights. Is it always possible to cut one of the pieces into two parts and put the $26$ pieces in two packets so that $\bullet$ each packet contains $13$ pieces; $\bullet$ the total weights of the two packets are equal; $\bullet$ the two parts of the piece which has been cut are in different packets? (VL Dolnikov)

$n$ people (with names $1,2,\dots,n$) are around a table. Some of them are friends. At each step 2 friend can change their place. Find a necessary and sufficient condition for friendship relation between them that with these steps we can always reach to all of posiible permutations.

In the coordinate plane a rectangle with vertices $ (0, 0),$ $ (m, 0),$ $ (0, n),$ $ (m, n)$ is given where both $ m$ and $ n$ are odd integers. The rectangle is partitioned into triangles in such a way that [i](i)[/i] each triangle in the partition has at least one side (to be called a “good” side) that lies on a line of the form $ x \equal{} j$ or $ y \equal{} k,$ where $ j$ and $ k$ are integers, and the altitude on this side has length 1; [i](ii)[/i] each “bad” side (i.e., a side of any triangle in the partition that is not a “good” one) is a common side of two triangles in the partition. Prove that there exist at least two triangles in the partition each of which has two good sides.

Let $m$ circles intersect in points $A$ and $B$. We write numbers using the following algorithm: we write $1$ in points $A$ and $B$, in every midpoint of the open arc $AB$ we write $2$, then between every two numbers written in the midpoint we write their sum and so on repeating $n$ times. Let $r(n,m)$ be the number of appearances of the number $n$ writing all of them on our $m$ circles. a) Determine $r(n,m)$; b) For $n=2006$, find the smallest $m$ for which $r(n,m)$ is a perfect square. Example for half arc: $1-1$; $1-2-1$; $1-3-2-3-1$; $1-4-3-5-2-5-3-4-1$; $1-5-4-7-3-8-5-7-2-7-5-8-3-7-4-5-1$...

A solid pyramid $TABCD$, with a quadrilateral base $ABCD$ is to be coloured on each of the five faces such that no two faces with a common edge will have the same colour. If five different colours are available, what is the number of ways to colour the pyramid?

Several distinct real numbers are written on a blackboard. Peter wants to make an expression such that its values are exactly these numbers. To make such an expression, he may use any real numbers, brackets, and usual signs $+$ , $-$ and $\times$. He may also use a special sign $\pm$: computing the values of the resulting expression, he chooses values $+$ or $-$ for every $\pm$ in all possible combinations. For instance, the expression $5 \pm 1$ results in $\{4, 6 \}$, and $(2 \pm 0.5) \pm 0.5$ results in $\{1, 2, 3 \}$. Can Pete construct such an expression: $a)$ If the numbers on the blackboard are $1, 2, 4$; $b)$ For any collection of $100$ distinct real numbers on a blackboard?

There are$n$ balls numbered $1,2,\cdots,n$, respectively. They are painted with $4$ colours, red, yellow, blue, and green, according to the following rules: First, randomly line them on a circle. Then let any three clockwise consecutive balls numbered $i, j, k$, in order. 1) If $i>j>k$, then the ball $j$ is painted in red; 2) If $i<j<k$, then the ball $j$ is painted in yellow; 3) If $i<j, k<j$, then the ball $j$ is painted in blue; 4) If $i>j, k>j$, then the ball $j$ is painted in green. And now each permutation of the balls determine a painting method. We call two painting methods distinct, if there exists a ball, which is painted with two different colours in that two methods. Find out the number of all distinct painting methods.

A game is played between two players on a $10 \times 10$ checkerboard. They move alternately, the first player marking $X$s on vacant cells and the second $O$s. When all $100$ cells have been marked, they calculate two numbers $C$ and $Z$. $C$ is the total number of five consecutive $X$s in a row, a column or a diagonal, so that $6$ consecutive $X$s contribute a count of $2$ to $C$, $7$ consecutive $X$s contribute $3$, and so on. Similarly, $Z$ is the total number of five consecutive Os. The first player wins if $C > Z$, loses if $C < Z$ and draws if $C = Z$. Does the first player have a strategy which guarantees (a) a draw or a win (b) a win regardless of the counter-strategy of the second player? (A Belov)

Show that it is possible to color the points of $\mathbb Q\times\mathbb Q$ in two colors in such a way that any two points having distance $1$ have distinct colors.

Let $M$ be the set of all integers from $1$ to $2013$. Each subset of $M$ is given one of $k$ available colors, with the only condition that if the union of two different subsets $A$ and $B$ is $M$, then $A$ and $B$ are given different colors. What is the least possible value of $k$?

For every point on the plane, one of $ n$ colors are colored to it such that: $ (1)$ Every color is used infinitely many times. $ (2)$ There exists one line such that all points on this lines are colored exactly by one of two colors. Find the least value of $ n$ such that there exist four concyclic points with pairwise distinct colors.

There are $k$ piles and there are $2019$ stones totally. In every move we split a pile into two or remove one pile. Using finite moves we can reach conclusion that there are $k$ piles left and all of them contain different number of stonws. Find the maximum of $k$.

King Arthur is placing $a + b + c$ knights around a table. $a$ knights are dressed in red, $b$ knights are dressed in brown, and $c$ knights are dressed in orange. Arthur wishes to arrange the knights so that no knight is seated next to someone dressed in the same colour as himself. Show that this is possible if, and only if, there exists a triangle whose sides have lengths $a +\frac12, b +\frac12$, and $c +\frac12$

[b]p1.[/b] Aidan walks into a skyscraper’s first floor lobby and takes the elevator up $50$ floors. After exiting the elevator, he takes the stairs up another $10$ floors, then takes the elevator down $30$ floors. Find the floor number Aidan is currently on. [b]p2.[/b] Jeff flips a fair coin twice and Kaylee rolls a standard $6$-sided die. The probability that Jeff flips $2$ heads and Kaylee rolls a $4$ is $P$. Find $\frac{1}{P}$ . [b]p3.[/b] Given that $a\odot b = a + \frac{a}{b}$ , find $(4\odot 2)\odot 3$. [b]p4.[/b] The following star is created by gluing together twelve equilateral triangles each of side length $3$. Find the outer perimeter of the star. [img]https://cdn.artofproblemsolving.com/attachments/e/6/ad63edbf93c5b7d4c7e5d68da2b4632099d180.png[/img] [b]p5.[/b] In Lexington High School’sMath Team, there are $40$ students: $20$ of whom do science bowl and $22$ of whom who do LexMACS. What is the least possible number of students who do both science bowl and LexMACS? [b]p6.[/b] What is the least positive integer multiple of $3$ whose digits consist of only $0$s and $1$s? The number does not need to have both digits. [b]p7.[/b] Two fair $6$-sided dice are rolled. The probability that the product of the numbers rolled is at least $30$ can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p8.[/b] At the LHSMath Team Store, $5$ hoodies and $1$ jacket cost $\$13$, and $5$ jackets and $1$ hoodie cost $\$17$. Find how much $15$ jackets and $15$ hoodies cost, in dollars. [b]p9.[/b] Eric wants to eat ice cream. He can choose between $3$ options of spherical ice cream scoops. The first option consists of $4$ scoops each with a radius of $3$ inches, which costs a total of $\$3$. The second option consists of a scoop with radius $4$ inches, which costs a total of $\$2$. The third option consists of $5$ scoops each with diameter $2$ inches, which costs a total of $\$1$. The greatest possible ratio of volume to cost of ice cream Eric can buy is nπ cubic inches per dollar. Find $3n$. [b]p10.[/b] Jen claims that she has lived during at least part of each of five decades. What is the least possible age that Jen could be? (Assume that age is always rounded down to the nearest integer.) [b]p11.[/b] A positive integer $n$ is called Maisylike if and only if $n$ has fewer factors than $n -1$. Find the sum of the values of $n$ that are Maisylike, between $2$ and $10$, inclusive. [b]p12.[/b] When Ginny goes to the nearby boba shop, there is a $30\%$ chance that the employee gets her drink order wrong. If the drink she receives is not the one she ordered, there is a $60\%$ chance that she will drink it anyways. Given that Ginny drank a milk tea today, the probability she ordered it can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find the value of $a +b$. [b]p13.[/b] Alex selects an integer $m$ between $1$ and $100$, inclusive. He notices there are the same number of multiples of $5$ as multiples of $7$ betweenm and $m+9$, inclusive. Find how many numbers Alex could have picked. [b]p14.[/b] In LMTown there are only rainy and sunny days. If it rains one day there’s a $30\%$ chance that it will rain the next day. If it’s sunny one day there’s a $90\%$ chance it will be sunny the next day. Over n days, as n approaches infinity, the percentage of rainy days approaches $k\%$. Find $10k$. [b]p15.[/b] A bag of letters contains $3$ L’s, $3$ M’s, and $3$ T’s. Aidan picks three letters at random from the bag with replacement, and Andrew picks three letters at random fromthe bag without replacement. Given that the probability that both Aidan and Andrew pick one each of L, M, and T can be written as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers, find $m+n$. [b]p16.[/b] Circle $\omega$ is inscribed in a square with side length $2$. In each corner tangent to $2$ of the square’s sides and externally tangent to $\omega$ is another circle. The radius of each of the smaller $4$ circles can be written as $(a -\sqrt{b})$ where $a$ and $b$ are positive integers. Find $a +b$. [img]https://cdn.artofproblemsolving.com/attachments/d/a/c76a780ac857f745067a8d6c4433efdace2dbb.png[/img] [b]p17.[/b] In the nonexistent land of Lexingtopia, there are $10$ days in the year, and the Lexingtopian Math Society has $5$ members. The probability that no two of the LexingtopianMath Society’s members share the same birthday can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p18.[/b] Let $D(n)$ be the number of diagonals in a regular $n$-gon. Find $$\sum^{26}_{n=3} D(n).$$ [b]p19.[/b] Given a square $A_0B_0C_0D_0$ as shown below with side length $1$, for all nonnegative integers $n$, construct points $A_{n+1}$, $B_{n+1}$, $C_{n+1}$, and $D_{n+1}$ on $A_nB_n$, $B_nC_n$, $C_nD_n$, and $D_nA_n$, respectively, such that $$\frac{A_n A_{n+1}}{A_{n+1}B_n}=\frac{B_nB_{n+1}}{B_{n+1}C_n} =\frac{C_nC_{n+1}}{C_{n+1}D_n}=\frac{D_nD_{n+1}}{D_{n+1}A_n} =\frac34.$$ [img]https://cdn.artofproblemsolving.com/attachments/6/a/56a435787db0efba7ab38e8401cf7b06cd059a.png[/img] The sum of the series $$\sum^{\infty}_{i=0} [A_iB_iC_iD_i ] = [A_0B_0C_0D_0]+[A_1B_1C_1D_1]+[A_2B_2C_2D_2]...$$ where $[P]$ denotes the area of polygon $P$ can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$. [b]p20.[/b] Let $m$ and $n$ be two real numbers such that $$\frac{2}{n}+m = 9$$ $$\frac{2}{m}+n = 1$$ Find the sum of all possible values of $m$ plus the sumof all possible values of $n$. [b]p21.[/b] Let $\sigma (x)$ denote the sum of the positive divisors of $x$. Find the smallest prime $p$ such that $$\sigma (p!) \ge 20 \cdot \sigma ([p -1]!).$$ [b]p22.[/b] Let $\vartriangle ABC$ be an isosceles triangle with $AB = AC$. Let $M$ be the midpoint of side $\overline{AB}$. Suppose there exists a point X on the circle passing through points $A$, $M$, and $C$ such that $BMCX$ is a parallelogram and $M$ and $X$ are on opposite sides of line $BC$. Let segments $\overline{AX}$ and $\overline{BC}$ intersect at a point $Y$ . Given that $BY = 8$, find $AY^2$. [b]p23.[/b] Kevin chooses $2$ integers between $1$ and $100$, inclusive. Every minute, Corey can choose a set of numbers and Kevin will tell him how many of the $2$ chosen integers are in the set. How many minutes does Corey need until he is certain of Kevin’s $2$ chosen numbers? [b]p24.[/b] Evaluate $$1^{-1} \cdot 2^{-1} +2^{-1} \cdot 3^{-1} +3^{-1} \cdot 4^{-1} +...+(2015)^{-1} \cdot (2016)^{-1} \,\,\, (mod \,\,\,2017).$$ [b]p25.[/b] In scalene $\vartriangle ABC$, construct point $D$ on the opposite side of $AC$ as $B$ such that $\angle ABD = \angle DBC = \angle BC A$ and $AD =DC$. Let $I$ be the incenter of $\vartriangle ABC$. Given that $BC = 64$ and $AD = 225$, find$ BI$ . [img]https://cdn.artofproblemsolving.com/attachments/b/1/5852dd3eaace79c9da0fd518cfdcd5dc13aecf.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a $m\times n$ grid rectangle with $m,n \ge 4$ and a closed path $P$ that is not self intersecting from inner points of the grid, let $A$ be the number of points on $P$ such that $P$ does not turn in them and let $B$ be the number of squares that $P$ goes through two non-adjacent sides of them furthermore let $C$ be the number of squares with no side in $P$. Prove that $$A=B-C+m+n-1.$$

Let $\mathbb{K}$ be two-dimensional integer lattice. Is there a bijection $f:\mathbb{N} \rightarrow \mathbb{K}$, such that for every distinct $a,b,c \in \mathbb{N}$ we have: \[\gcd(a,b,c)>1 \Rightarrow f(a),f(b),f(c) \mbox{ are not colinear? }\]