Found problems: 85335
Let $\Gamma$ be a circle and let $d$ be a line such that $\Gamma$ and $d$ have no common points. Further, let $AB$ be a diameter of the circle $\Gamma$; assume that this diameter $AB$ is perpendicular to the line $d$, and the point $B$ is nearer to the line $d$ than the point $A$. Let $C$ be an arbitrary point on the circle $\Gamma$, different from the points $A$ and $B$. Let $D$ be the point of intersection of the lines $AC$ and $d$. One of the two tangents from the point $D$ to the circle $\Gamma$ touches this circle $\Gamma$ at a point $E$; hereby, we assume that the points $B$ and $E$ lie in the same halfplane with respect to the line $AC$. Denote by $F$ the point of intersection of the lines $BE$ and $d$. Let the line $AF$ intersect the circle $\Gamma$ at a point $G$, different from $A$.
Prove that the reflection of the point $G$ in the line $AB$ lies on the line $CF$.
A sequence $\{a_n\}$ , $a_1=1,a_2=2,a_{n+1}=\dfrac{a_n^2+(-1)^n}{a_{n-1}}$. Show that $a_m^2+a_{m+1}^2\in\{a_n\},\forall m\in\Bbb N$
$\vartriangle A_0B_0C_0$ has side lengths $A_0B_0 = 13$, $B_0C_0 = 14$, and $C_0A_0 = 15$. $\vartriangle A_1B_1C_1$ is inscribed in the incircle of $\vartriangle A_0B_0C_0$ such that it is similar to the first triangle. Beginning with $\vartriangle A_1B_1C_1$, the same steps are repeated to construct $\vartriangle A_2B_2C_2$, and so on infinitely many times. What is the value of $\sum_{i=0}^{\infty} A_iB_i$?
Prove that the interval $\lbrack 0,1 \rbrack$ can be split into black and white intervals for any quadratic polynomial $P(x)$, such that the sum of weights of the black intervals is equal to the sum of weights of the white intervals. (Define the weight of the interval $\lbrack a,b \rbrack$ as $P(b) - P(a)$.)
Does the same result hold with a degree 3 or degree 5 polynomial?
Three points $A,B,C$ are such that $B \in ]AC[$. On the side of $AC$ we draw the three semicircles with diameters $[AB], [BC]$ and $[AC]$. The common interior tangent at $B$ to the first two semi-circles meets the third circle in $E$. Let $U$ and $V$ be the points of contact of the common exterior tangent to the first two semi-circles. Denote the area of the triangle $ABC$ as $S(ABC)$. Evaluate the ratio $R=\frac{S(EUV)}{S(EAC)}$ as a function of $r_1 = \frac{AB}{2}$ and $r_2 = \frac{BC}{2}$.
Suppose a circle $C$ of radius $\sqrt2$ touches the $Y$ -axis at the origin $(0, 0)$. A ray of light $L$, parallel to the $X$-axis, reflects on a point $P$ on the circumference of $C$, and after reflection, the reflected ray $L'$ becomes parallel to the $Y$ -axis. Find the distance between the ray $L$ and the $X$-axis.
Let $P$ be a point in the interior $\triangle ABC$, and $AD,BE,CF$ 3 concurrent cevians through $P$, with $D,E,F$ on $BC,CA,AB$. The circle with the diameter $BC$ intersects the circle with the diameter $AD$ in $D_1,D_2$. Analogously we define $E_1,E_2$ and $F_1,F_2$. Prove that $D_1,D_2,E_1,E_2,F_1,F_2$ are concylic.
Let $ ABC$ be an acute triangle with $ \angle BAC\equal{}60^{\circ}$. Let $ P$ be a point in triangle $ ABC$ with $ \angle APB\equal{}\angle BPC\equal{}\angle CPA\equal{}120^{\circ}$. The foots of perpendicular from $ P$ to $ BC,CA,AB$ are $ X,Y,Z$, respectively. Let $ M$ be the midpoint of $ YZ$.
a) Prove that $ \angle YXZ\equal{}60^{\circ}$
b) Prove that $ X,P,M$ are collinear.
Find all real solutions to the equation $4x^2 - 40 \lfloor x \rfloor + 51 = 0$.
Find max number $n$ of numbers of three digits such that :
1. Each has digit sum $9$
2. No one contains digit $0$
3. Each $2$ have different unit digits
4. Each $2$ have different decimal digits
5. Each $2$ have different hundreds digits
Let \( n \geq 2 \) be a positive integer. Find all \( n \)-tuples \( (a_1, \ldots, a_n) \) of complex numbers such that the numbers \( a_1 - 2a_2 \), \( a_2 - 2a_3 \), $\ldots$ , \( a_{n-1} - 2a_n \), \( a_n - 2a_1 \) form a permutation of the numbers \( a_1, \ldots, a_n \).
Let $n$ be a positive integer.
(1) For a positive integer $k$ such that $1\leq k\leq n$, Show that :
\[\int_{\frac{k-1}{2n}\pi}^{\frac{k}{2n}\pi} \sin 2nt\cos t\ dt=(-1)^{k+1}\frac{2n}{4n^2-1}(\cos \frac{k}{2n}\pi +\cos \frac{k-1}{2n}\pi).\]
(2) Find the area $S_n$ of the part expressed by a parameterized curve $C_n: x=\sin t,\ y=\sin 2nt\ (0\leq t\leq \pi).$
If necessary, you may use ${\sum_{k=1}^{n-1} \cos \frac{k}{2n}\pi =\frac 12(\frac{1}{\tan \frac{\pi}{4n}}-1})\ (n\geq 2).$
(3) Find $\lim_{n\to\infty} S_n.$
Suppose $x_1,x_2,...,x_{60}\in [-1,1]$ , find the maximum of
$$ \sum_{i=1}^{60}x_i^2(x_{i+1}-x_{i-1}),$$
where $x_{i+60}=x_i$.
$ O $ is the circumcentre of $ ABC $ and $ A_1\neq A $ is the point on $ AO $ and the circumcircle of $ ABC. $ The centers of mass of $ ABC, A_1BC $ are $ G,G_1, $ respectively, and $ P $ is the intersection of $ AG_1 $ with $ OG. $ Show that $ \frac{PG}{PO}=\frac{2}{3} . $
[i]Gabriel Popa, Paul Georgescu[/i]
Arnulfo and Berenice play the following game: One of the two starts by writing a number from $ 1$ to $30$, the other chooses a number from $ 1$ to $30$ and adds it to the initial number, the first player chooses a number from $ 1$ to $30$ and adds it to the previous result, they continue doing the same until someone manages to add $2018$. When Arnulfo was about to start, Berenice told him that it was unfair, because whoever started had a winning strategy, so the numbers had better change. So they asked the following question:
Adding chosen numbers from $1 $ to $a$, until reaching the number $ b$, what conditions must meet $a$ and $ b$ so that the first player does not have a winning strategy?
Indicate if Arnulfo and Berenice are right and answer the question asked by them.
Triangle $ABC$ is inscribed in a circle with center $O$. Let $q$ be the circle passing through $A$, $O$ and $B$. The lines $CA$ and $CB$ intersect $q$ at the points $D$ and $E$ (different from $A$ and $B$). Prove that the lines $CO$ and $DE$ are perpendicular to each other.
(S Markelov)
Let $n\geq 3$ be an integer. Find the largest real number $M$ such that for any positive real numbers $x_1,x_2,\cdots,x_n$, there exists an arrangement $y_1,y_2,\cdots,y_n$ of real numbers satisfying
\[\sum_{i=1}^n \frac{y_i^2}{y_{i+1}^2-y_{i+1}y_{i+2}+y_{i+2}^2}\geq M,\]
where $y_{n+1}=y_1,y_{n+2}=y_2$.
Let ${u_n}$ be the Fibonacci sequence, i.e., $u_0=0,u_1=1,u_n=u_{n-1}+u_{n-2}$ for $n>1$. Prove that there exist infinitely many prime numbers $p$ that divide $u_{p-1}$.
Let $D$ be a point inside $\triangle ABC$ such that $\angle CDA + \angle CBA = 180^{\circ}.$ The line $CD$ meets the circle $\odot ABC$ at the point $E$ for the second time. Let $G$ be the common point of the circle centered at $C$ with radius $CD$ and the arc $\overset{\LARGE \frown}{AC}$ of $\odot ABC$ which does not contain the point $B$. The circle centered at $A$ with radius $AD$ meets $\odot BCD$ for the second time at $F$.
Prove that the lines $GE, FD, CB$ are concurrent or parallel.
Point $P$ lies on the median from vertex $C$ of a triangle $ABC$. Line $AP$ meets $BC$ at $X$, and line $BP$ meets $AC$ at $Y$ . Prove that if quadrilateral $ABXY$ is cyclic, then triangle $ABC$ is isosceles.
Consider the main diagonal and the cells above it in an \( n \times n \) grid. These cells form what we call a tabular triangle of length \( n \). We want to place a real number in each cell of a tabular triangle of length \( n \) such that for each cell, the sum of the numbers in the cells in the same row and the same column (including itself) is zero. For example, the sum of the cells marked with a circle is zero. It is known that the number in the topmost and leftmost cell is $1.$ Find all possible ways to fill the remaining cells.
In tetrahedron $ABCD$, vertex $D$ is connected with $D_0$, the centrod if $\triangle ABC$. Line parallel to $DD_0$ are drawn through $A,B$ and $C$. These lines intersect the planes $BCD, CAD$ and $ABD$ in points $A_2, B_1,$ and $C_1$, respectively. Prove that the volume of $ABCD$ is one third the volume of $A_1B_1C_1D_0$. Is the result if point $D_o$ is selected anywhere within $\triangle ABC$?
For a function $f(x)=x^3-x^2+x$, find the limit $\lim_{n\to\infty} \int_{n}^{2n}\frac{1}{f^{-1}(x)^3+|f^{-1}(x)|}\ dx.$
A graph has $30$ points and each point has $6$ edges. Find the total number of triples such that each pair of points is joined or each pair of points is not joined.
Several knights are arranged on an infinite chessboard. No square is attacked by more than one knight (in particular, a square occupied by a knight can be attacked by one knight but not by two). Sasha outlined a $ 14\times 16$ rectangle. What maximum number of knights can this rectangle contain?