Let $ABC$ be a triangle. The tangent in $A$ of the circumcircle of $ABC$ cuts the line $(BC)$ in $X$. Let $A'$ be the symetric of $A$ by $X$ and $C'$ the symetric of $C$ by the line $(AX)$ Prove that the points $A, C', A'$ and $B$ are concyclic.

Find all triples of positive integers $a, b, c$ such that they are pairwise relatively prime and $a^2+3b^2c^2=7^c$.

A plane dividing like a chessboard and write a real number each square such that, for a squares' number equal to its up, down ,left and right squares' numbers arithmetic mean. Prove that all number are equal.

Annie has a permutation $(a_1, a_2, \dots ,a_{2019})$ of $S=\{1,2,\dots,2019\}$, and Yannick wants to guess her permutation. With each guess Yannick gives Annie an $n$-tuple $(y_1, y_2, \dots, y_{2019})$ of integers in $S$, and then Annie gives the number of indices $i\in S$ such that $a_i=y_i$. (a) Show that Yannick can always guess Annie's permutation with at most $1200000$ guesses. (b) Show that Yannick can always guess Annie's permutation with at most $24000$ guesses. [i]Yannick Yao[/i]

The problems are really difficult to find online, so here are the problems. P1. It is known that two positive integers $m$ and $n$ satisfy $10n - 9m = 7$ dan $m \leq 2018$. The number $k = 20 - \frac{18m}{n}$ is a fraction in its simplest form. a) Determine the smallest possible value of $k$. b) If the denominator of the smallest value of $k$ is (equal to some number) $N$, determine all positive factors of $N$. c) On taking one factor out of all the mentioned positive factors of $N$ above (specifically in problem b), determine the probability of taking a factor who is a multiple of 4. I added this because my translation is a bit weird. [hide=Indonesian Version] Diketahui dua bilangan bulat positif $m$ dan $n$ dengan $10n - 9m = 7$ dan $m \leq 2018$. Bilangan $k = 20 - \frac{18m}{n}$ merupakan suatu pecahan sederhana. a) Tentukan bilangan $k$ terkecil yang mungkin. b) Jika penyebut bilangan $k$ terkecil tersebut adalah $N$, tentukan semua faktor positif dari $N$. c) Pada pengambilan satu faktor dari faktor-faktor positif $N$ di atas, tentukan peluang terambilnya satu faktor kelipatan 4.[/hide] P2. Let the functions $f, g : \mathbb{R} \to \mathbb{R}$ be given in the following graphs. [hide=Graph Construction Notes]I do not know asymptote, can you please help me draw the graphs? Here are its complete description: For both graphs, draw only the X and Y-axes, do not draw grids. Denote each axis with $X$ or $Y$ depending on which line you are referring to, and on their intercepts, draw a small node (a circle) then mark their $X$ or $Y$ coordinates only (since their other coordinates are definitely 0). Graph (1) is the function $f$, who is a quadratic function with -2 and 4 as its $X$-intercepts and 4 as its $Y$-intercept. You also put $f$ right besides the curve you have, preferably just on the right-up direction of said curve. Graph (2) is the function $g$, which is piecewise. For $x \geq 0$, $g(x) = \frac{1}{2}x - 2$, whereas for $x < 0$, $g(x) = - x - 2$. You also put $g$ right besides the curve you have, on the lower right of the line, on approximately $x = 2$.[/hide] Define the function $g \circ f$ with $(g \circ f)(x) = g(f(x))$ for all $x \in D_f$ where $D_f$ is the domain of $f$. a) Draw the graph of the function $g \circ f$. b) Determine all values of $x$ so that $-\frac{1}{2} \leq (g \circ f)(x) \leq 6$. P3. The quadrilateral $ABCD$ has side lengths $AB = BC = 4\sqrt{3}$ cm and $CD = DA = 4$ cm. All four of its vertices lie on a circle. Calculate the area of quadrilateral $ABCD$. P4. There exists positive integers $x$ and $y$, with $x < 100$ and $y > 9$. It is known that $y = \frac{p}{777} x$, where $p$ is a 3-digit number whose number in its tens place is 5. Determine the number/quantity of all possible values of $y$. P5. The 8-digit number $\overline{abcdefgh}$ (the original problem does not have an overline, which I fixed) is arranged from the set $\{1, 2, 3, 4, 5, 6, 7, 8\}$. Such number satisfies $a + c + e + g \geq b + d + f + h$. Determine the quantity of different possible (such) numbers.

From an unlimited supply of 1-cent coins, 10-cent coins, and 25-cent coins, Silas wants to find a collection of coins that has a total value of $N$ cents, where $N$ is a positive integer. He uses the so-called greedy algorithm, successively choosing the coin of greatest value that does not cause the value of his collection to exceed $N.$ For example, to get 42 cents, Silas will choose a 25-cent coin, then a 10-cent coin, then 7 1-cent coins. However, this collection of 9 coins uses more coins than necessary to get a total of 42 cents; indeed, choosing 4 10-cent coins and 2 1-cent coins achieves the same total value with only 6 coins. In general, the greedy algorithm succeeds for a given $N$ if no other collection of 1-cent, 10-cent, and 25-cent coins gives a total value of $N$ cents using strictly fewer coins than the collection given by the greedy algorithm. Find the number of values of $N$ between $1$ and $1000$ inclusive for which the greedy algorithm succeeds.

Given two circles $\omega_1$ and $\omega_2$, with centers $O_1$ and $O_2$, respectively intesrecting at two points $A$ and $B$. Let $X$ and $Y$ be points on $\omega_1$. The lines $XA$ and $YA$ intersect $\omega_2$ again in $Z$ and $W$, respectively, such that $A$ is between $X,Z$ and $A$ is between $Y,W$. Let $M$ be the midpoint of $O_1O_2$, S be the midpoint of $XA$ and $T$ be the midpoint of $WA$. Prove that $MS = MT$ if, and only if, the points $X, Y, Z$ and $W$ are concyclic.

Prove that there exist infinitely many integers $n$ such that $n, n + 1, n + 2$ are each the sum of two squares of integers.

Given a triangle $ABC$, the line parallel to the side $BC$ and tangent to the incircle of the triangle meets the sides $AB$ and $AC$ at the points $A_1$ and $A_2$ , the points $B_1, B_2$ and $C_1, C_2$ are dened similarly. Show that $$AA_1 \cdot AA_2 + BB_1 \cdot BB_2 + CC_1 \cdot CC_2 \ge \frac19 (AB^2 + BC^2 + CA^2)$$

Ten mutually distinct non-zero reals are given such that for any two, either their sum or their product is rational. Prove that squares of all these numbers are rational.

Show that $n$ is prime iff $\lim_{r \rightarrow\infty}\,\lim_{s \rightarrow\infty}\,\lim_{t \rightarrow \infty}\,\sum_{u=0}^{s}\left(1-\left(\cos\,\frac{(u!)^{r} \pi}{n} \right)^{2t} \right)=n$ PS : I posted it because it's in the PDF file but not here ...

Aileen plays badminton where she and her opponent stand on opposite sides of a net and attempt to bat a birdie back and forth over the net. A player wins a point if their opponent fails to bat the birdie over the net. When Aileen is the server (the first player to try to hit the birdie over the net), she wins a point with probability $\frac{9}{10}$ . Each time Aileen successfully bats the birdie over the net, her opponent, independent of all previous hits, returns the birdie with probability $\frac{3}{4}$ . Each time Aileen bats the birdie, independent of all previous hits, she returns the birdie with probability $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

(a) Determine a natural number $n$ such that $n(n+2022)+2$ is a perfect square. [hide=Spoiler]In case you didn't realize, $n=1$ works lol[/hide] (b) Determine all natural numbers $a$ such that for every natural number $n$, the number $n(n+a)+2$ is never a perfect square.

In each cell of a matrix $ n\times n$ a number from a set $ \{1,2,\ldots,n^2\}$ is written --- in the first row numbers $ 1,2,\ldots,n$, in the second $ n\plus{}1,n\plus{}2,\ldots,2n$ and so on. Exactly $ n$ of them have been chosen, no two from the same row or the same column. Let us denote by $ a_i$ a number chosen from row number $ i$. Show that: \[ \frac{1^2}{a_1}\plus{}\frac{2^2}{a_2}\plus{}\ldots \plus{}\frac{n^2}{a_n}\geq \frac{n\plus{}2}{2}\minus{}\frac{1}{n^2\plus{}1}\]

let $n>2$ be a fixed integer.positive reals $a_i\le 1$(for all $1\le i\le n$).for all $k=1,2,...,n$,let $A_k=\frac{\sum_{i=1}^{k}a_i}{k}$ prove that $|\sum_{k=1}^{n}a_k-\sum_{k=1}^{n}A_k|<\frac{n-1}{2}$.

Alice, Beth, Carla, Dana, and Eden play a game in which each of them simultaneously closes her eyes and randomly chooses two of the others to point at (one with each hand). A participant loses if she points at someone who points back at her; otherwise, she wins. Find the probability that all five girls win.

Show that for any three numbers $ a,b,c\in (1,\infty ) , $ the following inequality is true: $$ \log_{ab} c +\log_{bc} a +\log_{ca} b\ge log_{a^2bc} bc +log_{b^2ca} ca +log_{c^2ab} ab$$ [i]Costel Anghel[/i]