Each diagonal of a quadrangle divides it into two isosceles triangles. Is it true that the quadrangle is a diamond?

Circle $\omega$ has radius $5$ and is centered at $O$. Point $A$ lies outside $\omega$ such that $OA=13$. The two tangents to $\omega$ passing through $A$ are drawn, and points $B$ and $C$ are chosen on them (one on each tangent), such that line $BC$ is tangent to $\omega$ and $\omega$ lies outside triangle $ABC$. Compute $AB+AC$ given that $BC=7$.

Find all polynomials $ P (x) $ with real coefficients that satisfy the identity $ P (x ^ 2) = P (x) P (x + 1) $.

How many different sets of three points in this equilateral triangular grid are the vertices of an equilateral triangle? Justify your answer. [center][img]http://i.imgur.com/S6RXkYY.png[/img][/center]

$a,b,c$ are non-negative integers. Solve: $a!+5^b=7^c$ [i]Proposed by Serbia[/i]

Suppose each element $i\in S=\{1,2,\ldots,n\}$ is assigned a nonempty set $S_i\subseteq S$ so that the following conditions are fulfilled: (i) for any $i,j\in S$, if $j\in S_i$ then $i\in S_j$; (ii) for any $i,j\in S$, if $|S_i|=|S_j|$ then $S_i\cap S_j=\emptyset$. Prove that there exists $k\in S$ for which $|S_k|=1$.

Let $a$, $b$ and $c$ be real numbers larger than $1$. Prove the inequality $$\frac{ab}{c-1}+\frac{bc}{a - 1}+\frac{ca}{b -1} \ge 12.$$ When does equality hold? [i](Karl Czakler)[/i]

It is intended to make a map locating $30$ different cities on it. For this, all the distances between these cities are available as data (each of these distances is considered as a “data”). Three of these cities are already laid out on the map, and they turn out to be non-collinear. How much data must be used as a minimum to complete the map?

Let $n\ge3$ be an integer. Prove that there is a set of $n$ points in the plane such that the distance between any two points is irrational and each set of three points determines a non-degenerate triangle with rational area.

In an acute angle $ \vartriangle ABC $, let $ AD, BE, CF $ be their altitudes (with $ D, E, F $ lying on $ BC, CA, AB $, respectively). Let's call $ O, H $ the circumcenter and orthocenter of $ \vartriangle ABC $, respectively. Let $ P = CF \cap AO $. Suppose the following two conditions are true: $\bullet$ $ FP = EH $ $\bullet$ There is a circle that passes through points $ A, O, H, C $ Prove that the $ \vartriangle ABC $ is equilateral.

Let be a natural number $ n\ge 2. $ Find the real numbers $ a $ that satisfy the equation $$ \lfloor nx \rfloor =\sum_{k=1}^{n} \lfloor x+(k-1)a \rfloor , $$ for any real numbers $ x. $ [i]Marius Perianu[/i]

Write the number $2004_{(5)}$ [ $2004$ base $5$ ] as a number in base $6$.

Estimate the number of positive integers less than or equal to $1,000,000$ that can be expressed as the sum of two nonnegative integer squares. Your estimate must be an integer, or you will receive a zero.

Evaluate $\int_0^{\frac{\pi}{4}} \frac{1}{1-\sin x}\sqrt{\frac{\cos x}{1+\cos x+\sin x}}dx.$ Own

Let $a$ and $b$ be parallel lines with $50$ distinct points marked on $a$ and $50$ distinct points marked on $b$. Find the greatest possible number of acute-angled triangles all of whose vertices are marked.

Determine for which values of $n$ it is possible to tile a square of side $n$ with figures of the type shown in the picture [asy] unitsize(0.4 cm); draw((0,0)--(5,0)); draw((0,1)--(5,1)); draw((1,2)--(4,2)); draw((2,3)--(3,3)); draw((0,0)--(0,1)); draw((1,0)--(1,2)); draw((2,0)--(2,3)); draw((3,0)--(3,3)); draw((4,0)--(4,2)); draw((5,0)--(5,1)); [/asy]

Solve the diophantine equation \[x^{2008}- y^{2008} = 2^{2009}.\]

Lavidópolis is a city with 2024 neighborhoods. Lavi Dopes was elected mayor, and since he saw that there were no roads in the city, he asked Gil Bento, the monster engineer, to design the city's roads according to the following rules: 1. Any two neighborhoods are connected by at most one two-way road; 2. For any two neighborhoods, there is exactly one route from one neighborhood to another, which may pass through some intermediate neighborhoods, but never passes through the same neighborhood more than once. Mayor Lavi Dopes wants to try for re-election, but since he knows nothing about the city and only shows up during campaign times (he spent all this time stealing... I mean, thinking about math problems), he wants to find a pair of neighborhoods such that the number of roads that are part of the route connecting them is maximized among all pairs of neighborhoods. To do this, he starts asking Gil Bento various questions, all in the following manner: he chooses two of the 2024 neighborhoods, say A and B, and asks: "Given neighborhoods A and B, how many roads are part of the route connecting A to B?" Knowing that Gil Bento always answers correctly to each question, determine the minimum number of questions that Lavi Dopes needs to ask to achieve his goal, regardless of how Gil Bento has designed the roads of Lavidópolis.

Let $f^{(n)}(x)$ denote the $n^{\text{th}}$ iterate of function $f$, i.e $f^{(1)}(x)=f(x)$, $f^{(n+1)}(x)=f(f^{(n)}(x))$. Let $p(n)$ be a given polynomial with integer coefficients, which maps the positive integers into the positive integers. Is it possible that the functional equation $f^{(n)}(n)=p(n)$ has exactly one solution $f$ that maps the positive integers into the positive integers? [i]Submitted by Dávid Matolcsi and Kristóf Szabó, Budapest[/i]

There is a $2021 \times 2023$ board that has a white piece in the central square, on which Mich and Moka are going to play in turns. First Mich places a green token on any free space so that it is not in the same row or column as the white token, then Moka places a red token on any free space so that it is not in the same row or column as the white token. white or green. From now on, Mich will place green tokens and Moka will place red tokens alternately according to the following rules: $\bullet$ For the placed piece there must be another piece of the same color in its row or column, such that there is no other piece between both pieces. $\bullet$ If there is at least one box that meets the previous rule, then it is mandatory to place a token. When a token is placed, it changes all the tokens that are on squares adjacent to it to the same color. The game ends when one of the players can no longer place tiles. If when the game ends the board has more green tiles then Mich wins, and if it has more red tiles then Moka wins. Determine if either player has a winning strategy.

Let $a$ and $b$ be positive real numbers such that $3(a^2+b^2-1) = 4(a+b$). Find the minimum value of the expression $\frac{16}{a}+\frac{1}{b}$ .

A function $f$ with its domain on the positive integers $N =\{1, 2, ...\}$ satisfies the following conditions: (a) $f(1) = 2017$. (b) $\sum_{i=1}^n f(i) = n^2f(n)$, for every positive integer $n > 1$. What is the value of $f(2017)$?

Find the minimum value of $$K(x,y)=16\frac{x^3}{y}+\frac{y^3}{x}-\sqrt{xy}$$ where $x,y$ are the real allowed values

Let $W$ be a regular octahedron and $O$ be its center. In a plane $P$ containing $O$ circles $k_1(O,r_1)$ and $k_2(O,r_2)$ are chosen so that $k_1 \subset P\cap W \subset k_2$. Prove that $\frac{r_1}{r_2}\le \frac{\sqrt3}{2}$

Let $ABC$ be a triangle with circumcircle $\Gamma$ and $AB\neq AC$. Let $D$ and $E$ lie on the arc $BC$ of $\Gamma$ not containing $A$ such that $\angle BAE=\angle DAC$. Let the incenters of $BAE$ and $CAD$ be $X$ and $Y$, respectively, and let the external tangents of the incircles of $BAE$ and $CAD$ intersect at $Z$. Prove that $Z$ lies on the common chord of $\Gamma$ and the circumcircle of $AXY$.