Let $a,b,c\in\mathbb{N}$ prove that if there is a polynomial $P,Q,R\in\mathbb{C}[x]$, which have no common factors and satisfy $$P^a+Q^b=R^c$$ and $$\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}>1.$$ [i](tatari/nightmare)[/i]

If $a$ and $b$ are randomly selected real numbers between $0$ and $1$, find the probability that the nearest integer to $\frac{a-b}{a+b}$ is odd.

For a positive integer $N>1$ with unique factorization $N=p_1^{\alpha_1}p_2^{\alpha_2}\dotsb p_k^{\alpha_k}$, we define \[\Omega(N)=\alpha_1+\alpha_2+\dotsb+\alpha_k.\] Let $a_1,a_2,\dotsc, a_n$ be positive integers and $p(x)=(x+a_1)(x+a_2)\dotsb (x+a_n)$ such that for all positive integers $k$, $\Omega(P(k))$ is even. Show that $n$ is an even number.

Using a ruler with a length of $20$ cm and a compass with a maximum deviation of $10$ cm to connect the segment given two points lying at a distance of $1$ m.

For a positive integer \( n \geq 2 \), does there exist positive integer solutions to the following system of equations? \[ \begin{cases} a^n - 2b^n = 1, \\ b^n - 2c^n = 1. \end{cases} \]

Let $a \geq b \geq 1 \geq c \geq 0$ be real numbers such that $a+b+c=3$. Show that $$3 \left( \frac{a}{b}+\frac{b}{a} \right ) \geq 4c^2+\frac{a^2}{b}+\frac{b^2}{a}$$

A sack contains blue and red marbles*. Consider the following game: marbles are taken out of the sack, one-by-one, until there is an equal number of blue and red marbles; once the number of blue marbles equals the number of red marbles, the game is over. In an instance of this game, it is observed that, at the end, $ 10$ marbles were taken out of the bag, and no $ 3$ consecutive marbles were all of the same color. Prove that, in said instance of the game, the fifth and sixth marbles were of different color. *The original problem involved "stones."

Let $(x_n)_{n\geq 1}$ be the sequence defined recursively as such: \[x_1=1, \ x_{n+1}=\frac{x_1}{n+1}+\frac{x_2}{n+2}+\cdots+\frac{x_n}{2n} \ \forall n\geq 1.\]Consider the sequence $(y_n)_{n\geq 1}$ such that $y_n=(x_1^2+x_2^2+\cdots x_n^2)/n$ for all $n\geq 1.$ Prove that [list=a] [*]$x_{n+1}^2<y_n/2$ and $y_{n+1}<(2n+1)/(2n+2)\cdot y_n$ for all $n\geq 1;$ [*]$\lim_{n\to\infty}x_n=0.$ [/list]

In convex quadrilateral $ABCD$, where $AB=AD$, on $BD$ point $K$ is chosen. On $KC$ point $L$ is such that $\bigtriangleup BAD \sim \bigtriangleup BKL$. Line parallel to $DL$ and passes through $K$, intersect $CD$ at $P$. Prove that $\angle APK = \angle LBC$. @below edited

Show that there is a set of $2002$ distinct positive integers such that the sum of one or more elements of the set is never a square, cube, or higher power.

$101$ blue and $101$ red points are selected on the plane, and no three lie on one straight line. The sum of the pairwise distances between the red points is $1$ (that is, the sum of the lengths of the segments with ends at red points), the sum of the pairwise distances between the blue ones is also $1$, and the sum of the lengths of the segments with the ends of different colors is $400$. Prove that you can draw a straight line separating everything red dots from all blue ones.

Find all integers $a, b$ such that $$a^2 + b = b^{2022}.$$

Solve the system $$\begin{cases} \displaystyle 4^{-x}+27^{-y}= \frac{5}{6} \\ \displaystyle 27^y-4^x \le 1 \\ \displaystyle \log_{27}y-\log_4 x \ge \frac{1}{6} \end{cases}.$$

Let $d_i$ be the first decimal digit of $2^i$ for every non-negative integer $i$. Prove that for each positive integer $n$ there exists a decimal digit other than $0$ which can be found in the sequence $d_0, d_1, \dots, d_{n-1}$ strictly less than $\frac{n}{17}$ times.

Find the number of ways to write $24$ as the sum of at least three positive integer multiples of $3$. For example, count $3 + 18 + 3$, $18 + 3 + 3$, and $3 + 6 + 3 + 9 + 3$, but not $18 + 6$ or $24$.

The perimeter of a semicircular region, measured in centimeters, is numerically equal to its area, measured in square centimeters. The radius of the semicircle, measured in centimeters, is $\text{(A)} \pi \qquad \text{(B)} \frac{2}{\pi} \qquad \text{(C)} 1 \qquad \text{(D)} \frac{1}{2} \qquad \text{(E)} \frac{4}{\pi} + 2$

Given an angle $\theta,$ consider the polynomial $$P(x) = \sin(\theta)x^2+(\cos(\theta)+\tan(\theta))x+1.$$Given that $P$ only has one real root, find all possible values of $\sin(\theta).$

Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\] Define the set $A$ by \[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\] Prove that, if $A$ is not empty, then \[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]

Find digits $a,b,c,x$ ($a>0$) such that $\overline{abc}+\overline{acb}=\overline{199x}$

Let $a_1, ...,, a_n$ be positive numbers. Prove the inequality: $$\frac{a_1}{a_2}+\frac{a_2}{a_3}+\frac{a_3}{a_4}+ ... +\frac{a_{n-1}}{a_n}+ \frac{a_n}{a_1} \ge n$$

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]

Let $ABC$ be a triangle with incenter $I$. The line $AI$ intersects $BC$ and the circumcircle of $ABC$ at the points $T$ and $S$, respectively. Let $K$ and $L$ be the incenters of $SBT$ and $SCT$, respectively, $M$ be the midpoint of $BC$ and $P$ be the reflection of $I$ with respect to $KL$. a) Prove that $M$, $T$, $K$ and $L$ are concyclic. b) Determine the measure of $\angle BPC$.

In $\triangle ABC$ points $D$ and $E$ lie on $\overline{AB}$ so that $AD < AE < AB$, while points $F$ and $G$ lie on $\overline{AC}$ so that $AF < AG < AC$. Suppose $AD = 4$, $DE = 16$, $EB = 8$, $AF = 13$, $FG = 52$, and $GC = 26$. Let $M$ be the reflection of $D$ through $F$, and let $N$ be the reflection of $G$ through $E$. The area of quadrilateral $DEGF$ is $288$. Find the area of heptagon $AFNBCEM$, as shown in the figure below. [asy] unitsize(14); pair A = (0, 9), B = (-6, 0), C = (12, 0), D = (5A + 2B)/7, E = (2A + 5B)/7, F = (5A + 2C)/7, G = (2A + 5C)/7, M = 2F - D, N = 2E - G; filldraw(A--F--N--B--C--E--M--cycle, lightgray); draw(A--B--C--cycle); draw(D--M); draw(N--G); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(M); dot(N); label("$A$", A, dir(90)); label("$B$", B, dir(225)); label("$C$", C, dir(315)); label("$D$", D, dir(135)); label("$E$", E, dir(135)); label("$F$", F, dir(45)); label("$G$", G, dir(45)); label("$M$", M, dir(45)); label("$N$", N, dir(135)); [/asy]

Define $(b_{n})$ to be: $b_{0}=12$, $b_{1}=\frac{\sqrt{3}}{2}$ adn $b_{n+1}+b_{n-1}=b_{n}\cdot\sqrt{3}$. Find $b_{0}+b_{1}+\dots+b_{2007}$. Note. Maybe this seems too easy, but I want to post all the problems...

Let $c \geq 4$ be an even integer. In some football league, each team has a home uniform and anaway uniform. Every home uniform is coloured in two different colours, and every away uniformis coloured in one colour. A team’s away uniform cannot be coloured in one of the colours fromthe home uniform. There are at most $c$ distinct colours on all of the uniforms. If two teams havethe same two colours on their home uniforms, then they have different colours on their away uniforms. We say a pair of uniforms is clashing if some colour appears on both of them. Suppose that for every team $X$ in the league, there is no team $Y$ in the league such that the home uniform of $X$ is clashing with both uniforms of $Y$. Determine the maximum possible number of teams in the league.