$A$ is a point lying outside a circle $(O)$. The tangents from $A$ drawn to $(O)$ meet the circle at $B,C.$ Let $P,Q$ be points on the rays $AB, AC$ respectively such that $PQ$ is tangent to $(O).$ The parallel lines drawn through $P,Q$ parallel to $CA, BA,$ respectively meet $BC$ at $E,F,$ respectively. $(a)$ Show that the straight lines $EQ$ always pass through a fixed point $M,$ and $FP$ always pass through a fixed point $N.$ $(b)$ Show that $PM\cdot QN$ is constant.

Let $ABC$ be an acute-angled triangle with $\angle BAC = 60^{\circ}$ and with incenter $I$ and circumcenter $O$. Let $H$ be the point diametrically opposite(antipode) to $O$ in the circumcircle of $\triangle BOC$. Prove that $IH=BI+IC$.

What is the largest amount of complex $ z $ solutions a system can have? $ | z-1 || z + 1 | = 1 $ $ Im (z) = b? $ (where $ b $ is a real constant)

Let be a point $ P $ inside a triangle $ ABC. $ Prove that the following relations are equivalent: $ \text{(i)} $ Any collinear triple of points $ (E,P,F) $ with $ E,F $ on $ AB,AC, $ respectively, verifies the equality $$ \frac{1}{AE} +\frac{1}{AF} =\frac{AB+BC+CA}{AB\cdot AC} $$ $ \text{(ii)} P $ is the incircle of $ ABC $

Victor has four types of coins: gold, silver, bronze, and copper. All coins of the same type have the same weight, which is an integer number of grams. Victor performs two weighings: - He takes 6 gold coins, 13 silver coins, 3 bronze coins, and 7 copper coins, and the total weight on the scale is 162 grams. - He takes 15 gold coins, 5 silver coins, and 11 bronze coins, and the total weight on the scale is 110 grams. Determine the weight of each type of coin.

Find the value of $ a$ for which the area of the figure surrounded by $ y \equal{} e^{ \minus{} x}$ and $ y \equal{} ax \plus{} 3\ (a < 0)$ is minimized.

Is there a function $f$ from the positive integers to themselves such that $$f(a)f(b) \geq f(ab)f(1)$$ with equality [b]if and only if[/b] $(a-1)(b-1)(a-b)=0$?

Compute the sum of the squares of the first $100$ terms of an arithmetic progression, given that their sum is $-1$ and that the sum of those among them having an even index is $1$.

The number of real solutions to the equation \[ \frac{x}{100} = \sin x \] is $\text{(A)} \ 61 \qquad \text{(B)} \ 62 \qquad \text{(C)} \ 63 \qquad \text{(D)} \ 64 \qquad \text{(E)} \ 65$

Find the smallest natural number $n$ that the following statement holds : Let $A$ be a finite subset of $\mathbb R^{2}$. For each $n$ points in $A$ there are two lines including these $n$ points. All of the points lie on two lines.

Let $n \geq 2$ be a positive integer. A total of $2n$ balls are coloured with $n$ colours so that there are two balls of each colour. These balls are put inside $n$ cylindrical boxes with two balls in each box, one on top of the other. Phoe Wa Lone has an empty cylindrical box and his goal is to sort the balls so that balls of the same colour are grouped together in each box. In a [i]move[/i], Phoe Wa Lone can do one of the following: [list] [*]Select a box containing exactly two balls and reverse the order of the top and the bottom balls. [*]Take a ball $b$ at the top of a non-empty box and either put it in an empty box, or put it in the box only containing the ball of the same colour as $b$. [/list] Find the smallest positive integer $N$ such that for any initial placement of the balls, Phoe Wa Lone can always achieve his goal using at most $N$ moves in total.

Does there exists a base in which the numbers of the form: \[ 10101, 101010101, 1010101010101,\cdots \] are all prime numbers?

Let points $A, B$ and $C$ lie on the parabola $\Delta$ such that the point $H$, orthocenter of triangle $ABC$, coincides with the focus of parabola $\Delta$. Prove that by changing the position of points $A, B$ and $C$ on $\Delta$ so that the orthocenter remain at $H$, inradius of triangle $ABC$ remains unchanged. [i]Proposed by Mahdi Etesamifard[/i]

The trapezium ${ABCD}$, where ${AB}$ and ${CD}$ are parallel and ${AD < CD}$, is inscribed in the circle ${c}$. Let ${DP}$ be a chord of the circle, parallel to ${AC}$. Assume that the tangent to ${c}$ at ${D}$ meets the line ${AB}$ at ${E}$ and that ${PB}$ and ${DC}$ meet at ${Q}$. Show that ${EQ = AC}$.

Suppose $ \cos x \equal{} 0$ and $ \cos (x \plus{} z) \equal{} 1/2$. What is the smallest possible positive value of $ z$? $ \textbf{(A) } \frac {\pi}{6}\qquad \textbf{(B) } \frac {\pi}{3}\qquad \textbf{(C) } \frac {\pi}{2}\qquad \textbf{(D) } \frac {5\pi}{6}\qquad \textbf{(E) } \frac {7\pi}{6}$

Centuries ago, the pirate Captain Blackboard buried a vast amount of treasure in a single cell of a $2 \times 4$ grid-structured island. Treasure was buried in a single cell of an $M\times N$ ($2\le M$, $N$) grid. You and your crew have reached the island and have brought special treasure detectors to find the cell with the treasure For each detector, you can set it up to scan a specific subgrid $[a,b]\times[c,d]$ with $1\le a\le b\le 2$ and $1\le c\le d\le 4$. Running the detector will tell you whether the treasure is in the region or not, though it cannot say where in the region the treasure was detected. You plan on setting up $Q$ detectors, which may only be run simultaneously after all $Q$ detectors are ready. What is the minimum $Q$ required to gaurantee to determine the location of the Blackboard’s legendary treasure?

The set $N$ has been partitioned into two sets A and $B$. Show that for every $n \in N$ there exist distinct integers $a, b > n$ such that $a, b, a + b$ either all belong to $A$ or all belong to $B$.

Assume that $C$ is a convex subset of $\mathbb R^{d}$. Suppose that $C_{1},C_{2},\dots,C_{n}$ are translations of $C$ that $C_{i}\cap C\neq\emptyset$ but $C_{i}\cap C_{j}=\emptyset$. Prove that \[n\leq 3^{d}-1\] Prove that $3^{d}-1$ is the best bound. P.S. In the exam problem was given for $n=3$.

[b]p1.[/b] A function $f$ defined on the set of positive numbers satisfies the equality $$f(xy) = f(x) + f(y), x, y > 0.$$ Find $f(2007)$ if $f\left( \frac{1}{2007} \right) = 1$. [b]p2.[/b] The plane is painted in two colors. Show that there is an isosceles right triangle with all vertices of the same color. [b]p3.[/b] Show that the number of ways to cut a $2n \times 2n$ square into $1\times 2$ dominoes is divisible by $2$. [b]p4.[/b] Two mirrors form an angle. A beam of light falls on one mirror. Prove that the beam is reflected only finitely many times (even if the angle between mirrors is very small). [b]p5.[/b] A sequence is given by the recurrence relation $a_{n+1} = (s(a_n))^2 +1$, where $s(x)$ is the sum of the digits of the positive integer $x$. Prove that starting from some moment the sequence is periodic. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In the triangle $ABC , \angle A = \alpha, BC = a$. The inscribed circle touches the lines $AB$ and $AC$ at points $M$ and $P$. Find the length of the chord cut by the line $MP$ in a circle with diameter $BC$.

A sequence of integers, $\{a_{n}\}_{n \ge 1}$ with $a_{1}>0$, is defined by \[a_{n+1}=\frac{a_{n}}{2}\;\;\; \text{if}\;\; n \equiv 0 \;\; \pmod{4},\] \[a_{n+1}=3 a_{n}+1 \;\;\; \text{if}\;\; n \equiv 1 \; \pmod{4},\] \[a_{n+1}=2 a_{n}-1 \;\;\; \text{if}\;\; n \equiv 2 \; \pmod{4},\] \[a_{n+1}=\frac{a_{n}+1}{4}\;\;\; \text{if}\;\; n \equiv 3 \; \pmod{4}.\] Prove that there is an integer $m$ such that $a_{m}=1$.

The city of Bridge Village has some highways. Highways are closed curves that have intersections with each other or themselves in $4$-way crossroads. Mr.Bridge Lover, mayor of the city, wants to build a bridge on each crossroad in order to decrease the number of accidents. He wants to build the bridges in such a way that in each highway, cars pass above a bridge and under a bridge alternately. By knowing the number of highways determine that this action is possible or not. [i]Proposed by Erfan Salavati[/i]

Let $n > 1$ be a positive integer and $a_1, a_2, \dots, a_{2n} \in \{ -n, -n + 1, \dots, n - 1, n \}$. Suppose \[ a_1 + a_2 + a_3 + \dots + a_{2n} = n + 1 \] Prove that some of $a_1, a_2, \dots, a_{2n}$ have sum 0.

Let $a_1=0$, $a_2=1$, and $a_{n+2}=a_{n+1}+a_n$ for all positive integers $n$. Show that there exists an increasing infinite arithmetic progression of integers, which has no number in common in the sequence $\{a_n\}_{n \ge 0}$.

Let $A_1A_2A_3A_4A_5$ be a regular pentagon with side length 1. The sides of the pentagon are extended to form the 10-sided polygon shown in bold at right. Find the ratio of the area of quadrilateral $A_2A_5B_2B_5$ (shaded in the picture to the right) to the area of the entire 10-sided polygon. [asy] size(8cm); defaultpen(fontsize(10pt)); pair A_2=(-0.4382971011,5.15554989475), B_4=(-2.1182971011,-0.0149584477027), B_5=(-4.8365942022,8.3510997895), A_3=(0.6,8.3510997895), B_1=(2.28,13.521608132), A_4=(3.96,8.3510997895), B_2=(9.3965942022,8.3510997895), A_5=(4.9982971011,5.15554989475), B_3=(6.6782971011,-0.0149584477027), A_1=(2.28,3.18059144705); filldraw(A_2--A_5--B_2--B_5--cycle,rgb(.8,.8,.8)); draw(B_1--A_4^^A_4--B_2^^B_2--A_5^^A_5--B_3^^B_3--A_1^^A_1--B_4^^B_4--A_2^^A_2--B_5^^B_5--A_3^^A_3--B_1,linewidth(1.2)); draw(A_1--A_2--A_3--A_4--A_5--cycle); pair O = (A_1+A_2+A_3+A_4+A_5)/5; label("$A_1$",A_1, 2dir(A_1-O)); label("$A_2$",A_2, 2dir(A_2-O)); label("$A_3$",A_3, 2dir(A_3-O)); label("$A_4$",A_4, 2dir(A_4-O)); label("$A_5$",A_5, 2dir(A_5-O)); label("$B_1$",B_1, 2dir(B_1-O)); label("$B_2$",B_2, 2dir(B_2-O)); label("$B_3$",B_3, 2dir(B_3-O)); label("$B_4$",B_4, 2dir(B_4-O)); label("$B_5$",B_5, 2dir(B_5-O)); [/asy]