Do there exist $\{x,y\}\in\mathbb{Z}$ satisfying $(2x+1)^{3}+1=y^{4}$?

Let $ABC$ be a triangle, and let $M$ be a point on the side $(AC)$ .The line through $M$ and parallel to $BC$ crosses $AB$ at $N$. Segments $BM$ and $CN$ cross at $P$, and the circles $BNP$ and $CMP$ cross again at $Q$. Show that angles $BAP$ and $CAQ$ are equal.

For real numbers $x$, $y$ and $z$, solve the system of equations: $$x^3+y^3=3y+3z+4$$ $$y^3+z^3=3z+3x+4$$ $$x^3+z^3=3x+3y+4$$

Pentagon $ABCDE$ consists of a square $ACDE$ and an equilateral triangle $ABC$ that share the side $\overline{AC}$. A circle centered at $C$ has area 24. The intersection of the circle and the pentagon has half the area of the pentagon. Find the area of the pentagon. [asy]/* File unicodetex not found. */ /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(4.26cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -1.52, xmax = 2.74, ymin = -2.18, ymax = 6.72; /* image dimensions */ draw((0,1)--(2,1)--(2,3)--(0,3)--cycle); draw((0,3)--(2,3)--(1,4.73)--cycle); /* draw figures */ draw((0,1)--(2,1)); draw((2,1)--(2,3)); draw((2,3)--(0,3)); draw((0,3)--(0,1)); draw((0,3)--(2,3)); draw((2,3)--(1,4.73)); draw((1,4.73)--(0,3)); draw(circle((0,3), 1.44)); label("$C$",(-0.4,3.14),SE*labelscalefactor); label("$A$",(2.1,3.1),SE*labelscalefactor); label("$B$",(0.86,5.18),SE*labelscalefactor); label("$D$",(-0.28,0.88),SE*labelscalefactor); label("$E$",(2.1,0.8),SE*labelscalefactor); /* dots and labels */ clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy]

Evaluate \[ \int_{\minus{}1}^1 \frac{1\plus{}2x^2\plus{}3x^4\plus{}4x^6\plus{}5x^8\plus{}6x^{10}\plus{}7x^{12}}{\sqrt{(1\plus{}x^2)(1\plus{}x^4)(1\plus{}x^6)}}dx.\]

Triangle $ABC$ has $BC=1$ and $AC=2$. What is the maximum possible value of $\hat{A}$.

Let $A_{12}$ denote the answer to problem $12$. There exists a unique triple of digits $(B,C,D)$ such that $10>A_{12}>B>C>D>0$ and \[\overline{A_{12}BCD}-\overline{DCBA_{12}}=\overline{BDA_{12}C},\] where $\overline{A_{12}BCD}$ denotes the four digit base $10$ integer. Compute $B+C+D$.

A circle is divided by $2n$ points into $2n$ equal arcs. Let $P_1, P_2, \ldots, P_{2n}$ be an arbitrary permutation of the $2n$ division points. Prove that the polygonal line $P_1 P_2 \cdots P_{2n} P_1$ contains at least two parallel segments.

You are given a set of $m$ integers, all of which give distinct remainders modulo some integer $n$. Show that for any integer $k \le m$ you can split this set into $k$ nonempty groups so that the sums of elements in these groups are distinct modulo $n$. [i]Proposed by Anton Trygub[/i]

For nonnegative real numbers $a,b,c,x,y,z$, if$a+b+c=x+y+z=1$, find the maximum value of $(a-x^2)(b-y^2)(c-z^2)$.

The positive integer-valued function $f(n)$ satisfies $f(f(n)) = 4n$ and $f(n + 1) > f(n) > 0$ for all positive integers $n$. Compute the number of possible 16-tuples $(f(1), f(2), f(3), \dots, f(16))$. [i]Proposed by Lewis Chen[/i]

Consider $n$ children in a playground, where $n\ge 2$. Every child has a coloured hat, and every pair of children is joined by a coloured ribbon. For every child, the colour of each ribbon held is different, and also different from the colour of that child’s hat. What is the minimum number of colours that needs to be used?

Let there be given a regular hexagon of side length $1$. Six circles with the sides of the hexagon as diameters are drawn. Find the area of the part of the hexagon lying outside all the circles.

Let $m,n$ be positive integers. Alice and Bob play a game on an initially blank $n\times n$ square grid $G$, alternating turns with Alice first. On a turn, the player can color a completely blank $m \times m$ subgrid of $G,$ or color in one blank cell of $G$. A player loses when they cannot do this. Find all $(m,n)$ so that with an optimal strategy, Alice wins.

Line $\frac{x}{4}+\frac{y}{3}=1$ and ellipse $\frac{x^2}{16}+\frac{y^2}{9}=1$ intersect at $A$ and $B$. A point on the ellipse $P$ satisties that the area of $\triangle PAB$ is $3$. The number of such points is $\text{(A)}1\qquad\text{(B)}2\qquad\text{(C)}3\qquad\text{(D)}4$

Let $ABC$ be an acute-angled triangle with circumcenter $O$. The circumcircle of $\triangle{BOC}$ meets the lines $AB, AC$ at points $A_1, A_2$, respectively. Let $\omega_{A}$ be the circumcircle of triangle $AA_1A_2$. Define $\omega_B$ and $\omega_C$ analogously. Prove that the circles $\omega_A, \omega_B, \omega_C$ concur on $\odot(ABC)$.

Nine tiles are numbered $1, 2, 3, \ldots, 9,$ respectively. Each of three players randomly selects and keeps three of the tile, and sums those three values. The probability that all three players obtain an odd sum is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

An equilateral triangle of altitude $1$ is considered. For every point $P$ on the interior of the triangle, denote by $x, y , z$ the distances from the point $P$ to the sides of the triangle. a) Prove that for every point $P$ inside the triangle it is true that $x + y + z = 1$. b) For which points of the triangle does it hold that the distance to one side is greater than the sum of the distances to the other two? c) We have a bar of length $1$ and we break it into three pieces. find the probability that with these pieces a triangle can be formed.

$ABC$ is a triangle and $D$ is an internal point such that $\angle DAB=\angle DBC =\angle DCA$. $O_a$ is the circumcenter of $DBC$. $O_b$ is the circumcenter of $DAC$. $O_c$ is the circumcenter of $DAB$. Show that if the area of $ABC$ and $O_aO_bO_c$ are equal then $ABC$ is equilateral.

Given a real number $\alpha$ in whose decimal representation $\alpha=0,a_1a_2a_3\dots$ each decimal digit $a_i$ $(i=1,2,3,\dots)$ is a prime number. The decimal digits are arranged along the path indicated by arrows in the accompanying figure, which can be thought of as continuing infinitely to the right and downward. For each $m\geq 1$, the decimal representation of a real number $z_m$ is formed by writing before the decimal point the digit 0 and after the decimal point the sequence of digits of the $m$-th row from the top read from left to right from the adjacent arrangement. In an analogous way, for all $n\geq 1$, the real numbers $s_n$ are formed with the digits of the $n$-th column from the left to be read from top to bottom. For example, $z_3=0,a_5a_6a_7a_{12}a_{23}a_{28}\dots$ and $s_2=0,a_2a_3a_6a_{15}a_{18}a_{35}\dots$. Show: (a) If $\alpha$ is rational, then all $z_m$ and all $s_n$ are rational. (b) The converse of the statement formulated in (a) is false.

For every integer $d \geq 1$, let $M_d$ be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference $d$, having at least two terms and consisting of positive integers. Let $A = M_1$, $B = M_2 \setminus \{2 \}, C = M_3$. Prove that every $c \in C$ may be written in a unique way as $c = ab$ with $a \in A, b \in B.$

Alan and Barbara play a game in which they take turns filling entries of an initially empty $ 2008\times 2008$ array. Alan plays first. At each turn, a player chooses a real number and places it in a vacant entry. The game ends when all entries are filled. Alan wins if the determinant of the resulting matrix is nonzero; Barbara wins if it is zero. Which player has a winning strategy?

Find all pair $(x,y)$ of positive integers satisfying $$\left|\frac{x}{y}-\sqrt2\right|<\frac{1}{y^3}.$$

Given is an obtuse isosceles triangle $ABC$ with $CA=CB$ and circumcenter $O$. The point $P$ on $AB$ is such that $AP<\frac{AB} {2}$ and $Q$ on $AB$ is such that $BQ=AP$. The circle with diameter $CQ$ meets $(ABC)$ at $E$ and the lines $CE, AB$ meet at $F$. If $N$ is the midpoint of $CP$ and $ON, AB$ meet at $D$, show that $ODCF$ is cyclic.

Prove that $$\sum\limits_{n = 1}^{\infty}\frac{1}{\sqrt{n}\left(n+1\right)} &lt; 2.$$ Proposed by Ivan Krijan, University of Zagreb