Call admissible a set $A$ of integers that has the following property: If $x,y \in A$ (possibly $x=y$) then $x^2+kxy+y^2 \in A$ for every integer $k$. Determine all pairs $m,n$ of nonzero integers such that the only admissible set containing both $m$ and $n$ is the set of all integers. [i]Proposed by Warut Suksompong, Thailand[/i]

Positive integers $a, b$ satisfy equality $b^2 = a^2 + ab + b$. Prove that $b$ is a square of a positive integer. (Patrik Bak)

A cube stands on one of the squares of an infinite chessboard. On each face of the cube there is an arrow pointing in one of the four directions parallel to the sides of the face. Anton looks on the cube from above and rolls it over an edge in the direction pointed by the arrow on the top face. Prove that the cube cannot cover any $5\times 5$ square.

Find all natural solutions of $3^{x}= 2^{x}y+1.$

6) $G$ group, $G_{m}$ and $G_{n}$ commutative subgroups being the $m$ and $n$ th powers of the elements in $G$. Prove $G_{gcd(m,n)}$ is commutative.

Let $C (O)$ be a circle (with center $O$ ) and $A, B$ points on the circle with $\angle AOB = 90^o$. Circles $C_1 (O_1)$ and $C_2 (O_2)$ are tangent internally with circle $C$ at $A$ and $B$, respectively, and, also, are tangent to each other. Consider another circle $C_3 (O_3)$ tangent externally to the circles $C_1, C_2$ and tangent internally to circle $C$, located inside angle $\angle AOB$. Show that the points $O, O_1, O_2, O_3$ are the vertices of a rectangle.

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Let $ \alpha(n)$ be the number of digits equal to one in the binary representation of a positive integer $ n.$ Prove that: (a) the inequality $ \alpha(n) (n^2 ) \leq \frac{1}{2} \alpha(n)(\alpha(n) + 1)$ holds; (b) the above inequality is an equality for infinitely many positive integers, and (c) there exists a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i }$ goes to zero as $ i$ goes to $ \infty.$ [i]Alternative problem:[/i] Prove that there exists a sequence a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i )}$ (d) $ \infty;$ (e) an arbitrary real number $ \gamma \in (0,1)$; (f) an arbitrary real number $ \gamma \geq 0$; as $ i$ goes to $ \infty.$

A rectangular field is 300 feet wide and 400 feet long. Random sampling indicates that there are, on the average, three ants per square inch through out the field. [12 inches = 1 foot.] Of the following, the number that most closely approximates the number of ants in the field is $\textbf{(A)}\ \text{500 thousand} \qquad \textbf{(B)}\ \text{5 million} \qquad \textbf{(C)}\ \text{50 million} \qquad \textbf{(D)}\ \text{500 million} \qquad \textbf{(E)}\ \text{5 billion}$

In triangle $ABC$ , $AA_0,BB_0,CC_0$ are the angle bisectors , $A_0,B_0,C_0$are on sides $BC,CA,AB,$ draw $A_0A_1//BB_0,A_0A_2//CC_0$ ,$A_1$ lies on $AC$ ,$A_2$ lies on $AB$ , $A_1A_2$ intersects $BC$ at $A_3$.$B_3$ ,$C_3$ are constructed similarly.Prove that : $A_3,B_3,C_3$ are collinear.

[u]Set 5[/u] [b]p13.[/b] An equiangular $12$-gon has side lengths that alternate between $2$ and $\sqrt3$. Find the area of the circumscribed circle of this $12$-gon. [b]p14.[/b] For positive integers $n$, let $\sigma(n)$ denote the number of positive integer factors of $n$. Then $\sigma(17280) = \sigma (2^7 \cdot 3^3 \cdot 5)= 64$. Let $S$ be the set of factors $k$ of $17280$ such that $\sigma(k) = 32$. If $p$ is the product of the elements of $S$, find $\sigma(p)$. [b]p15.[/b] How many odd $3$-digit numbers have exactly four $1$’s in their binary (base $2$) representation? For example, $225_{10} = 11100001_2$ would be valid. PS. You should use hide for answers.

The triangles $BCD$ and $ACE$ are externally constructed to sides $BC$ and $CA$ of a triangle $ABC$ such that $AE = BD$ and $\angle BDC+\angle AEC = 180^\circ$. Let $F$ be a point on segment $AB$ such that ${AF\over FB}={CD\over CE}$. Prove that ${DE\over CD+CE}={EF\over BC}={FD\over AC}$.

For each $x>e^e$ define a sequence $S_x=u_0,u_1,\ldots$ recursively as follows: $u_0=e$, and for $n\ge0$, $u_{n+1}=\log_{u_n}x$. Prove that $S_x$ converges to a number $g(x)$ and that the function $g$ defined in this way is continuous for $x>e^e$.

A solid right circular cylinder with height $h$ and base-radius $r$ has a solid hemisphere of radius $r$ resting upon it. The center of the hemisphere $O$ is on the axis of the cylinder. Let $P$ be any point on the surface of the hemisphere and $Q$ the point on the base circle of the cylinder that is furthest from $P$ (measuring along the surface of the combined solid). A string is stretched over the surface from $P$ to $Q$ so as to be as short as possible. Show that if the string is not in a plane, the straight line $PO$ when produced cuts the curved surface of the cylinder.

A set of points in the plane is called [i]free [/i] if no three points of the set are the vertices of an equilateral triangle. Prove that any set of $n$ points in the plane has a free subset of at least $\sqrt{n}$ points

[u]Set 4[/u] [b]p16.[/b] Albert, Beatrice, Corey, and Dora are playing a card game with two decks of cards numbered $1-50$ each. Albert, Beatrice, and Corey draw cards from the same deck without replacement, but Dora draws from the other deck. What is the probability that the value of Corey’s card is the highest value or is tied for the highest value of all $4$ drawn cards? [b]p17.[/b] Suppose that $s$ is the sum of all positive values of $x$ that satisfy $2016\{x\} = x+[x]$. Find $\{s\}$. (Note: $[x]$ denotes the greatest integer less than or equal to $x$ and $\{x\}$ denotes $x - [x]$.) [b]p18.[/b] Let $ABC$ be a triangle such that $AB = 41$, $BC = 52$, and $CA = 15$. Let H be the intersection of the $B$ altitude and $C$ altitude. Furthermore let $P$ be a point on $AH$. Both $P$ and $H$ are reflected over $BC$ to form $P'$ and $H'$ . If the area of triangle $P'H'C$ is $60$, compute $PH$. [b]p19.[/b] A random integer $n$ is chosen between $1$ and $30$, inclusive. Then, a random positive divisor of $n, k$, is chosen. What is the probability that $k^2 > n$? [b]p20.[/b] What are the last two digits of the value $3^{361}$? [u]Set 5[/u] [b]p21.[/b] Let $f(n)$ denote the number of ways a $3 \times n$ board can be completely tiled with $1 \times 3$ and $1 \times 4$ tiles, without overlap or any tiles hanging over the edge. The tiles may be rotated. Find $\sum^9_{i=0} f(i) = f(0) + f(1) + ... + f(8) + f(9)$. By convention, $f(0) = 1$. [b]p22.[/b] Find the sum of all $5$-digit perfect squares whose digits are all distinct and come from the set $\{0, 2, 3, 5, 7, 8\}$. [b]p23.[/b] Mary is flipping a fair coin. On average, how many flips would it take for Mary to get $4$ heads and $2$ tails? [b]p24.[/b] A cylinder is formed by taking the unit circle on the $xy$-plane and extruding it to positive infinity. A plane with equation $z = 1 - x$ truncates the cylinder. As a result, there are three surfaces: a surface along the lateral side of the cylinder, an ellipse formed by the intersection of the plane and the cylinder, and the unit circle. What is the total surface area of the ellipse formed and the lateral surface? (The area of an ellipse with semi-major axis $a$ and semi-minor axis $b$ is $\pi ab$.) [b]p25.[/b] Let the Blair numbers be defined as follows: $B_0 = 5$, $B_1 = 1$, and $B_n = B_{n-1} + B_{n-2}$ for all $n \ge 2$. Evaluate $$\sum_{i=0}^{\infty} \frac{B_i}{51^i}= B_0 +\frac{B_1}{51} +\frac{B_2}{51^2} +\frac{B_3}{51^3} +...$$ [u]Estimation[/u] [b]p26.[/b] Choose an integer between $1$ and $10$, inclusive. Your score will be the number you choose divided by the number of teams that chose your number. [b]p27.[/b] $2016$ blind people each bring a hat to a party and leave their hat in a pile at the front door. As each partier leaves, they take a random hat from the ones remaining in a pile. Estimate the probability that at least $1$ person gets their own hat back. [b]p28.[/b] Estimate how many lattice points lie within the graph of $|x^3| + |y^3| < 2016$. [b]p29.[/b] Consider all ordered pairs of integers $(x, y)$ with $1 \le x, y \le 2016$. Estimate how many such ordered pairs are relatively prime. [b]p30.[/b] Estimate how many times the letter “e” appears among all Guts Round questions. PS. You should use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c3h2779594p24402189]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

(a) Let $z$ be a solution of the quadratic equation $$az^2 +bz+c=0$$ and let $n$ be a positive integer. Show that $z$ can be expressed as a rational function of $z^n , a,b,c.$ (b) Using (a) or by any other means, express $x$ as a rational function of $x^{3}$ and $x+\frac{1}{x}.$

For triangle $ABC, P$ and $Q$ satisfy $\angle BPA + \angle AQC = 90^o$. It is provided that the vertices of the triangle $BAP$ and $ACQ$ are ordered counterclockwise (or clockwise). Let the intersection of the circumcircles of the two triangles be $N$ ($A \ne N$, however if $A$ is the only intersection $A = N$), and the midpoint of segment $BC$ be $M$. Show that the length of $MN$ does not depend on $P$ and $Q$.

Jeremy wrote all the three-digit integers from $100$ to $999$ on a blackboard. Then Allison erased each of the $2700$ digits Jeremy wrote and replaced each digit with the square of that digit. Thus, Allison replaced every 1 with a 1, every 2 with a 4, every 3 with a 9, every 4 with a 16, and so forth. The proportion of all the digits Allison wrote that were ones is $\frac{m}{n}$ , where m and n are relatively prime positive integers. Find $m + n.$

In the following figure, it is desired to go from point \( A \) to point \( B \) by walking only along the lines of the figure up and to the right. How many different paths can we take? [img]https://cdn.artofproblemsolving.com/attachments/7/c/dce2e0bcb69c9e2014474ab3699b4ef0470497.png[/img]

Find all positive integers $a, b, c$, such that $(8a-5b)^2 + (3b-2c)^2 + (3c-7a)^2 = 2$.

Find all pairs of prime numbers $p,\,q(p\le q)$ satisfying the following condition: There exists a natural number $n$ such that $2^{n}+3^{n}+\cdots+(2pq-1)^{n}$ is a multiple of $2pq$.

For a natural number $n \ge 3$, we draw $n - 3$ internal diagonals in a non self-intersecting, but not necessarily convex, n-gon, cutting the $n$-gon into $n - 2$ triangles. It is known that the value (in degrees) of any angle in any of these triangles is a natural number and no two of these angle values are equal. What is the largest possible value of $n$?

There is a board with $n$ rows and $4$ columns, and white, yellow and light blue chips. Player $A$ places four tokens on the first row of the board and covers them so Player $B$ doesn't know them. How should player $B$ do to fill the minimum number of rows with chips that will ensure that in any of the rows he will have at least three hits? Clarification: A hit by player $B$ occurs when he places a token of the same color and in the same column as $A$.

Let $P(z) = z^8 + (4\sqrt{3} + 6) z^4 - (4\sqrt{3}+7)$. What is the minimum perimeter among all the 8-sided polygons in the complex plane whose vertices are precisely the zeros of $P(z)$? $ \textbf{(A)}\ 4\sqrt{3}+4 \qquad \textbf{(B)}\ 8\sqrt{2} \qquad \textbf{(C)}\ 3\sqrt{2}+3\sqrt{6} \qquad \textbf{(D)}\ 4\sqrt{2}+4\sqrt{3} \qquad $ $\textbf{(E)}\ 4\sqrt{3}+6 $