[b]p1.[/b] We say that integers $a$ and $b$ are [i]friends [/i] if their product is a perfect square. Prove that if $a$ is a friend of $b$, then $a$ is a friend of $gcd (a, b)$. [b]p2.[/b] On the island of knights and liars, a traveler visited his friend, a knight, and saw him sitting at a round table with five guests. "I wonder how many knights are among you?" he asked. " Ask everyone a question and find out yourself" advised him one of the guests. "Okay. Tell me one: Who are your neighbors?" asked the traveler. This question was answered the same way by all the guests. "This information is not enough!" said the traveler. "But today is my birthday, do not forget it!" said one of the guests. "Yes, today is his birthday!" said his neighbor. Now the traveler was able to find out how many knights were at the table. Indeed, how many of them were there if [i]knights always tell the truth and liars always lie[/i]? [b]p3.[/b] A rope is folded in half, then in half again, then in half yet again. Then all the layers of the rope were cut in the same place. What is the length of the rope if you know that one of the pieces obtained has length of $9$ meters and another has length $4$ meters? [b]p4.[/b] The floor plan of the palace of the Shah is a square of dimensions $6 \times 6$, divided into rooms of dimensions $1 \times 1$. In the middle of each wall between rooms is a door. The Shah orders his architect to eliminate some of the walls so that all rooms have dimensions $2 \times 1$, no new doors are created, and a path between any two rooms has no more than $N$ doors. What is the smallest value of $N$ such that the order could be executed? [b]p5.[/b] There are $10$ consecutive positive integers written on a blackboard. One number is erased. The sum of remaining nine integers is $2011$. Which number was erased? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a $ 4\times 4$ squares table. How many ways that we can fill the table with $ \{0,1\}$ such that two neighbor squares (have one common side) have product which is equal to $ 0$?

In a game of Fish, R2 and R3 are each holding a positive number of cards so that they are collectively holding a total of $24$ cards. Each player gives an integer estimate for the number of cards he is holding, such that each estimate is an integer between $80\%$ of his actual number of cards and $120\%$ of his actual number of cards, inclusive. Find the smallest possible sum of the two estimates.

Let $n > 1$ be a given integer. An $n \times n \times n$ cube is composed of $n^3$ unit cubes. Each unit cube is painted with one colour. For each $n \times n \times 1$ box consisting of $n^2$ unit cubes (in any of the three possible orientations), we consider the set of colours present in that box (each colour is listed only once). This way, we get $3n$ sets of colours, split into three groups according to the orientation. It happens that for every set in any group, the same set appears in both of the other groups. Determine, in terms of $n$, the maximal possible number of colours that are present.

An integer $N \ge 2$ is given. A collection of $N(N + 1)$ soccer players, no two of whom are of the same height, stand in a row. Sir Alex wants to remove $N(N - 1)$ players from this row leaving a new row of $2N$ players in which the following $N$ conditions hold: ($1$) no one stands between the two tallest players, ($2$) no one stands between the third and fourth tallest players, $\;\;\vdots$ ($N$) no one stands between the two shortest players. Show that this is always possible. [i]Proposed by Grigory Chelnokov, Russia[/i]

There is a school with $n$ students. Suppose that every student has exactly $2023$ friends and every couple of student that are not friends has exactly $2022$ friends in common. Then find all values of $n$

Call a permutation of the integers $(1,2,\ldots,n)$ [i]$d$-ordered[/i] if it does not contains a decreasing subsequence of length $d$. Prove that for every $d=2,3,\ldots,n$, the number of $d$-ordered permutations of $(1,2,\ldots,n)$ is at most $(d-1)^{2n}$.

Around a circle are written$ 2009$ integers, not necessarily distinct, so that if two numbers are neighbors their difference is $1$ or $2$ . We will say that a number is [i]huge[/i] if it is greater than its two neighbors, and that it is [i]tiny[/i] if it is less than its two neighbors. The sum of all the huge numbers is equal to the sum of all the tiny numbers plus $1810$. . Determine how many odd numbers there can be around the circumference.

[b]p1.[/b] A straight line is painted in two colors. Prove that there are three points of the same color such that one of them is located exactly at the midpoint of the interval bounded by the other two. [b]p2.[/b] Find all positive integral solutions $x, y$ of the equation $xy = x + y + 3$. [b]p3.[/b] Can one cut a square into isosceles triangles with angle $80^o$ between equal sides? [b]p4.[/b] $20$ children are grouped into $10$ pairs: one boy and one girl in each pair. In each pair the boy is taller than the girl. Later they are divided into pairs in a different way. May it happen now that (a) in all pairs the girl is taller than the boy; (b) in $9$ pairs out of $10$ the girl is taller than the boy? [b]p5.[/b] Mr Mouse got to the cellar where he noticed three heads of cheese weighing $50$ grams, $80$ grams, and $120$ grams. Mr. Mouse is allowed to cut simultaneously $10$ grams from any two of the heads and eat them. He can repeat this procedure as many times as he wants. Can he make the weights of all three pieces equal? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [b]R1.[/b] What is $11^2 - 9^2$? [b]R2.[/b] Write $\frac{9}{15}$ as a decimal. [b]R3.[/b] A $90^o$ sector of a circle is shaded, as shown below. What percent of the circle is shaded? [b]R4.[/b] A fair coin is flipped twice. What is the probability that the results of the two flips are different? [b]R5.[/b] Wayne Dodson has $55$ pounds of tungsten. If each ounce of tungsten is worth $75$ cents, and there are $16$ ounces in a pound, how much money, in dollars, is Wayne Dodson’s tungsten worth? [b]R6.[/b] Tenley Towne has a collection of $28$ sticks. With these $28$ sticks he can build a tower that has $1$ stick in the top row, $2$ in the next row, and so on. Let $n$ be the largest number of rows that Tenley Towne’s tower can have. What is n? [b]R7.[/b] What is the sum of the four smallest primes? [b]R8 / P1.[/b] Let $ABC$ be an isosceles triangle such that $\angle B = 42^o$. What is the sum of all possible degree measures of angle $A$? [b]R9.[/b] Consider a line passing through $(0, 0)$ and $(4, 8)$. This line passes through the point $(2, a)$. What is the value of $a$? [b]R10 / P2.[/b] Brian and Stan are playing a game. In this game, Brian rolls a fair six-sided die, while Stan rolls a fair four-sided die. Neither person shows the other what number they rolled. Brian tells Stan, “The number I rolled is guaranteed to be higher than the number you rolled.” Stan now has to guess Brian’s number. If Stan plays optimally, what is the probability that Stan correctly guesses the number that Brian rolled? [b]R11.[/b] Guang chooses $4$ distinct integers between $0$ and $9$, inclusive. How many ways can he choose the integers such that every pair of chosen integers sums up to an even number? [b]R12 / P4.[/b] David is trying to write a problem for MBMT. He assigns degree measures to every interior angle in a convex $n$-gon, and it so happens that every angle he assigned is less than $144$ degrees. He tells Pratik the value of $n$ and the degree measures in the $n$-gon, and to David’s dismay, Pratik claims that such an $n$-gon does not exist. What is the smallest value of $n \ge 3$ such that Pratik’s claim is necessarily true? [b]R13 / P3.[/b] Consider a triangle $ABC$ with side lengths of $5$, $5$, and $2\sqrt5$. There exists a triangle with side lengths of $5, 5$, and $x$ ($x \ne 2\sqrt5$) which has the same area as $ABC$. What is the value of $x$? [b]R14 / P5.[/b] A mother has $11$ identical apples and $9$ identical bananas to distribute among her $3$ kids. In how many ways can the fruits be allocated so that each child gets at least one apple and one banana? [b]R15 / P7.[/b] Find the sum of the five smallest positive integers that cannot be represented as the sum of two not necessarily distinct primes. [b]P6.[/b] Srinivasa Ramanujan has the polynomial $P(x) = x^5 - 3x^4 - 5x^3 + 15x^2 + 4x - 12$. His friend Hardy tells him that $3$ is one of the roots of $P(x)$. What is the sum of the other roots of $P(x)$? [b]P8.[/b] $ABC$ is an equilateral triangle with side length $10$. Let $P$ be a point which lies on ray $\overrightarrow{BC}$ such that $PB = 20$. Compute the ratio $\frac{PA}{PC}$. [b]P9.[/b] Let $ABC$ be a triangle such that $AB = 10$, $BC = 14$, and $AC = 6$. The median $CD$ and angle bisector $CE$ are both drawn to side $AB$. What is the ratio of the area of triangle $CDE$ to the area of triangle $ABC$? [b]P10.[/b] Find all integer values of $x$ between $0$ and $2017$ inclusive, which satisfy $$2016x^{2017} + 990x^{2016} + 2x + 17 \equiv 0 \,\,\, (mod \,\,\, 2017).$$ [b]P11.[/b] Let $x^2 + ax + b$ be a quadratic polynomial with positive integer roots such that $a^2 - 2b = 97$. Compute $a + b$. [b]P12.[/b] Let $S$ be the set $\{2, 3, ... , 14\}$. We assign a distinct number from $S$ to each side of a six-sided die. We say a numbering is predictable if prime numbers are always opposite prime numbers and composite numbers are always opposite composite numbers. How many predictable numberings are there? (Rotations of a die are not distinct) [b]P13.[/b] In triangle $ABC$, $AB = 10$, $BC = 21$, and $AC = 17$. $D$ is the foot of the altitude from $A$ to $BC$, $E$ is the foot of the altitude from $D$ to $AB$, and $F$ is the foot of the altitude from $D$ to $AC$. Find the area of the smallest circle that contains the quadrilateral $AEDF$. [b]P14.[/b] What is the greatest distance between any two points on the graph of $3x^2 + 4y^2 + z^2 - 12x + 8y + 6z = -11$? [b]P15.[/b] For a positive integer $n$, $\tau (n)$ is defined to be the number of positive divisors of $n$. Given this information, find the largest positive integer $n$ less than $1000$ such that $$\sum_{d|n} \tau (d) = 108.$$ In other words, we take the sum of $\tau (d)$ for every positive divisor $d$ of $n$, which has to be $108$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

New license plates consist of two letters, three digits, and two letters (from the English alphabet of$ 26$ letters). What is the largest possible number of such license plates if it is required that every two of them differ at no less than two positions?

Nickolas and Peter divide $2n+1$ nuts amongst each other. Both of them want to get as many as possible. Three methods are suggested to them for doing so, each consisting of three stages. The first two stages are the same in all three methods: [i]Stage 1:[/i] Peter divides the nuts into 2 heaps, each containing at least 2 nuts. [i]Stage 2:[/i] Nickolas divides both heaps into 2 heaps, each containing at least 1 nut. Finally, stage 3 varies among the three methods as follows: [i]Method 1:[/i] Nickolas takes the smallest and largest of the heaps. [i]Method 2:[/i] Nickolas takes the two middle size heaps. [i]Method 3:[/i] Nickolas chooses between taking the biggest and the smallest heap or the two middle size heaps, but gives one nut to Peter for the right of choice. Determine the most and the least profitable method for Nickolas.

Let $P$ be a non-selfintersecting closed polygon with $n$ sides. Let its vertices be $P_1 , P_2 ,\ldots, P_n .$ Let $m$ other points,$Q_1 , Q_2 ,\ldots, Q_m $ , interior to $P$, be given. Let the figure be triangulated. This means that certain pairs of the $(n+m)$ points $P_1 ,\ldots , Q_m$ are connected by line segments such that (i) the resulting figure consists exclusively of a set $T$ of triangles, (ii) if two different triangles in $T$ have more than a vertex in common then they have exactly a side in common, and (iii) the set of vertices of the triangles in $T$ is precisely the set of the $(n+m)$ points $P_1 ,\ldots , Q_m.$ How many triangles are in $T$?

Prove by the method of induction that: [b]a)[/b] $ a!b! $ divides $ (a+b)! , $ for any natural numbers $ a,b. $ [b]b)[/b] $ p $ divides $ (-1)^{k+1} +\binom{p-1}{k} , $ for any odd primes $ p $ and $ k\in\{ 0,1,\ldots ,p-1\} . $

In each cell of a $4 \times 4$ grid, one of the two diagonals is drawn uniformly at random. Compute the probability that the resulting $32$ triangular regions can be colored red and blue so that any two regions sharing an edge have different colors.

Five points are chosen on the sphere, no three of them lying on a great circle (a great circle is the intersection of the sphere with some plane passing through the sphere’s centre). Two great circles not containing any of the chosen points are called equivalent if one of them can be moved to the other without passing through any chosen points. (a) How many nonequivalent great circles not containing any chosen points can be drawn on the sphere? (b) Answer the same problem, but with $n$ chosen points.

In each cell of the table $ 3 \times 3 $ there is one of the numbers $1, 2$ and $3$. Dima counted the sum of the numbers in each row and in each column. What is the greatest number of different sums he could get?

In a planar coordinate system, the points have non-negative integer coordinates numbered according to the figure. E.g. the point $(3,1)$ has the number $12$. [img]https://cdn.artofproblemsolving.com/attachments/a/a/28725d75f281ac4618129067037d751c8d8f83.png[/img] What is the number of the point$(x,y)$?

Six tennis players gather to play in a tournament where each pair of persons play one game, with one person declared the winner and the other person the loser. A triplet of three players $\{\mathit{A}, \mathit{B}, \mathit{C}\}$ is said to be [i]cyclic[/i] if $\mathit{A}$ wins against $\mathit{B}$, $\mathit{B}$ wins against $\mathit{C}$ and $\mathit{C}$ wins against $\mathit{A}$. [list] [*] (a) After the tournament, the six people are to be separated in two rooms such that none of the two rooms contains a cyclic triplet. Prove that this is always possible. [*] (b) Suppose there are instead seven people in the tournament. Is it always possible that the seven people can be separated in two rooms such that none of the two rooms contains a cyclic triplet?[/list]

A student has $100$ cards on which the integers $1$ to $100$ are printed, as well as a sufficiently large number of cards on which the symbols $+$ and $=$ are printed. What is the maximal number of correct equalities the student can construct, if each card is used at most once? (R Zhenodarov)

Consider a rectangular array of single digits $d_{i,j}$ with 10 rows and 7 columns, such that $d_{i+1,j}-d_{i,j}$ is always 1 or -9 for all $1 \leq i \leq 9$ and all $1 \leq j \leq 7$, as in the example below. For $1 \leq i \leq 10$, let $m_i$ be the median of $d_{i,1}$, ..., $d_{i,7}$. Determine the least and greatest possible values of the mean of $m_1$, $m_2$, ..., $m_{10}$. Example: [img]https://cdn.artofproblemsolving.com/attachments/8/a/b77c0c3aeef14f0f48d02dde830f979eca1afb.png[/img]

Let $S$ be a set consisting of $m$ pairs $(a,b)$ of positive integers with the property that $1 \leq a < b \leq n$. Show that there are at least \[ 4m \cdot \dfrac{(m - \dfrac{n^2}{4})}{3n} \] triples $(a,b,c)$ such that $(a,b)$, $(a,c)$, and $(b,c)$ belong to $S$.

For a given number $ n $, let us denote by $ p_n $ the probability that when randomly selecting a pair of integers $ k, m $ satisfying the conditions $ 0 \leq k \leq m \leq 2^n $ (the selection of each pair is equally probable) the number $\binom{m}{k}$ will be even. Calculate $ \lim_{n\to \infty} p_n $.

[b]p1.[/b] For what integers $x$ is it possible to find an integer $y$ such that $$x(x + 1) (x + 2) (x + 3) + 1 = y^2 ?$$ [b]p2.[/b] Two tangents to a circle are parallel and touch the circle at points $A$ and $B$, respectively. A tangent to the circle at any point $X$, other than $A$ or $B$, meets the first tangent at $Y$ and the second tangent at $Z$. Prove $AY \cdot BZ$ is independent of the position of $X$. [b]p3.[/b] If $a, b, c$ are positive real numbers, prove that $$8abc \le (b + c) (c + a) (a + b)$$ by first verifying the relation in the special case when $c = b$. [b]p4.[/b] Solve the equation $$\frac{x^2}{3}+\frac{48}{x^2}=10 \left( \frac{x}{3}-\frac{4}{x}\right)$$ [b]p5.[/b] Tom and Bill live on the same street. Each boy has a package to deliver to the other boy’s house. The two boys start simultaneously from their own homes and meet $600$ yards from Bill's house. The boys continue on their errand and they meet again $700$ yards from Tom's house. How far apart do the boy's live? [b]p6.[/b] A standard set of dominoes consists of $28$ blocks of size $1$ by $2$. Each block contains two numbers from the set $0,1,2,...,6$. We can denote the block containing $2$ and $3$ by $[2, 3]$, which is the same block as $[3, 2]$. The blocks $[0, 0]$, $[1, 1]$,..., $[6, 6]$ are in the set but there are no duplicate blocks. a) Show that it is possible to arrange the twenty-eight dominoes in a line, end-to-end, with adjacent ends matching, e. g., $... [3, 1]$ $[1, 1]$ $[1, 0]$ $[0, 6] ...$ . b) Consider the set of dominoes which do not contain $0$. Show that it is impossible to arrange this set in such a line. c) Generalize the problem and prove your generalization. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the number of permutations $(a_1, a_2, . . . , a_{2013})$ of $(1, 2, \dots , 2013)$ such that there are exactly two indices $i \in \{1, 2, \dots , 2012\}$ where $a_i < a_{i+1}$.