This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 10

2005 Vietnam National Olympiad, 1

Let $x,y$ be real numbers satisfying the condition: \[x-3\sqrt {x+1}=3\sqrt{y+2} -y\] Find the greatest value and the smallest value of: \[P=x+y\]

2012 Vietnam National Olympiad, 3

Let $ABCD$ be a cyclic quadrilateral with circumcentre $O,$ and the pair of opposite sides not parallel with each other. Let $M=AB\cap CD$ and $N=AD\cap BC.$ Denote, by $P,Q,S,T;$ the intersection of the internal angle bisectors of $\angle MAN$ and $\angle MBN;$ $\angle MBN$ and $\angle MCN;$ $\angle MDN$ and $\angle MAN;$ $\angle MCN$ and $\angle MDN.$ Suppose that the four points $P,Q,S,T$ are distinct. (a) Show that the four points $P,Q,S,T$ are concyclic. Find the centre of this circle, and denote it as $I.$ (b) Let $E=AC\cap BD.$ Prove that $E,O,I$ are collinear.

2020 Vietnam Team Selection Test, 6

In the scalene acute triangle $ABC$, $O$ is the circumcenter. $AD, BE, CF$ are three altitudes. And $H$ is the orthocenter. Let $G$ be the reflection point of $O$ through $BC$. Draw the diameter $EK$ in $\odot (GHE)$, and the diameter $FL$ in $\odot (GHF)$. a) If $AK, AL$ and $DE, DF$ intersect at $U, V$ respectively, prove that $UV\parallel EF$. b) Suppose $S$ is the intersection of the two tangents of the circumscribed circle of $\triangle ABC$ at $B$ and $C$. $T$ is the intersection of $DS$ and $HG$. And $M,N$ are the projection of $H$ on $TE,TF$ respectively. Prove that $M,N,E,F$ are concyclic.

2020 Vietnam Team Selection Test, 5

Tags: Vietnam , TST , ord
Find all positive integers $k$, so that there are only finitely many positive odd numbers $n$ satisfying $n~|~k^n+1$.

2014 Contests, 1

Let $({{x}_{n}}),({{y}_{n}})$ be two positive sequences defined by ${{x}_{1}}=1,{{y}_{1}}=\sqrt{3}$ and \[ \begin{cases} {{x}_{n+1}}{{y}_{n+1}}-{{x}_{n}}=0 \\ x_{n+1}^{2}+{{y}_{n}}=2 \end{cases} \] for all $n=1,2,3,\ldots$. Prove that they are converges and find their limits.

2017 Vietnam Team Selection Test, 1

Tags: geometry , Vietnam , TST
Triangle $ABC$ is inscribed in circle $(O)$. $A$ varies on $(O)$ such that $AB>BC$. $M$ is the midpoint of $AC$. The circle with diameter $BM$ intersects $(O)$ at $R$. $RM$ intersects $(O)$ at $Q$ and intersects $BC$ at $P$. The circle with diameter $BP$ intersects $AB, BO$ at $K,S$ in this order. a. Prove that $SR$ passes through the midpoint of $KP$. b. Let $N$ be the midpoint of $BC$. The radical axis of circles with diameters $AN, BM$ intersects $SR$ at $E$. Prove that $ME$ always passes through a fixed point.

2020 Vietnam Team Selection Test, 4

Let $n$ be a positive integer. In a $(2n+1)\times (2n+1)$ board, each grid is dyed white or black. In each row and each column, if the number of white grids is smaller than the number of black grids, then we mark all white grids. If the number of white grids is bigger than the number of black grids, then we mark all black grids. Let $a$ be the number of black grids, and $b$ be the number of white grids, $c$ is the number of marked grids. In this example of $3\times 3$ table, $a=3$, $b=6$, $c=4$. (forget about my watermark) Proof that no matter how is the dyeing situation in the beginning, there is always $c\geq\frac{1}{2}\min\{a,b\}$.

2008 Vietnam National Olympiad, 6

Let $ x, y, z$ be distinct non-negative real numbers. Prove that \[ \frac{1}{(x\minus{}y)^2} \plus{} \frac{1}{(y\minus{}z)^2} \plus{} \frac{1}{(z\minus{}x)^2} \geq \frac{4}{xy \plus{} yz \plus{} zx}.\] When does the equality hold?

2014 Vietnam National Olympiad, 1

Let $({{x}_{n}}),({{y}_{n}})$ be two positive sequences defined by ${{x}_{1}}=1,{{y}_{1}}=\sqrt{3}$ and \[ \begin{cases} {{x}_{n+1}}{{y}_{n+1}}-{{x}_{n}}=0 \\ x_{n+1}^{2}+{{y}_{n}}=2 \end{cases} \] for all $n=1,2,3,\ldots$. Prove that they are converges and find their limits.

2020 Vietnam Team Selection Test, 3

Suppose $n$ is a positive integer, $4n$ teams participate in a football tournament. In each round of the game, we will divide the $4n$ teams into $2n$ pairs, and each pairs play the game at the same time. After the tournament, it is known that every two teams have played at most one game. Find the smallest positive integer $a$, so that we can arrange a schedule satisfying the above conditions, and if we take one more round, there is always a pair of teams who have played in the game.