Found problems: 85335
$\vartriangle ABC$ is a triangle with $AB < BC, \Gamma$ its circumcircle, $K$ the midpoint of the minor arc $CA$ of the circle $C$ and $T$ a point on $\Gamma$ such that $KT$ is perpendicular to $BC$. If $A',B'$ are the intouch points of the incircle of $\vartriangle ABC$ with the sides $BC,AC$, prove that the lines $AT,BK,A'B'$ are concurrent.
Let n be a positive integer and $x_1, x_2, ..., x_n > 0$ be real numbers so that $x_1 + x_2 +... + x_n =\frac{1}{x_1^2}+\frac{1}{x_2^2}+...+\frac{1}{x_n^2}$
Show that for each positive integer $k \le n$, there are $k$ numbers among $x_1, x_2, ..., x_n $ whose sum is at least $k$.
Find a necessary and sufficient condition on the positive integer $n$ that the equation \[x^n + (2 + x)^n + (2 - x)^n = 0\] have a rational root.
Find all real solutions $x$ of the equation $$\lfloor x^2-2 \rfloor +2 \lfloor x \rfloor = \lfloor x \rfloor ^2. $$
.
A game is played with 16 cards laid out in a row. Each card has a black side and a red side, and initially the face-up sides of the cards alternate black and red with the leftmost card black-side-up. A move consists of taking a consecutive sequence of cards (possibly only containing 1 card) with leftmost card black-side-up and the rest of the cards red-side-up, and flipping all of these cards over. The game ends when a move can no longer be made. What is the maximum possible number of moves that can be made before the game ends?
[i]Ray Li.[/i]
[size=85][i]See a close variant [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=810&t=500913]here[/url].[/i][/size]
Find all functions $f: \mathbb R \to \mathbb R$ such that for any $x,y \in \mathbb R$, the multiset $\{(f(xf(y)+1),f(yf(x)-1)\}$ is identical to the multiset $\{xf(f(y))+1,yf(f(x))-1\}$.
[i]Note:[/i] The multiset $\{a,b\}$ is identical to the multiset $\{c,d\}$ if and only if $a=c,b=d$ or $a=d,b=c$.
Let $n$ be a positive integer. If $r\hspace{0.25mm} \equiv \hspace{1mm} n\hspace{1mm} (mod\hspace{1mm} 2)$ and $r\hspace{0.10mm} \in \hspace{0.10mm} \{ 0,\hspace{0.10mm} 1 \} $, find the number of integer solutions to the system of equations
$\left\{\begin{array}{l}x+y+z = r \\ \mid x \mid + \mid y \mid + \mid z \mid = n \end{array}\right.$
The letters $AAABBCC$ are arranged in random order. The probability no two adjacent letters will be the same is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
For any natural number $ n, $ denote $ x_n $ as being the number of natural numbers of $ n $ digits that are divisible by $ 4 $ and formed only with the digits $ 0,1,2 $ or $ 6. $
[b]a)[/b] Calculate $ x_1,x_2,x_3,x_4. $
[b]b)[/b] Find the natural number $ m $ such that
$$ 1+\left\lfloor \frac{x_2}{x_1}\right\rfloor +\left\lfloor \frac{x_3}{x_2}\right\rfloor +\left\lfloor \frac{x_4}{x_3}\right\rfloor +\cdots +\left\lfloor \frac{x_{m+1}}{x_m}\right\rfloor =2016 , $$
where $ \lfloor\rfloor $ is the usual integer part.
There is a complete graph $G$ with $4027$ vertices drawn on the whiteboard. Ivan paints all the edges by red or blue colour. Find all ordered pairs $(r, b)$ such that Ivan can paint the edges so that every vertex is connected to exactly $r$ red edges and $b$ blue edges.
What is the remainder, in base $10$, when $24_7 + 364_7 + 43_7 + 12_7 + 3_7 + 1_7$ is divided by $6$?
Let $n$ be a positive integer. Mariano divides a rectangle into $n^2$ smaller rectangles by drawing $n-1$ vertical lines and $n-1$ horizontal lines, parallel to the sides of the larger rectangle. On every step, Emilio picks one of the smaller rectangles and Mariano tells him its area. Find the least positive integer $k$ for which it is possible that Emilio can do $k$ conveniently thought steps in such a way that with the received information, he can determine the area of each one of the $n^2$ smaller rectangles.
Let $O$ be the origin. $y = c$ intersects the curve $y = 2x - 3x^3$ at $P$ and $Q$ in the first quadrant and cuts the y-axis at $R$. Find $c$ so that the region $OPR$ bounded by the y-axis, the line $y = c$ and the curve has the same area as the region between $P$ and $Q$ under the curve and above the line $y = c$.
What minimal number of numbers from the set $\{1,2,...,1982\}$ should be deleted to provide the property:
[i]none of the remained numbers equals to the product of two other remained numbers[/i]?
Let $f(t)=\frac{t}{1-t}$, $t \not= 1$. If $y=f(x)$, then $x$ can be expressed as
$\textbf{(A)}\ f\left(\frac{1}{y}\right)\qquad
\textbf{(B)}\ -f(y)\qquad
\textbf{(C)}\ -f(-y)\qquad
\textbf{(D)}\ f(-y)\qquad
\textbf{(E)}\ f(y)$
How many more hours are in $10$ years than seconds in $1$ day?
$\textbf{(A) }1000\qquad\textbf{(B) }1100\qquad\textbf{(C) }1150\qquad\textbf{(D) }1200\qquad\textbf{(E) }1300$
Prove that there exists a triangle which can be cut into 2005 congruent triangles.
Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.
Given triangle $ ABC$ with sidelengths $ a,b,c$. Tangents to incircle of $ ABC$ that parallel with triangle's sides form three small triangle (each small triangle has 1 vertex of $ ABC$). Prove that the sum of area of incircles of these three small triangles and the area of incircle of triangle $ ABC$ is equal to
$ \frac{\pi (a^{2}\plus{}b^{2}\plus{}c^{2})(b\plus{}c\minus{}a)(c\plus{}a\minus{}b)(a\plus{}b\minus{}c)}{(a\plus{}b\plus{}c)^{3}}$
(hmm,, looks familiar, isn't it? :wink: )
A magic square is a square with side 3 consisting of 9 unit squares, such that the numbers written in the unit squares (one number in each square) satisfy the following property: the sum of the numbers in each row is equal to the sum of the numbers in each column and is equal to the sum of all the numbers written in any of the two diagonals.
A rectangle with sides $m\ge3$ and $n\ge3$ consists of $mn$ unit squares. If in each of those unit squares exactly one number is written, such that any square with side $3$ is a magic square, then find the number of most different numbers that can be written in that rectangle.
Consider a regular polygon $A_0A_1...A_{n-1}, n \ge 3$, and $m \in\{1, 2, ..., n - 1\}, m \ne n/2$. For any number $i \in \{0,1, ... , n - 1\}$, let $r(i)$ be the remainder of $i + m$ at the division by $n$. Prove that no three segments $A_iA_{r(i)}$ are concurrent.
Find all such functions $f :\mathbb{R}\to \mathbb{R}$ such that for all $x,y\in\mathbb{R}$ the following holds :
\[ f(x^2)+f(xy)=f(x)f(y)+yf(x)+xf(x+y) \]
Determine all functions $f:\mathbb R\to\mathbb R$ such that \[f(xy-1)+f(x)f(y)=2xy-1,\]for any real numbers $x{}$ and $y{}.$
Evaluate $ \int_1^{e^2} \frac{(e^{\sqrt{x}}\minus{}e^{\minus{}\sqrt{x}})\cos \left(e^{\sqrt{x}}\plus{}e^{\minus{}\sqrt{x}}\plus{}\frac{\pi}{4}\right)\plus{}(e^{\sqrt{x}}\plus{}e^{\minus{}\sqrt{x}})\cos \left(e^{\sqrt{x}}\minus{}e^{\minus{}\sqrt{x}}\plus{}\frac{\pi}{4}\right)}{\sqrt{x}}\ dx.$
A round robin tournament is held with $2016$ participants. Each player plays each other player once and no games result in ties. We say a pair of players $A$ and $B$ is a [i]dominant pair[/i] if all other players either defeat $A$ and $B$ or are defeated by both $A$ and $B$. Find the maximum number dominant pairs.
[i]Proposed by Nathan Ramesh