Found problems: 85335
Let $ABCD$ be a quadrilateral with each interior angle less than $180^o$. Show that if $A, B, C, D$ do not lie on a circle, then $AB \cdot CD + AD\cdot BC > AC \cdot BD$
Define a [i]domino[/i] to be an ordered pair of [i]distinct[/i] positive integers. A [i]proper sequence[/i] of dominoes is a list of distinct dominoes in which the first coordinate of each pair after the first equals the second coordinate of the immediately preceding pair, and in which $(i, j)$ and $(j, i)$ do not [i]both[/i] appear for any $i$ and $j$. Let $D_n$ be the set of all dominoes whose coordinates are no larger than $n$. Find the length of the longest proper sequence of dominoes that can be formed using the dominoes of $D_n$.
[b]8.[/b] Let $f(x)$ be a convex function defined on the interval $[0, \frac {1}{2}]$ with $f(0)=0$ and $f(\frac{1}{2})=1$; Let further $f(x)$ be differentiable in $(0, \frac {1}{2})$, and differentiable at $0$ and $\frac{1}{2}$ from the right and from the left, respectively. Finally, let $f'(0)>1$.
Extend $f(x)$ to $[0.1]$ in the following manner: let $f(x)= f(1-x)$ if $x \in (\frac {1} {2}, 1]$.
Show that the set of the points $x$ for shich the terms of the sequence $x_{n+1}=f(x_n)$ ($x_0=x; n = 0, 1, 2, \dots $) are not all different is everywhere dense in $[0,1]$; [b](R. 10)[/b]
Solve in the real numbers $x, y, z$ a system of the equations:
\[
\begin{cases}
x^2 - (y+z+yz)x + (y+z)yz = 0 \\
y^2 - (z + x + zx)y + (z+x)zx = 0 \\
z^2 - (x+y+xy)z + (x+y)xy = 0. \\
\end{cases}
\]
Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible.
[i]Carl Schildkraut, USA[/i]
Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$.
[i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]
There are $n$ different integers on the blackboard. Whenever two of these integers are chosen, either their sum or difference (possibly both) will be a positive integral power of $2$. Find the greatest possible value of $n$.
Let $ABCD$ be a convex quadrilateral with perpendicular diagonals. . Assume that $ABCD$ has been inscribed in the circle with center $O$. Prove that $AOC$ separates $ABCD$ into two quadrilaterals of equal area
Find all positive integers $n$ for which $n^{n-1} - 1$ is divisible by $2^{2015}$, but not by $2^{2016}$.
Prove that for every square-free integer $n>1$, there exists a prime number $p$ and an integer $m$ satisfying
\[ p \mid n \quad \text{and} \quad n \mid p^2+p\cdot m^p. \]
Evaluate $\int_{-\frac{\pi}{3}}^{\frac{\pi}{6}} \left|\frac{4\sin x}{\sqrt{3}\cos x-\sin x}\right|dx.$
2009 Kumamoto University entrance exam/Medicine
Let $X=\{1,2,3,...,12\}$. Find the number of pairs of $\{A,B\}$ such that $A\subseteq X, B\subseteq X, A\ne B$ and $A\cap B=\{2,3,5,7,8\}$.
The real numbers $x,y,z, m, n$ are positive, such that $m + n \ge 2$. Prove that
$x\sqrt{yz(x + my)(x + nz)} + y\sqrt{xz(y + mx)(y + nz)} + z\sqrt{xy(z + mx)(x + ny) }\le \frac{3(m + n)}{8}
(x + y)(y + z)(z + x)$
Let $ABC$ be a triangle, and let $D$ be the foot of the $A-$altitude. Points $P, Q$ are chosen on $BC$ such that $DP = DQ = DA$. Suppose $AP$ and $AQ$ intersect the circumcircle of $ABC$ again at $X$ and $Y$. Prove that the perpendicular bisectors of the lines $PX$, $QY$, and $BC$ are concurrent.
[i]Proposed by Pranjal Srivastava[/i]
At the math contest each participant met at least $3$ pals who he/she already knew. Prove that the Jury can choose an even number of participants (more than two) and arrange them around a table so that each participant be set between these who he/she knows.
Let $a_1,a_2,\dots$ be a sequence of positive numbers satisfying, for any positive integers $k,l,m,n$ such that $k+n=m+l$, $$\frac{a_k+a_n}{1+a_ka_n}=\frac{a_m+a_l}{1+a_ma_l}.$$Show that there exist positive numbers $b,c$ so that $b\le a_n\le c$ for any positive integer $n$.
Let $n$ be a positive integer, $n\geq 4$. $n$ cards are arranged on a circle and the numbers $1$ or $-1$ are written on each of the cards. in a $question$ we may find out the product of the numbers on any $3$ cards. What is the minimum numbers if questions needed to find out the product of all $n$ numbers?
Consider all binary sequences of length $n$. In a sequence that allows the interchange of positions of an arbitrary set of $k$ adjacent numbers, ($k < n$), two sequences are said to be [i]equivalent [/i] if they can be transformed from one sequence to another by a finite number of transitions as above. Find the number of sequences that are not equivalent.
Let $ x,y,z$ be positive integers. If $ 7$ divides $ (x\plus{}6y)(2x\plus{}5y)(3x\plus{}4y)$ than prove that $ 343$ also divides it.
Let $M$ be a set containing positive integers with the following three properties:
(1) $2018 \in M$.
(2) If $m \in M$, then all positive divisors of m are also elements of $M$.
(3) For all elements $k, m \in M$ with $1 < k < m$, the number $km + 1$ is also an element of $M$.
Prove that $M = Z_{\ge 1}$.
[i](Proposed by Walther Janous)[/i]
Find all $f:\mathbb{R}^+ \rightarrow \mathbb{R}^+$ such that for all distinct $x,y,z$
$f(x)^2-f(y)f(z)=f(x^y)f(y)f(z)[f(y^z)-f(z^x)]$
In the plane we are given a set $ E$ of 1991 points, and certain pairs of these points are joined with a path. We suppose that for every point of $ E,$ there exist at least 1593 other points of $ E$ to which it is joined by a path. Show that there exist six points of $ E$ every pair of which are joined by a path.
[i]Alternative version:[/i] Is it possible to find a set $ E$ of 1991 points in the plane and paths joining certain pairs of the points in $ E$ such that every point of $ E$ is joined with a path to at least 1592 other points of $ E,$ and in every subset of six points of $ E$ there exist at least two points that are not joined?
Let $\gamma,\Gamma$ be two concentric circles with radii $r,R$ with $r<R$. Let $ABCD$ be a cyclic quadrilateral inscribed in $\gamma$. If $\overrightarrow{AB}$ denotes the Ray starting from $A$ and extending indefinitely in $B's$ direction then Let $\overrightarrow{AB}, \overrightarrow{BC}, \overrightarrow{CD} , \overrightarrow{DA}$ meet $\Gamma$ at the points $C_1,D_1,A_1,B_1$ respectively. Prove that
\[\frac{[A_1B_1C_1D_1]}{[ABCD]} \ge \frac{R^2}{r^2}\]
where $[.]$ denotes area.
You are given two diameters $AB$ and $CD$ of circle $\Omega$ with radius $1$. A circle is drawn in one of the smaller sectors formed such that it is tangent to $AB$ at $E$, tangent to $CD$ at $F$, and tangent to $\Omega$ at $P$. Lines $PE$ and $PF$ intersect $\Omega$ again at $X$ and $Y$ . What is the length of $XY$ , given that $AC = \frac23$ ?
The points of the plane are colored in black and white so that whenever three vertices of a parallelogram are the same color, the fourth vertex is that color, too. Prove that all the points of the plane are the same color.