Determine all pairs of non-negative integers $(m, n)$ with m ≥n, such that $(m+n)^3$ divides $2n(3m^2+n^2)+8$

$ P$ is a point on the exterior of a circle centered at $ O$. The tangents to the circle from $ P$ touch the circle at $ A$ and $ B$. Let $ Q$ be the point of intersection of $ PO$ and $ AB$. Let $ CD$ be any chord of the circle passing through $ Q$. Prove that $ \triangle PAB$ and $ \triangle PCD$ have the same incentre.

For the team, power, and tournament rounds, BMT divided up the teams into $14$ rooms. You sign up to proctor all $3$ rounds, but you cannot proctor in the same room more than once. How many ways can you be assigned for rooms for the $3$ rounds?

Let $\delta$ be a symbol such that $\delta \neq 0$ and $\delta^2 = 0$. Define $\mathbb R[\delta] = \{a + b \delta | a, b \in \mathbb R\}$, where $a+ b \delta = c+ d \delta$ if and only if $a = c$ and $b = d$, and define \[(a + b \delta) + (c + d \delta) = (a + c) + (b + d) \delta,\]\[(a + b \delta) \cdot (c + d \delta) = ac + (ad + bc) \delta.\] Let $P(x)$ be a polynomial with real coefficients. Show that $P(x)$ has a multiple real root if and only if $P(x)$ has a non-real root in $\mathbb R[\delta].$

In the coordinate plane a parabola passes through the points $(7,6)$, $(7,12)$, $(18,19)$, and $(18,48)$. The axis of symmetry of the parabola is a line with slope $\tfrac{r}{s}$ where r and s are relatively prime positive integers. Find $r + s$.

For how many positive integers $n\le100$ is it true that $10n$ has exactly three times as many positive divisors as $n$ has?

Prove that a prime $p$ is expressible in the form $x^2+3y^2;x,y\in Z$ if and only if it is expressible in the form $ m^2+mn+n^2;m,n \in Z$.Can $p$ be replaced by a natural number $n$?

$a_1,a_2,\dots ,a_n>0$ are positive real numbers such that $\sum_{i=1}^{n} \frac{1}{a_i}=n$ prove that: $\sum_{i<j} \left(\frac{a_i-a_j}{a_i+a_j}\right)^2\le\frac{n^2}{2}\left(1-\frac{n}{\sum_{i=1}^{n}a_i}\right)$

Let $I$ be the incentre of a non-equilateral triangle $ABC$, $I_A$ be the $A$-excentre, $I'_A$ be the reflection of $I_A$ in $BC$, and $l_A$ be the reflection of line $AI'_A$ in $AI$. Define points $I_B$, $I'_B$ and line $l_B$ analogously. Let $P$ be the intersection point of $l_A$ and $l_B$. [list=a] [*] Prove that $P$ lies on line $OI$ where $O$ is the circumcentre of triangle $ABC$. [*] Let one of the tangents from $P$ to the incircle of triangle $ABC$ meet the circumcircle at points $X$ and $Y$. Show that $\angle XIY = 120^{\circ}$. [/list]

[b]Q13.[/b] Determine the greatest value of the sum $M=11xy+3x+2012yz$, where $x,y,z$ are non negative integers satisfying condition $x+y+z=1000.$

Triangular grid divides an equilateral triangle with sides of length $n$ into $n^2$ triangular cells as shown in figure for $n=12$. Some cells are infected. A cell that is not yet infected, ia infected when it shares adjacent sides with at least two already infected cells. Specify for $n=12$, the least number of infected cells at the start in which it is possible that over time they will infected all the cells of the original triangle. [asy] unitsize(0.25cm); path p=polygon(3); for(int m=0; m<=11;++m){ for(int n=0 ; n<= 11-m; ++n){ draw(shift((n+0.5*m)*sqrt(3),1.5*m)*p); } } [/asy]

Bob plays a game on the whiteboard. Initially, the numbers $\{1, 2, ...,n\}$ are shown. On each turn, Bob takes two numbers from the board $x$, $y$, erases them both, and writes down $2x + y$ onto the board. In terms of n, what is the maximum possible value that Bob can end up with?

Let $ABCD$ be a parallelogram. Let $\omega_1$ be the circle passing through $D$ tangent to $AB$ at $A$. Let $\omega_2$ be the circle passing through $A$ tangent to $CD$ at $D$. The tangents from $B$ to $\omega_1$ touch it at $A$ and $P$. The tangents from $C$ to $\omega_2$ touch it at $D$ and $Q$. Lines $AP$ and $DQ$ intersect at $X$. The perpendicular bisector of $BC$ intersects $AD$ at $R$. Show that the circumcircles of triangles $\triangle PQX$, $\triangle BCR$ are concentric.

Triangle $ABC$ has an inscribed circle tangent to sides $AB$, $AC$ and $BC$ at points $C_1$, $B_1$ and $A_1 $ respectively. Let $K$ be a point on the circle diametrically opposite to point $C_1$, $D$ be the intersection point of lines $B_1C_1$ and $A_1K$. Prove that $CD = CB_1$.

A convex quadrilateral $ABCD$ is given. Let $O_a$ be the circumcenter of the triangle $DBC$, and define $O_b,O_c$ and $O_d$ similarly. The points $O_a, O_b, O_c, O_d$ are the vertices of a convex quadrilateral. Prove that its area is equal to half of the absolute value of the difference between the areas of $AO_bCO_d$ and $BO_cDO_a$. [i]Proposed by V. Dubrovsky[/i]

Let $ABC$ be a triangle with circumcircle $\Omega$ and incentre $I$. A line $\ell$ intersects the lines $AI$, $BI$, and $CI$ at points $D$, $E$, and $F$, respectively, distinct from the points $A$, $B$, $C$, and $I$. The perpendicular bisectors $x$, $y$, and $z$ of the segments $AD$, $BE$, and $CF$, respectively determine a triangle $\Theta$. Show that the circumcircle of the triangle $\Theta$ is tangent to $\Omega$.

Let $ABCD$ be a quadrilateral whose diagonals are not perpendicular and whose sides $AB$ and $CD$ are not parallel.Let $O$ be the intersection of its diagonals.Denote with $H_1$ and $H_2$ the orthocenters of triangles $AOB$ and $COD,$ respectively.If $M$ and $N$ are the midpoints of the segment lines $AB$ and $CD,$ respectively.Prove that the lines $H_1H_2$ and $MN$ are parallel if and only if $AC=BD.$

In the diagram below, a triangular array of three congruent squares is configured such that the top row has one square and the bottom row has two squares. The top square lies on the two squares immediately below it. Suppose that the area of the triangle whose vertices are the centers of the three squares is $100.$ Find the area of one of the squares. [asy] unitsize(1.25cm); draw((0,0)--(1,0)--(1,1)--(0,1)--(0,0)); draw((1,0)--(2,0)--(2,1)--(1,1)); draw((1.5,1)--(1.5,2)--(0.5,2)--(0.5,1)); draw((0.5,0.5)--(1.5,0.5)--(1,1.5)--(0.5,0.5),dashed); [/asy]

Benedek draws circles with the same center in the following way. The first circle he draws has radius $1$. Next, he draws a second circle such that the ring between the first and second circles has twice the area of the first circle. Next, he draws a third circle such that the ring between the second and third circles is three times the area of the first circle, and so on (see the diagram). What is the smallest $n$ fow which the radius of the $n$-th circle is an integer greater than $1$? [img]https://cdn.artofproblemsolving.com/attachments/e/2/afa6d5ead6f2252aa821028370a3768912e674.png[/img]

$n$ players took part in badminton tournament, where $n$ is positive and odd integer. Each two players played two matches with each other. There were no draws. Each player has won as many matches as he has lost. Prove that you can cancel half of the matches s.t. each player still has won as many matches as he has lost.

Each grid point of a cartesian plane is colored with one of three colors, whereby all three colors are used. Show that one can always find a right-angled triangle, whose three vertices have pairwise different colors.

Let $a,b,c$ be positive real numbers with $a^2+b^2+c^2 \geq 3$. Prove that: $$\frac{(a+1)(b+2)}{(b+1)(b+5)}+\frac{(b+1)(c+2)}{(c+1)(c+5)}+\frac{(c+1)(a+2)}{(a+1)(a+5)} \geq \frac{3}{2}.$$

The vertices $ A$ and $ B$ of an equilateral triangle $ ABC$ lie on a circle $k$ of radius $1$, and the vertex $ C$ is in the interior of the circle $ k$. A point $ D$, different from $ B$, lies on $ k$ so that $ AD\equal{}AB$. The line $ DC$ intersects $ k$ for the second time at point $ E$. Find the length of the line segment $ CE$.

[b]p1.[/b] Suppose Mitchell has a fair die. He is about to roll it six times. The probability that he rolls $1$, $2$, $3$, $4$, $5$, and then $6$ in that order is $p$. The probability that he rolls $2$, $2$, $4$, $4$, $6$, and then $6$ in that order is $q$. What is $p - q$? [b]p2.[/b] What is the smallest positive integer $x$ such that $x \equiv 2017$ (mod $2016$) and $x \equiv 2016$ (mod $2017$) ? [b]p3.[/b] The vertices of triangle $ABC$ lie on a circle with center $O$. Suppose the measure of angle $ACB$ is $45^o$. If $|AB| = 10$, then what is the distance between $O$ and the line $AB$? [b]p4.[/b] A “word“ is a sequence of letters such as $YALE$ and $AELY$. How many distinct $3$-letter words can be made from the letters in $BOOLABOOLA$ where each letter is used no more times than the number of times it appears in $BOOLABOOLA$? [b]p5.[/b] How many distinct complex roots does the polynomial $p(x) = x^{12} - x^8 - x^4 + 1$ have? [b]p6.[/b] Notice that $1 = \frac12 + \frac13 + \frac16$ , that is, $1$ can be expressed as the sum of the three fractions $\frac12 $, $\frac13$ , and $\frac16$ , where each fraction is in the form $\frac{1}{n}$, with each $n$ different. Give a $6$-tuple of distinct positive integers $(a, b, c, d, e, f)$ where $a < b < c < d < e < f$ such that $\frac{1}{a} +\frac{1}{b} + \frac{1}{c} + \frac{1}{d} + \frac{1}{e} + \frac{1}{f} = 1$ and explain how you arrived at your $6$-tuple. Multiple answers will be accepted. [b]p7.[/b] You have a Monopoly board, an $11 \times 11$ square grid with the $9 \times 9$ internal square grid removed, where every square is blank except for Go, which is the square in the bottom right corner. During your turn, you determine how many steps forward (which is in the counterclockwise direction) to move by rolling two standard $6$-sided dice. Let $S$ be the set of squares on the board such that if you are initially on a square in $S$, no matter what you roll with the dice, you will always either land on Go (move forward enough squares such that you end up on Go) or you pass Go (you move forward enough squares such that you step on Go during your move and then you advance past Go). You randomly and uniformly select one square in $S$ as your starting position. What is the probability that you land on Go? [b]p8.[/b] Using $L$-shaped triominos, and dominos, where each square of a triomino and a domino covers one unit, what is the minimum number of tiles needed to cover a $3$-by-$2017$ rectangle without any gaps? [b]p9.[/b] Does there exist a pair of positive integers $(x, y)$, where $x < y$, such that $x^2 + y^2 = 1009^3$? If so, give a pair $(x, y)$ and explain how you found that pair. If not, explain why. [b]p10.[/b] Triangle $ABC$ has inradius $8$ and circumradius $20$. Let $M$ be the midpoint of side $BC$, and let $N$ be the midpoint of arc $BC$ on the circumcircle not containing $A$. Let $s_A$ denote the length of segment $MN$, and define $s_B$ and $s_C$ similarly with respect to sides $CA$ and $AB$. Evaluate the product $s_As_Bs_C$. [b]p11.[/b] Julia and Dan want to divide up $256$ dollars in the following way: in the first round, Julia will offer Dan some amount of money, and Dan can choose to accept or reject the offer. If Dan accepts, the game is over. Otherwise, if Dan rejects, half of the money disappears. In the second round, Dan can offer Julia part of the remaining money. Julia can then choose to accept or reject the offer. This process goes on until an offer is accepted or until $4$ rejections have been made; once $4$ rejections are made, all of the money will disappear, and the bargaining process ends. If Julia or Dan is indifferent between accepting and rejecting an offer, they will accept the offer. Given that Julia and Dan are both rational and both have the goal of maximizing the amount of money they get, how much will Julia offer Dan in the first round? [b]p12.[/b] A perfect partition of a positive integer $N$ is an unordered set of numbers (where numbers can be repeated) that sum to $N$ with the property that there is a unique way to express each positive integer less than $N$ as a sum of elements of the set. Repetitions of elements of the set are considered identical for the purpose of uniqueness. For example, the only perfect partitions of $3$ are $\{1, 1, 1\}$ and $\{1, 2\}$. $\{1, 1, 3, 4\}$ is NOT a perfect partition of $9$ because the sum $4$ can be achieved in two different ways: $4$ and $1 + 3$. How many integers $1 \le N \le 40$ each have exactly one perfect partition? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Krut and Vert go by car from point $A$ to point $B$. The car leaves $A$ in the direction of $B$, but every $3$ km of the road Krut turns $90^o$ to the left, and every $7$ km of the road Vert turns $90^o$ to the right ( if they try to turn at the same time, the car continues to go in the same direction). Will Krut and Vert be able to get to $B$ if the distance between $A$ and $B$ is $100$ km?