Let $n$ be a positive integer and let $G_n$ be the set of all simple graphs on $n$ vertices. For each vertex $v$ of a graph in $G_n$, let $k(v)$ be the maximal cardinality of an independent set of neighbours of $v$. Determine $max_{G \in G_n} \Sigma_{v\in V (G)}k(v)$ and the graphs in $G_n$ that achieve this value.

Find the greatest number of depicted pieces composed of $4$ unit squares that can be placed without overlapping on an $n \times n$ grid (where n is a positive integer) in such a way that it is possible to move from some corner to the opposite corner via uncovered squares (moving between squares requires a common edge). The shapes can be rotated and reflected. [img]https://cdn.artofproblemsolving.com/attachments/b/d/f2978a24fdd737edfafa5927a8d2129eb586ee.png[/img]

There are n lilypads in a row labeled $1, 2, \dots, n$ from left to right. Fareniss the Frog picks a lilypad at random to start on, and every second she jumps to an adjacent lilypad; if there are two such lilypads, she is twice as likely to jump to the right as to the left. After some finite number of seconds, there exists two lilypads $A$ and $B$ such that Fareniss is more than $1000$ times as likely to be on $A$ as she is to be on $B$. What is the minimal number of lilypads $n$ such that this situation must occur?

Let an integer $n > 1$ be given. In the space with orthogonal coordinate system $Oxyz$ we denote by $T$ the set of all points $(x, y, z)$ with $x, y, z$ are integers, satisfying the condition: $1 \leq x, y, z \leq n$. We paint all the points of $T$ in such a way that: if the point $A(x_0, y_0, z_0)$ is painted then points $B(x_1, y_1, z_1)$ for which $x_1 \leq x_0, y_1 \leq y_0$ and $z_1 \leq z_0$ could not be painted. Find the maximal number of points that we can paint in such a way the above mentioned condition is satisfied.

A subset $B$ of $\{1, 2, \dots, 2017\}$ is said to have property $T$ if any three elements of $B$ are the sides of a nondegenerate triangle. Find the maximum number of elements that a set with property $T$ may contain.

[b]8.1[/b] On the median drawn from the vertex of the triangle to the base, point $A$ is taken. The sum of the distances from $A$ to the sides of the triangle is equal to $s$. Find the distances from $A$ to the sides if the lengths of the sides are equal to $x$ and $y$. [b]8.2[/b] Fraction $0, abc...$ is composed according to the following rule: $a$ and $c$ are arbitrary digits, and each next digit is equal to the remainder of the sum of the previous two digits when divided by $10$. Prove that this fraction is purely periodic. [b]8.3[/b] Two convex polygons with $m$ and $n$ sides are drawn on the plane ($m>n$). What is the greatest possible number of parts, they can break the plane? [b]8.4 [/b]The sum of three integers that are perfect squares is divisible by $9$. Prove that among them, there are two numbers whose difference is divisible by $9$. [b]8.5 / 9.5[/b] Given $k+2$ integers. Prove that among them there are two integers such that either their sum or their difference is divisible by $2k$. [b]8.6[/b] A right angle rotates around its vertex. Find the locus of the midpoints of the segments connecting the intersection points sides of an angle and a given circle. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983460_1963_leningrad_math_olympiad]here[/url].

A grid measuring $10 \times 11$ is given. How many "crosses" covering five unit squares can be placed on the grid? (pictured right) so that no two of them cover the same square? [img]https://cdn.artofproblemsolving.com/attachments/a/7/8a5944233785d960f6670e34ca7c90080f0bd6.png[/img]

Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.

[u]Round 1[/u] [b]1.1.[/b] A circle has a circumference of $20\pi$ inches. Find its area in terms of $\pi$. [b]1.2.[/b] Let $x, y$ be the solution to the system of equations: $x^2 + y^2 = 10 \,\,\, , \,\,\, x = 3y$. Find $x + y$ where both $x$ and $y$ are greater than zero. [b]1. 3.[/b] Chris deposits $\$ 100$ in a bank account. He then spends $30\%$ of the money in the account on biology books. The next week, he earns some money and the amount of money he has in his account increases by $30 \%$. What percent of his original money does he now have? [u]Round 2[/u] [b]2.1.[/b] The bell rings every $45$ minutes. If the bell rings right before the first class and right after the last class, how many hours are there in a school day with $9$ bells? [b]2.2.[/b] The middle school math team has $9$ members. They want to send $2$ teams to ABMC this year: one full team containing 6 members and one half team containing the other $3$ members. In how many ways can they choose a $6$ person team and a $3$ person team? [b]2.3.[/b] Find the sum: $$1 + (1 - 1)(1^2 + 1 + 1) + (2 - 1)(2^2 + 2 + 1) + (3 - 1)(3^2 + 3 + 1) + ...· + (8 - 1)(8^2 + 8 + 1) + (9 - 1)(9^2 + 9 + 1).$$ [u]Round 3[/u] [b]3.1.[/b] In square $ABHI$, another square $BIEF$ is constructed with diagonal $BI$ (of $ABHI$) as its side. What is the ratio of the area of $BIEF$ to the area of $ABHI$? [b]3.2.[/b] How many ordered pairs of positive integers $(a, b)$ are there such that $a$ and $b$ are both less than $5$, and the value of $ab + 1$ is prime? Recall that, for example, $(2, 3)$ and $(3, 2)$ are considered different ordered pairs. [b]3.3.[/b] Kate Lin drops her right circular ice cream cone with a height of $ 12$ inches and a radius of $5$ inches onto the ground. The cone lands on its side (along the slant height). Determine the distance between the highest point on the cone to the ground. [u]Round 4[/u] [b]4.1.[/b] In a Museum of Fine Mathematics, four sculptures of Euler, Euclid, Fermat, and Allen, one for each statue, are nailed to the ground in a circle. Bob would like to fully paint each statue a single color such that no two adjacent statues are blue. If Bob only has only red and blue paint, in how many ways can he paint the four statues? [b]4.2.[/b] Geo has two circles, one of radius 3 inches and the other of radius $18$ inches, whose centers are $25$ inches apart. Let $A$ be a point on the circle of radius 3 inches, and B be a point on the circle of radius $18$ inches. If segment $\overline{AB}$ is a tangent to both circles that does not intersect the line connecting their centers, find the length of $\overline{AB}$. [b]4.3.[/b] Find the units digit to $2017^{2017!}$. [u]Round 5[/u] [b]5.1.[/b] Given equilateral triangle $\gamma_1$ with vertices $A, B, C$, construct square $ABDE$ such that it does not overlap with $\gamma_1$ (meaning one cannot find a point in common within both of the figures). Similarly, construct square $ACFG$ that does not overlap with $\gamma_1$ and square $CBHI$ that does not overlap with $\gamma_1$. Lines $DE$, $FG$, and $HI$ form an equilateral triangle $\gamma_2$. Find the ratio of the area of $\gamma_2$ to $\gamma_1$ as a fraction. [b]5.2.[/b] A decimal that terminates, like $1/2 = 0.5$ has a repeating block of $0$. A number like $1/3 = 0.\overline{3}$ has a repeating block of length $ 1$ since the fraction bar is only over $ 1$ digit. Similarly, the numbers $0.0\overline{3}$ and $0.6\overline{5}$ have repeating blocks of length $ 1$. Find the number of positive integers $n$ less than $100$ such that $1/n$ has a repeating block of length $ 1$. [b]5.3.[/b] For how many positive integers $n$ between $1$ and $2017$ is the fraction $\frac{n + 6}{2n + 6}$ irreducible? (Irreducibility implies that the greatest common factor of the numerator and the denominator is $1$.) [u]Round 6[/u] [b]6.1.[/b] Consider the binary representations of $2017$, $2017 \cdot 2$, $2017 \cdot 2^2$, $2017 \cdot 2^3$, $... $, $2017 \cdot 2^{100}$. If we take a random digit from any of these binary representations, what is the probability that this digit is a $1$ ? [b]6.2.[/b] Aaron is throwing balls at Carlson’s face. These balls are infinitely small and hit Carlson’s face at only $1$ point. Carlson has a flat, circular face with a radius of $5$ inches. Carlson’s mouth is a circle of radius $ 1$ inch and is concentric with his face. The probability of a ball hitting any point on Carlson’s face is directly proportional to its distance from the center of Carlson’s face (so when you are $2$ times farther away from the center, the probability of hitting that point is $2$ times as large). If Aaron throws one ball, and it is guaranteed to hit Carlson’s face, what is the probability that it lands in Carlson’s mouth? [b]6.3.[/b] The birth years of Atharva, his father, and his paternal grandfather form a geometric sequence. The birth years of Atharva’s sister, their mother, and their grandfather (the same grandfather) form an arithmetic sequence. If Atharva’s sister is $5$ years younger than Atharva and all $5$ people were born less than $200$ years ago (from $2017$), what is Atharva’s mother’s birth year? [u]Round 7[/u] [b]7. 1.[/b] A function $f$ is called an “involution” if $f(f(x)) = x$ for all $x$ in the domain of $f$ and the inverse of $f$ exists. Find the total number of involutions $f$ with domain of integers between $ 1$ and $ 8$ inclusive. [b]7.2.[/b] The function $f(x) = x^3$ is an odd function since each point on $f(x)$ corresponds (through a reflection through the origin) to a point on $f(x)$. For example the point $(-2, -8)$ corresponds to $(2, 8)$. The function $g(x) = x^3 - 3x^2 + 6x - 10$ is a “semi-odd” function, since there is a point $(a, b)$ on the function such that each point on $g(x)$ corresponds to a point on $g(x)$ via a reflection over $(a, b)$. Find $(a, b)$. [b]7.3.[/b] A permutations of the numbers $1, 2, 3, 4, 5$ is an arrangement of the numbers. For example, $12345$ is one arrangement, and $32541$ is another arrangement. Another way to look at permutations is to see each permutation as a function from $\{1, 2, 3, 4, 5\}$ to $\{1, 2, 3, 4, 5\}$. For example, the permutation $23154$ corresponds to the function f with $f(1) = 2$, $f(2) = 3$, $f(3) = 1$, $f(5) = 4$, and $f(4) = 5$, where $f(x)$ is the $x$-th number of the permutation. But the permutation $23154$ has a cycle of length three since $f(1) = 2$, $f(2) = 3$, $f(3) = 1$, and cycles after $3$ applications of $f$ when regarding a set of $3$ distinct numbers in the domain and range. Similarly the permutation $32541$ has a cycle of length three since $f(5) = 1$, $f(1) = 3$, and $f(3) = 5$. In a permutation of the natural numbers between $ 1$ and $2017$ inclusive, find the expected number of cycles of length $3$. [u]Round 8[/u] [b]8.[/b] Find the number of characters in the problems on the accuracy round test. This does not include spaces and problem numbers (or the periods after problem numbers). For example, “$1$. What’s $5 + 10$?” would contain $11$ characters, namely “$W$,” “$h$,” “$a$,” “$t$,” “$’$,” “$s$,” “$5$,” “$+$,” “$1$,” “$0$,” “?”. If the correct answer is $c$ and your answer is $x$, then your score will be $$\max \left\{ 0, 13 -\left\lceil \frac{|x-c|}{100} \right\rceil \right\}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

On circle in clockwise order are written positive integers from $1$ to $2010$. Let us cross out number $1$, then number $10$, then number $19$, and so on every $9$th number in that direction. Which number will be first crossed out twice? How many numbers at that moment are not crossed out?

Find the largest number $n$ that for which there exists $n$ positive integers such that non of them divides another one, but between every three of them, one divides the sum of the other two. [i]Proposed by Morteza Saghafian[/i]

$n$ students, numbered from $1$ to $n$ are sitting next to each other in a class. In the beginning the $1$st student has $n$ pieces of paper in one pile. The goal of the students is to distribute the $n$ pieces in a way that everyone gets exactly one. The teacher claps once in a minute and for each clap the students can choose one of the following moves (or do nothing): $\bullet$ They divide one of their piles of paper into two smaller piles. $\bullet$ They give one of their piles of paper to the student with the next number. At least how many times does the teacher need to clap in order to make it possible for the students to distribute all the pieces of paper amongst themselves?

Place $n$ points on a circle and draw all possible chord joining these points. If no three chord are concurent, find the number of disjoint regions created. [color=#008000]Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?f=151&t=260926&hilit=circle+points+segments+regions[/color]

Consider the $5\times 5$ grid $Z^2_5 = \{(a, b) : 0 \le a, b \le 4\}$. Say that two points $(a, b)$,$(x, y)$ are adjacent if $a - x \equiv -1, 0, 1$ (mod $5$) and $b - y \equiv -1, 0, 1$ (mod $5$) . For example, in the diagram, all of the squares marked with $\cdot$ are adjacent to the square marked with $\times$. [img]https://cdn.artofproblemsolving.com/attachments/2/6/c49dd26ab48ddff5e1beecfbd167d5bb9fe16d.png[/img] What is the largest number of $\times$ that can be placed on the grid such that no two are adjacent?

On a large, flat field $n$ people are positioned so that for each person the distances to all the other people are different. Each person holds a water pistol and at a given signal fires and hits the person who is closest. When $n$ is odd show that there is at least one person left dry. Is this always true when $n$ is even?

On the screen of a computer there is an $2^n\times 2^n$ board. On each cell of the main diagonal there is a file. At each step, we may select some files and move them to the left, on their respective rows, by the same distance. What is the minimum number of necessary moves in order to put all files on the first column? [i]Proposed by Vlad Spătaru[/i]

Every cell of a $m \times n$ chess board, $m\ge 2,n\ge 2$, is colored with one of four possible colors, e.g white, green, red, blue. We call such coloring good if the four cells of any $2\times 2$ square of the chessboard are colored with pairwise different colors. Determine the number of all good colorings of the chess board. [i]Proposed by N. Beluhov[/i]

There is a shape like this (Attachment down below) Find the number of triangles made by choosing 3 vertex from the 8 vertex in the attachment.

One side of a square sheet of paper is colored red, the other - in blue. On both sides, the sheet is divided into $n^2$ identical square cells. In each of these $2n^2$ cells is written a number from $1$ to $k$. Find the smallest $k$,for which the following properties hold simultaneously: (i) on the red side, any two numbers in different rows are distinct; (ii) on the blue side, any two numbers in different columns are different; (iii) for each of the $n^2$ squares of the partition, the number on the blue side is not equal to the number on the red side.

On a $3 \times 3$ board the numbers from $1$ to $9$ are written in some order and without repeating. We say that the arrangement obtained is [i]Isthmian [/i] if the numbers in any two adjacent squares have different parity. Determine the number of different Isthmian arrangements. Note: Two arrangements are considered equal if one can be obtained from the other by rotating the board.

An $n\times n$ table whose cells are numerated with numbers $1, 2,\cdots, n^2$ in some order is called [i]Naissus[/i] if all products of $n$ numbers written in $n$ [i]scattered[/i] cells give the same residue when divided by $n^2+1$. Does there exist a Naissus table for $(a) n = 8;$ $(b) n = 10?$ ($n$ cells are [i]scattered[/i] if no two are in the same row or column.) [i]Proposed by Marko Djikic[/i]

In how many ways can the number $2000$ be written as a sum of three positive, not necessarily different integers? (Sums like $1 + 2 + 3$ and $3 + 1 + 2$ etc. are the same.)

Suppose we have a necklace of $n$ beads. Each bead is labeled with an integer and the sum of all these labels is $n - 1$. Prove that we can cut the necklace to form a string, whose consecutive labels $x_1,x_2,...,x_n$ satisfy $\sum_{i=1}^{k} x_i \le k - 1$ for any $k = 1,...,n$

Let \(a\), \(b\), and \(n\) be positive integers. A lemonade stand owns \(n\) cups, all of which are initially empty. The lemonade stand has a [i]filling machine[/i] and an [i]emptying machine[/i], which operate according to the following rules: [list] [*]If at any moment, \(a\) completely empty cups are available, the filling machine spends the next \(a\) minutes filling those \(a\) cups simultaneously and doing nothing else. [*]If at any moment, \(b\) completely full cups are available, the emptying machine spends the next \(b\) minutes emptying those \(b\) cups simultaneously and doing nothing else. [/list] Suppose that after a sufficiently long time has passed, both the filling machine and emptying machine work without pausing. Find, in terms of \(a\) and \(b\), the least possible value of \(n\). [i]Proposed by Raymond Feng[/i]

$n$ people are in the plane, so that the closest person is unique and each one shoot this closest person with a squirt gun. If $n$ is odd, prove that there exists at least one person that nobody shot. If $n$ is even, will there always be a person who escape? Justify that.