Found problems: 85335
Let $ABC$ be a triangle with $\angle{C} = 90^{\circ}$, and let $H$ be the foot of the altitude from $C$. A point $D$ is chosen inside the triangle $CBH$ so that $CH$ bisects $AD$. Let $P$ be the intersection point of the lines $BD$ and $CH$. Let $\omega$ be the semicircle with diameter $BD$ that meets the segment $CB$ at an interior point. A line through $P$ is tangent to $\omega$ at $Q$. Prove that the lines $CQ$ and $AD$ meet on $\omega$.
x,y,z positive real numbers such that $x^2+y^2+z^2=25$
Find the min price of $A=\frac{xy}{z}+\frac{yz}{x}+\frac{zx}{y}$
There are $2003$ pieces of candy on a table. Two players alternately make moves. A move consists of eating one candy or half of the candies on the table (the “lesser half” if there are an odd number of candies). At least one candy must be eaten at each move. The loser is the one who eats the last candy. Which player has a winning strategy?
An ant starts at vertex $A$ in equilateral triangle $\triangle ABC$ and walks around the perimeter of the triangle from $A$ to $B$ to $C$ and back to $A$. When the ant is $42$ percent of its way around the triangle, it stops for a rest. Find the percent of the way from $B$ to $C$ the ant is at that point
Compute the sum of all real solutions $\alpha$ (in radians) to the equation
\[ |\sin\alpha|=\left\lfloor \frac{\alpha}{20} \right\rfloor. \]
Let $n$ be a positive integer. An $n-\emph{simplex}$ in $\mathbb{R}^n$ is given by $n+1$ points $P_0, P_1,\cdots , P_n$, called its vertices, which do not all belong to the same hyperplane. For every $n$-simplex $\mathcal{S}$ we denote by $v(\mathcal{S})$ the volume of $\mathcal{S}$, and we write $C(\mathcal{S})$ for the center of the unique sphere containing all the vertices of $\mathcal{S}$.
Suppose that $P$ is a point inside an $n$-simplex $\mathcal{S}$. Let $\mathcal{S}_i$ be the $n$-simplex obtained from $\mathcal{S}$ by replacing its $i^{\text{th}}$ vertex by $P$. Prove that :
\[ \sum_{j=0}^{n}v(\mathcal{S}_j)C(\mathcal{S}_j)=v(\mathcal{S})C(\mathcal{S}) \]
Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ which satisfy the equality,
\[f(x+f(y))=f(x-f(y))+4xf(y)\]
for any $x,y\in\mathbb{R}$.
A given finite number of lines in the plane, no two of which are parallel and no three of which are concurrent, divide the plane into finite and infinite regions. In each finite region we write $1$ or $-1$. In one operation, we can choose any triangle made of three of the lines (which may be cut by other lines in the collection) and multiply by $-1$ each of the numbers in the triangle. Determine if it is always possible to obtain $1$ in all the finite regions by successively applying this operation, regardless of the initial distribution of $1$s and $-1$s.
Marie does three equally time-consuming tasks in a row without taking breaks. She begins the first task at 1:00 PM and finishes the second task at 2:40 PM. When does she finish the third task?
$ \textbf{(A) }\text{3:10 PM}\qquad\textbf{(B) }\text{3:30 PM}\qquad\textbf{(C) }\text{4:00 PM}\qquad\textbf{(D) }\text{4:10 PM}\qquad\textbf{(E) }\text{4:30 PM} $
Let $r$ be a nonnegative continuous function on the real line. Show that there exists a function $f\in C^1(\mathbb{R})$, not identically zero, such that $f'(x)=f(x-r(f(x)))$, $x\in\mathbb{R}$.
(translated by L. Erdős)
Let $S$ be a class of functions from $[0,\infty)$ to $[0,\infty)$ that satisfies:
(i) The functions $f_1(x)=e^x-1$ and $f_2(x)=\ln(x+1)$ are in $S;$
(ii) If $f(x)$ and $g(x)$ are in $S,$ the functions $f(x)+g(x)$ and $f(g(x))$ are in $S;$
(iii) If $f(x)$ and $g(x)$ are in $S$ and $f(x)\ge g(x)$ for all $x\ge 0,$ then the function $f(x)-g(x)$ is in $S.$
Prove that if $f(x)$ and $g(x)$ are in $S,$ then the function $f(x)g(x)$ is also in $S.$
Initially the numbers 1 through 2005 are marked. A finite set of marked consecutive integers is called a block if it is not contained in any larger set of marked consecutive integers. In each step we select a set of marked integers which does not contain the first or last element of any block, unmark the selected integers, and mark the same number of consecutive integers starting with the integer two greater than the largest marked integer. What is the minimum number of steps necessary to obtain 2005 single integer blocks?
Let $A = (0,0)$, $B=(-1,-1)$, $C=(x,y)$, and $D=(x+1,y)$, where $x > y$ are positive integers. Suppose points $A$, $B$, $C$, $D$ lie on a circle with radius $r$. Denote by $r_1$ and $r_2$ the smallest and second smallest possible values of $r$. Compute $r_1^2 + r_2^2$.
[i]Proposed by Lewis Chen[/i]
A circumscribed pyramid $ABCDS$ is given. The opposite sidelines of its base meet at points $P$ and $Q$ in such a way that $A$ and $B$ lie on segments $PD$ and $PC$ respectively. The inscribed sphere touches faces $ABS$ and $BCS$ at points $K$ and $L$. Prove that if $PK$ and $QL$ are complanar then the touching point of the sphere with the base lies on $BD$.
Suppose real numbers $a, b, c, d$ satisfy $a + b + c + d = 17$ and $ab + bc + cd + da = 46$. If the minimum possible value of $a^2 + b^2 + c^2 + d^2$ can be expressed as a rational number $\frac{p}{q}$ in simplest form, find $p + q$.
There are $n$ stone piles each consisting of $2018$ stones. The weight of each stone is equal to one of the numbers $1, 2, 3, ...25$ and the total weights of any two piles are different. It is given that if we choose any two piles and remove the heaviest and lightest stones from each of these piles then the pile which has the heavier one becomes the lighter one. Determine the maximal possible value of $n$.
Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.
Right triangle $ ABC,$ with $ \angle A\equal{}90^{\circ},$ is inscribed in circle $ \Gamma.$ Point $ E$ lies on the interior of arc $ {BC}$ (not containing $ A$) with $ EA>EC.$ Point $ F$ lies on ray $ EC$ with $ \angle EAC \equal{} \angle CAF.$ Segment $ BF$ meets $ \Gamma$ again at $ D$ (other than $ B$). Let $ O$ denote the circumcenter of triangle $ DEF.$ Prove that $ A,C,O$ are collinear.
In an acute triangle $ABC$, altitudes at vertices $A$ and $B$ and bisector line at angle $C$ intersect the circumcircle again at points $A_1, B_1$ and $C_0$. Using the straightedge and compass, reconstruct the triangle by points $A_1, B_1$ and $C_0$.
Two types of tiles, depicted on the figure below, are given.
[img]https://wiki-images.artofproblemsolving.com//2/23/Izrezak.PNG[/img]
Find all positive integers $n$ such that an $n\times n$ board consisting of $n^2$ unit squares can be covered without gaps with these two types of tiles (rotations and reflections are allowed) so that no two tiles overlap and no part of any tile covers an area outside the $n\times n$ board. \\
[i]Proposed by Art Waeterschoot[/i]
Find all positive integers $a$ and $b$ such that number $p=\frac{\sqrt{2}+\sqrt{a}}{\sqrt{3}+\sqrt{b}}$ is rational number
There are $2n-1$ lamps in a row. In the beginning only the middle one is on (the $n$-th one), and the other ones are off. Allowed move is to take two non-adjacent lamps which are turned off such that all lamps between them are turned on and switch all of their states from on to off and vice versa. What is the maximal number of moves until the process terminates?
In an obtuse triangle $ABC$, for which $AC < AB$, the radius of the inscribed circle is $R$, the midpoint of its arc $BC$ (which does not contain $A$) is $S$. A point $T$ is placed on the extension of altitude $AD$ such that $D$ is between $ A$ and $T$ and $AT = 2R$. Prove that $\angle AST = 90^o$.
There are $10$ horses, named Horse 1, Horse 2, $\ldots$, Horse 10. They get their names from how many minutes it takes them to run one lap around a circular race track: Horse $k$ runs one lap in exactly $k$ minutes. At time 0 all the horses are together at the starting point on the track. The horses start running in the same direction, and they keep running around the circular track at their constant speeds. The least time $S > 0$, in minutes, at which all $10$ horses will again simultaneously be at the starting point is $S = 2520$. Let $T>0$ be the least time, in minutes, such that at least $5$ of the horses are again at the starting point. What is the sum of the digits of $T$?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$
Let $ABC$ be an acute,non-isosceles triangle with $AB<AC<BC$.Let $D,E,Z$ be the midpoints of $BC,AC,AB$ respectively and segments $BK,CL$ are altitudes.In the extension of $DZ$ we take a point $M$ such that the parallel from $M$ to $KL$ crosses the extensions of $CA,BA,DE$ at $S,T,N$ respectively (we extend $CA$ to $A$-side and $BA$ to $A$-side and $DE$ to $E$-side).If the circumcirle $(c_{1})$ of $\triangle{MBD}$ crosses the line $DN$ at $R$ and the circumcirle $(c_{2})$ of $\triangle{NCD}$ crosses the line $DM$ at $P$ prove that $ST\parallel PR$.