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: 85335

Let a triangle $ABC$ be given. Two circles passing through $A$ touch $BC$ at points $B$ and $C$ respectively. Let $D$ be the second common point of these circles ($A$ is closer to $BC$ than $D$). It is known that $BC = 2BD$. Prove that $\angle DAB = 2\angle ADB.$
Let $ABCD$ be a quadrilateral inscribed in a circle $\Omega.$ Let the tangent to $\Omega$ at $D$ meet rays $BA$ and $BC$ at $E$ and $F,$ respectively. A point $T$ is chosen inside $\triangle ABC$ so that $\overline{TE}\parallel\overline{CD}$ and $\overline{TF}\parallel\overline{AD}.$ Let $K\ne D$ be a point on segment $DF$ satisfying $TD=TK.$ Prove that lines $AC,DT,$ and $BK$ are concurrent.
Let $a$, $b$, and $c$ be non-zero real number such that $\tfrac{ab}{a+b}=3$, $\tfrac{bc}{b+c}=4$, and $\tfrac{ca}{c+a}=5$. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{abc}{ab+bc+ca}=\tfrac{m}{n}$. Find $m+n$.
For which real numbers $a$ is the set of all solutions of the inequality $$(x^2 + ax + 4)(x^2 - 5x + 6) < 0$$ an interval?
Given a quadrilateral $ABCD$ with $AB = BC =3$ cm, $CD = 4$ cm, $DA = 8$ cm and $\angle DAB + \angle ABC = 180^o$. Calculate the area of the quadrilateral.
A [i]special number[/i] is a positive integer $n$ for which there exists positive integers $a$, $b$, $c$, and $d$ with \[ n = \frac {a^3 + 2b^3} {c^3 + 2d^3}. \] Prove that i) there are infinitely many special numbers; ii) $2014$ is not a special number. [i]Romania[/i]
I think we are allowed to discuss since its after 24 hours How do you do this Prove that $d(1)+d(3)+..+d(2n-1)\leq d(2)+d(4)+...d(2n)$ which $d(x)$ is the divisor function
Each side of square $ABCD$ with side length of $4$ is divided into equal parts by three points. Choose one of the three points from each side, and connect the points consecutively to obtain a quadrilateral. Which numbers can be the area of this quadrilateral? Just write the numbers without proof. [asy] import graph; size(4.662701220158751cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -4.337693339683693, xmax = 2.323308403400238, ymin = -0.39518100382374105, ymax = 4.44811779880594; /* image dimensions */ pen yfyfyf = rgb(0.5607843137254902,0.5607843137254902,0.5607843137254902); pen sqsqsq = rgb(0.12549019607843137,0.12549019607843137,0.12549019607843137); filldraw((-3.,4.)--(1.,4.)--(1.,0.)--(-3.,0.)--cycle, white, linewidth(1.6)); filldraw((0.,4.)--(-3.,2.)--(-2.,0.)--(1.,1.)--cycle, yfyfyf, linewidth(2.) + sqsqsq); /* draw figures */ draw((-3.,4.)--(1.,4.), linewidth(1.6)); draw((1.,4.)--(1.,0.), linewidth(1.6)); draw((1.,0.)--(-3.,0.), linewidth(1.6)); draw((-3.,0.)--(-3.,4.), linewidth(1.6)); draw((0.,4.)--(-3.,2.), linewidth(2.) + sqsqsq); draw((-3.,2.)--(-2.,0.), linewidth(2.) + sqsqsq); draw((-2.,0.)--(1.,1.), linewidth(2.) + sqsqsq); draw((1.,1.)--(0.,4.), linewidth(2.) + sqsqsq); label("$A$",(-3.434705427329005,4.459844914550807),SE*labelscalefactor,fontsize(14)); label("$B$",(1.056779902954702,4.424663567316209),SE*labelscalefactor,fontsize(14)); label("$C$",(1.0450527872098359,0.07390362597090126),SE*labelscalefactor,fontsize(14)); label("$D$",(-3.551976584777666,0.12081208895036549),SE*labelscalefactor,fontsize(14)); /* dots and labels */ dot((-2.,4.),linewidth(4.pt) + dotstyle); dot((-1.,4.),linewidth(4.pt) + dotstyle); dot((0.,4.),linewidth(4.pt) + dotstyle); dot((1.,3.),linewidth(4.pt) + dotstyle); dot((1.,2.),linewidth(4.pt) + dotstyle); dot((1.,1.),linewidth(4.pt) + dotstyle); dot((0.,0.),linewidth(4.pt) + dotstyle); dot((-1.,0.),linewidth(4.pt) + dotstyle); dot((-3.,1.),linewidth(4.pt) + dotstyle); dot((-3.,2.),linewidth(4.pt) + dotstyle); dot((-3.,3.),linewidth(4.pt) + dotstyle); dot((-2.,0.),linewidth(4.pt) + dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [i]Proposed by Hirad Aalipanah[/i]
The side $AB$ of $\Delta ABC$ touches the corresponding excircle at point $T$. Let $J$ be the center of the excircle inscribed into $\angle A$, and $M$ be the midpoint of $AJ$. Prove that $MT = MC$.
We call a $5$-tuple of integers [i]arrangeable[/i] if its elements can be labeled $a, b, c, d, e$ in some order so that $a-b+c-d+e=29$. Determine all $2017$-tuples of integers $n_1, n_2, . . . , n_{2017}$ such that if we place them in a circle in clockwise order, then any $5$-tuple of numbers in consecutive positions on the circle is arrangeable. [i]Warut Suksompong, Thailand[/i]
Let $ a,\ b$ are positive constants. Determin the value of a positive number $ m$ such that the areas of four parts of the region bounded by two parabolas $ y\equal{}ax^2\minus{}b,\ y\equal{}\minus{}ax^2\plus{}b$ and the line $ y\equal{}mx$ have equal area.
Let $A_1C_2B_1B_2C_1A_2$ be a cyclic convex hexagon inscribed in circle $\Omega$, centered at $O$. Let $\{ P \} = A_2B_2 \cap A_1B_1$ and $\{ Q \} = A_2C_2 \cap A_1C_1$. Let $\Gamma_1$ be a circle tangent to $OB_1$ and $OC_1$ at $B_1,C_1$ respectively. Similarly, define $\Gamma_2$ to be the circle tangent to $OB_2,OC_2$ at $B_2, C_2$ respectively. Prove that there is a homothety that sends $\Gamma_1$ to $\Gamma_2$, whose center lies on $PQ$
Let $a,b,c,d$ be non-zero integers, such that the only quadruple of integers $(x, y, z, t)$ satisfying the equation \[ax^2+by^2+cz^2+dt^2=0\] is $x=y=z=t=0$. Does it follow that the numbers $a,b,c,d$ have the same sign?
On side $BC$ of an acute triangle $ABC$ are marked points $D$ and $E$ so that $BD = CE$. On the arc $DE$ of the circumscribed circle of triangle $ADE$ that does not contain the point $A$, there are points $P$ and $Q$ such that $AB = PC$ and $AC = BQ$. Prove that $AP=AQ$.
Two players play a game, starting with a pile of $N$ tokens. On each player’s turn, they must remove $2^n$ tokens from the pile for some nonnegative integer $n$. If a player cannot make a move, they lose. For how many $N$ between $ 1$ and $2019$ (inclusive) does the first player have a winning strategy?
Determine all triples of real numbers $(a,b,c)$ such that \begin{eqnarray*} xyz &=& 8 \\ x^2y + y^2z + z^2x &=& 73 \\ x(y-z)^2 + y(z-x)^2 + z(x-y)^2 &=& 98 . \end{eqnarray*}
A pentagon $ABCDE$ is inscribed in a circle $O$, and satis es $AB = BC , AE = DE$. The circle that is tangent to $DE$ at $E$ and passing $A$ hits $EC$ at $F$ and $BF$ at $G (\ne F)$. Let $DG\cap O = H (\ne D)$. Prove that the tangent to $O$ at $E$ is perpendicular to $HA$.
Twenty points are marked on the circumference of a circle. Two players play the following game. On each turn, one connects two of the $20$ points with a segment, according to the following rules: [list] [*] a segment can only appear once during the game; [*] no two segments can intersect, except at the endpoints; [*] the player who has no choice left loses the game.[/list] Assuming both players use their best strategy, which one (first or second) is certain to win the game?
We will call the sequence of positive real numbers. $a_1,a_2,\dots ,a_n$ of [i]length [/i] $n$ when $$a_1\geq \frac{a_1+a_2}{2}\geq \dots \geq \frac{a_1+a_2+\cdots +a_n}{n}.$$ Let $x_1,x_2,\dots ,x_n$ and $y_1,y_2,\dots ,y_n$ be sequences of length $n.$ Prove that $$\sum_{i = 1}^{n}x_iy_i\geq\frac{1}{n}\left(\sum_{i = 1}^{n}x_i\right)\left(\sum_{i = 1}^{n}y_i\right).$$ [i](tatari/nightmare)[/i]
The following fractions are written on the board $\frac{1}{n}, \frac{2}{n-1}, \frac{3}{n-2}, \ldots , \frac{n}{1}$ where $n$ is a natural number. Vasya calculated the differences of the neighboring fractions in this row and found among them $10000$ fractions of type $\frac{1}{k}$ (with natural $k$). Prove that he can find even $5000$ more of such these differences.
Let $P$ be the set of all subsets of ${1, 2, ... , n}$. Show that there are $1^n + 2^n + ... + m^n$ functions $f : P \longmapsto {1, 2, ... , m}$ such that $f(A \cap B) = min( f(A), f(B))$ for all $A, B.$
Given a square $ABCD$ of side length $6$, the point $E$ is drawn on the line $AB$ such that the distance $EA$ is less than $EB$ and the triangle $\vartriangle BCE$ has the same area as $ABCD$. Compute the shaded area. [img]https://cdn.artofproblemsolving.com/attachments/a/8/5d945a593aee58af3af94f4e8e967eeaeefa6a.png[/img]
Given a circle centered at $ O $ and two points $ A $ and $ B $ lying on it. $ A $ and $ B $ do not form a diameter. The point $ C $ is chosen on the circle so that the line $ AC $ divides the segment $ OB $ in half. Let lines $ AB $ and $ OC $ intersect at $ D $, and let lines $ BC $ and $ AO $ intersect at $ F $. Prove that $ AF = CD $.
Let $ a_1, a_2, ..., a_{300}$ be nonnegative real numbers, with $ \sum_{i\equal{}1}^{300} a_i \equal{} 1$. Find the maximum possible value of $ \sum_{i \neq j, i|j} a_ia_j$.
Let $S$ be a square of side length $1$, one of whose vertices is $A$. Let $S^+$ be the square obtained by rotating S clockwise about $A$ by $30^o$ . Let $S^-$ be the square obtained by rotating S counterclockwise about $A$ by $30^o$. Compute the total area that is covered by exactly two of the squares $S$, $S^+$, $S^-$. Express your answer in the form $a + b\sqrt3$ where $a, b$ are rational numbers.