Find all triples $(p, q, r)$ of prime numbers for which $4q - 1$ is a prime number and $$\frac{p + q}{p + r} = r - p$$ holds. [i](Walther Janous)[/i]

The two sides of the triangle are $10$ and $15$. Prove that the length of the bisector of the angle between them is less than $12$.

We have $p$ players participating in a tournament, each player playing against every other player exactly once. A point is scored for each victory, and there are no draws. A sequence of nonnegative integers $s_1 \le s_2 \le s_3 \le\cdots\le s_p$ is given. Show that it is possible for this sequence to be a set of final scores of the players in the tournament if and only if \[(i)\displaystyle\sum_{i=1}^{p} s_i =\frac{1}{2}p(p-1)\] \[\text{and}\] \[(ii)\text{ for all }k < p,\displaystyle\sum_{i=1}^{k} s_i \ge \frac{1}{2} k(k - 1).\]

How many 3-term geometric sequences $a$, $b$, $c$ are there where $a$, $b$, and $c$ are positive integers with $a < b < c$ and $c = 8000$?

Two players play the following game on a square of $N \times N$ squares. They color one square in turn so that no two colored squares are on the same diagonal. A player who cannot make a move loses. For what values of $N$ does the first player have a winning strategy?

The line touching the incircle of triangle $ABC$ and parallel to $BC$ meets the external bisector of angle $A$ at point $X$. Let $Y$ be the midpoint of arc $BAC$ of the circumcircle. Prove that the angle $XIY$ is right.

Is it possible that the heights of a tetrahedron (that is, a triangular pyramid) would be equal to the numbers $1$, $2$, $3$ and $6$?

Each real number greater than 1 is colored red or blue with both colors being used. Prove that there exist real numbers $a$ and $b$ such that the numbers $a+\frac1b$ and $b+\frac1a$ are different colors.

Let $f \colon [0,1] \to \mathbb{R} $ be a differentiable function such that its derivative is an integrable function on $[0,1]$, and $f(1)=0$. Prove that \[ \int_0^1 (xf'(x))^2 dx \geq 12 \cdot \left( \int_0^1 xf(x) dx\right)^2 \]

An infinite geometric sequence $a_1,a_2,a_3,\dots$ satisfies $a_1=1$ and \[\dfrac{1}{a_1a_2}+\dfrac{1}{a_2a_3}+\dfrac{1}{a_3a_4}\cdots=\dfrac{1}{2}.\] The sum of all possible values of $a_2$ can be expressed as $m+\sqrt{n}$, where $m$ and $n$ are integers and $n$ is not a positive perfect square. Find $100m+n$. [i]Individual #7[/i]

Which family of elements has solid, liquid, and gaseous members at $25^{\circ} \text{C}$ and $1 \text{atm}$ pressure? $ \textbf{(A)}\hspace{.05in}\text{alkali metals (Li-Cs)} \qquad\textbf{(B)}\hspace{.05in}\text{pnictogens (N-Bi)} \qquad$ $\textbf{(C)}\hspace{.05in}\text{chalcogens (O-Te)} \qquad\textbf{(D)}\hspace{.05in}\text{halogens (F-I)}\qquad$

Points $A,B,C,D$ have been marked on checkered paper (see fig.). Find the tangent of the angle $ABD$. [img]https://cdn.artofproblemsolving.com/attachments/6/1/eeb98ccdee801361f9f66b8f6b2da4714e659f.png[/img]

Let $ABC$ be a triangle, and let $D$ and $D_1$ be points on segment $BC$ such that $BD = CD_1$. Construct point $E$ such that $EC\perp BC$ and $ED\perp AC$. Similarly, construct point $F$ such that $FB\perp BC$ and $FD\perp AB$. Prove that $EF\perp AD_1$.

Find all positive integers $n$ that have exactly $16$ positive integral divisors $d_{1},d_{2} \cdots, d_{16}$ such that $1=d_{1}<d_{2}<\cdots<d_{16}=n$, $d_6=18$, and $d_{9}-d_{8}=17$.

In Mexico City, in order to limit traffic flow, for each private car is given one day a week on which it cannot go on the city streets. A wealthy family of 10 bribed the police, and for each car they are given 2 days, one of which the police chooses as a ''no travel'' day. What is the smallest number of cars a family needs to buy so that each family member can drive independently every day, if the approval of “no travel” days for cars occurs sequentially? [hide=original wording]В городе Мехико в целях ограничения транспортного потока для каждой частной автомашины устанавливаются один деньв неделю, в который она не может выезжать на улицы города. Состоятельная семья из 10 человек подкупила полицию, и для каждой машины они называют 2 дня, один из которых полиция выбирает в качестве ''невыездного'' дня. Какое наименьшее количество машин нужно купить семье, чтобы каждый день каждый член семьи мог самостоятельно ездить, если утверждение ''невыездных'' дней для автомобилей идет последовательно?[/hide]

A sequence $a_n$ is determined by the rules $a_0 = 9$ and for any nonnegative $k$, $$a_{k+1}=3a_k^4+4a_k^3.$$ Prove that $a_{10}$ contains more than $1000$ nines in decimal notation. (Yao)

The [i]runcible[/i] positive integers are defined recursively as follows: [list] [*]$1$ and $2$ are runcible [*]If $a$ and $b$ are runcible (where $a$ and $b$ are not necessarily distinct) then $2a + 3b$ is runcible. [/list] Is $2024$ runcible?

In $\triangle ABC$, point $D$ lies on side $AC$ such that $\angle ABD=\angle C$. Point $E$ lies on side $AB$ such that $BE=DE$. $M$ is the midpoint of segment $CD$. Point $H$ is the foot of the perpendicular from $A$ to $DE$. Given $AH=2-\sqrt{3}$ and $AB=1$, find the size of $\angle AME$.

A set S consisting of $2019$ (different) positive integers has the following property: [i]the product of every 100 elements of $S$ is a divisor of the product of the remaining $1919$ elements[/i]. What is the maximum number of prime numbers that $S$ can contain?

A quadruple $(a; b; c; d)$ of positive integers with $a \leq b \leq c \leq d$ is called good if we can colour each integer red, blue, green or purple, in such a way that $i$ of each $a$ consecutive integers at least one is coloured red; $ii$ of each $b$ consecutive integers at least one is coloured blue; $iii$ of each $c$ consecutive integers at least one is coloured green; $iiii$ of each $d$ consecutive integers at least one is coloured purple. Determine all good quadruples with $a = 2.$

Define the numbers $a_0, a_1, \ldots, a_n$ in the following way: \[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \] Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]

It is well-known that the $n^{\text{th}}$ triangular number can be given by the formula $n(n+1)/2$. A Pythagorean triple of $\textit{square numbers}$ is an ordered triple $(a,b,c)$ such that $a^2+b^2=c^2$. Let a Pythagorean triple of $\textit{triangular numbers}$ (a PTTN) be an ordered triple of positive integers $(a,b,c)$ such that $a\leq b<c$ and \[\dfrac{a(a+1)}2+\dfrac{b(b+1)}2=\dfrac{c(c+1)}2.\] For instance, $(3,5,6)$ is a PTTN ($6+15=21$). Here we call both $a$ and $b$ $\textit{legs}$ of the PTTN. Find the smallest natural number $n$ such that $n$ is a leg of $\textit{at least}$ six distinct PTTNs.

Find all functions $f:\mathbb{R}^+ \rightarrow \mathbb{R}^+$, such that $$f(x^{2023}+f(x)f(y))=x^{2023}+yf(x)$$ for all $x, y>0$.

A quadrilateral is called bicentric if it has both an incircle and a circumcircle. $ABCD$ is a bicentric quadrilateral with $(O)$ being its circumcircle. Let $E, F$ be the intersections of $AB$ and $CD, AD$ and $BC$ respectively. Prove that there is a circle with center $O$ tangent to all of the circumcircles of the four triangles $EAD, EBC, FAB, FCD$. Nguyen Van Linh, a student of the Vietnamese College, Ha Noi

In triangle $ABC,$ we have $\angle A \leq 90^\circ$ and $\angle B = 2 \angle C.$ The interior bisector of the angle $C$ meets the median $AM$ in $D.$ Prove that $\angle MDC \leq 45^\circ.$ When does equality hold? [asy] import graph; size(200); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; pen qqqqzz = rgb(0,0,0.6); pen ffqqtt = rgb(1,0,0.2); pen qqwuqq = rgb(0,0.39,0); draw((3.14,5.81)--(3.23,0.74),ffqqtt+linewidth(2pt)); draw((3.23,0.74)--(9.73,1.32),ffqqtt+linewidth(2pt)); draw((9.73,1.32)--(3.14,5.81),ffqqtt+linewidth(2pt)); draw((9.73,1.32)--(3.19,2.88)); draw((3.14,5.81)--(6.71,1.05)); pair parametricplot0_cus(real t){ return (0.7*cos(t)+5.8,0.7*sin(t)+2.26); } draw(graph(parametricplot0_cus,-0.9270442638657642,-0.23350086562377703)--(5.8,2.26)--cycle,qqwuqq); dot((3.14,5.81),ds); label("$A$", (2.93,6.09),NE*lsf); dot((3.23,0.74),ds); label("$B$", (2.88,0.34),NE*lsf); dot((9.73,1.32),ds); label("$C$", (10.11,1.04),NE*lsf); dot((3.19,2.88),ds); label("$X$", (2.77,2.94),NE*lsf); dot((6.71,1.05),ds); label("$M$", (6.75,0.5),NE*lsf); dot((5.8,2.26),ds); label("$D$", (5.89,2.4),NE*lsf); label("$\alpha$", (6.52,1.65),NE*lsf); clip((-3.26,-11.86)--(-3.26,8.36)--(20.76,8.36)--(20.76,-11.86)--cycle); [/asy]