Found problems: 85335
Let $a$ and $b$ be positive integers greater than $2$. Prove that there exists a positive integer $k$ and a finite sequence $n_1$, $\cdots$, $n_k$ of positive integers such that $n_1 =a$, $n_k =b$, and $n_i n_{i+1}$ is divisible by $n_{i}+n_{i+1}$ for each $i$ $(1 \le i \le k)$.
Find all functions ${ f : N \rightarrow N}$ (where ${N}$ is the set of the natural numbers and is assumed to contain ${0}$), such that ${f(x^2) - f(y^2) = f(x + y)f(x - y)}$ for all ${x, y \in N}$ with ${x \ge y}$.
The diagram below is made up of a rectangle AGHB, an equilateral triangle AFG, a rectangle ADEF, and a parallelogram ABCD. Find the degree measure of ∠ABC. For diagram go to http://www.purplecomet.org/welcome/practice, the 2015 middle school contest, and go to #2
Let $ABC$ be an acute triangle such that $AB < AC$. Let $\omega$ be the circumcircle of $ABC$
and assume that the tangent to $\omega$ at $A$ intersects the line $BC$ at $D$. Let $\Omega$ be the circle with
center $D$ and radius $AD$. Denote by $E$ the second intersection point of $\omega$ and $\Omega$. Let $M$ be the
midpoint of $BC$. If the line $BE$ meets $\Omega$ again at $X$, and the line $CX$ meets $\Omega$ for the second
time at $Y$, show that $A, Y$, and $M$ are collinear.
[i]Proposed by Nikola Velov, North Macedonia[/i]
Let $ABC$ be an acute angled triangle satisfying the conditions $AB>BC$ and $AC>BC$. Denote by $O$ and $H$ the circumcentre and orthocentre, respectively, of the triangle $ABC.$ Suppose that the circumcircle of the triangle $AHC$ intersects the line $AB$ at $M$ different from $A$, and the circumcircle of the triangle $AHB$ intersects the line $AC$ at $N$ different from $A.$ Prove that the circumcentre of the triangle $MNH$ lies on the line $OH$.
Find all non negative integers $(a, b)$ such that
$$a + 2b - b^2 =\sqrt{2a + a^2 + |2a + 1 - 2b|}.$$
In a group of interpreters each one speaks one of several foreign languages, 24 of them speak Japanese, 24 Malaysian, 24 Farsi. Prove that it is possible to select a subgroup in which exactly 12 interpreters speak Japanese, exactly 12 speak Malaysian and exactly 12 speak Farsi.
Let $N$ be an odd number, $N\geq 3$. $N$ tennis players take part in a championship. Before starting the championship, a commission puts the players in a row depending on how good they think the players are. During the championship, every player plays with every other player exactly once, and each match has a winner. A match is called [i]suprising[/i] if the winner was rated lower by the commission. At the end of the tournament, players are arranged in a line based on the number of victories they have achieved. In the event of a tie, the commission's initial order is used to decide which player will be higher.
It turns out that the final order is exactly the same as the commission's initial order. What is the maximal number of suprising matches that could have happened.
Arnaldo selects a nonnegative integer $a$ and Bernaldo selects a nonnegative integer $b$. Both of them secretly tell their number to Cernaldo, who writes the numbers $5$, $8$, and $15$ on the board, one of them being the sum $a+b$.
Cernaldo rings a bell and Arnaldo and Bernaldo, individually, write on different slips of paper whether they know or not which of the numbers on the board is the sum $a+b$ and they turn them in to Cernaldo.
If both of the papers say NO, Cernaldo rings the bell again and the process is repeated.
It is known that both Arnaldo and Bernaldo are honest and intelligent.
What is the maximum number of times that the bell can be rung until one of them knows the sum?
Personal note: They really phoned it in with the names there…
Find all functions $f: R\to R$, such that $f(xy + x + y) + f(xy-x-y)=2f (x) + 2f (y)$ for all $x, y \in R$.
Let $ S$ be the set of nonnegative real numbers. Find all functions $ f: S\rightarrow S$ which satisfy $ f(x\plus{}y\minus{}z)\plus{}f(2\sqrt{xz})\plus{}f(2\sqrt{yz})\equal{}f(x\plus{}y\plus{}z)$ for all nonnegative $ x,y,z$ with $ x\plus{}y\ge z$.
Assume that the set of all positive integers is decomposed into $ r$ (disjoint) subsets $ A_1 \cup A_2 \cup \ldots \cup A_r \equal{} \mathbb{N}.$ Prove that one of them, say $ A_i,$ has the following property: There exists a positive $ m$ such that for any $ k$ one can find numbers $ a_1, a_2, \ldots, a_k$ in $ A_i$ with $ 0 < a_{j \plus{} 1} \minus{} a_j \leq m,$ $ (1 \leq j \leq k \minus{} 1)$.
Let $a_0$, $a_1$, $a_2$, ... be an infinite sequence of real numbers satisfying the equation $a_n=\left|a_{n+1}-a_{n+2}\right|$ for all $n\geq 0$, where $a_0$ and $a_1$ are two different positive reals.
Can this sequence $a_0$, $a_1$, $a_2$, ... be bounded?
[i]Proposed by Mihai Bălună, Romania[/i]
A function $f : I \to \mathbb R$, defined on an interval $I$, is called concave if $f(\theta x + (1 - \theta)y) \geq \theta f(x) + (1 - \theta)f(y)$ for all $x, y \in I$ and $0 \leq \theta \leq 1$. Assume that the functions $f_1, \ldots , f_n$, having all nonnegative values, are concave. Prove that the function $(f_1f_2 \cdots f_n)^{1/n}$ is concave.
Trace the curve whose equation is: \[ y^4 - x^4 - 96y^2 + 100x^2 = 0. \]
In a simple graph, there are two disjoint set of vertices $A$ and $B$ where $A$ has $k$ and $B$ has $2016$ vertices. Four numbers are written to each vertex using the colors red, green, blue and black. There is no any edge at the beginning. For each vertex in $A$, we first choose a color and then draw all edges from this vertex to the vertices in $B$ having a larger number with the chosen color. It is known that for each vertex in $B$, the set of vertices in $A$ connected to this vertex are different. Find the minimal possible value of $k$.
Let $a$ and $b$ be distinct real numbers for which \[\dfrac ab+\dfrac{a+10b}{b+10a}=2.\] Find $\dfrac ab$.
$\textbf{(A) }0.6\qquad\textbf{(B) }0.7\qquad\textbf{(C) }0.8\qquad\textbf{(D) }0.9\qquad\textbf{(E) }1$
Show that for all positive integers $k$, there exists a positive integer n such that $n2^k -7$ is a perfect square.
Point $D$ lies in $\triangle ABC$ and $BD=CD$,$\angle BDC=120$. Point $E$ lies outside $ABC$ and $AE=CE,\angle AEC=60$. Points $B$ and $E$ lies on different sides of $AC$. $F$ is midpoint $BE$. Prove, that $\angle AFD=90$
An isosceles trapezoid $PQRS$, with $\overline{PQ} = \overline{QR}= \overline{RS}$ and $\angle PQR = 120^o$, is inscribed in the graph of $y = x^2$ such that $QR$ is parallel to the $x$-axis and $R$ is in the first quadrant. The $x$-coordinate of point $R$ can be written as $\frac{\sqrt{A}}{B}$ for positive integers $A$ and $B$ such that $A$ is square-free. Find $1000A +B$.
Let $[ {x} ]$ be the greatest integer less than or equal to $x$, and let $\{x\}=x-[x]$.
Solve the equation: $[x] \cdot \{x\} = 2005x$
Define a search algorithm called $\texttt{powSearch}$. Throughout, assume $A$ is a 1-indexed sorted array of distinct integers. To search for an integer $b$ in this array, we search the indices $2^0,2^1,\ldots$ until we either reach the end of the array or $A[2^k] > b$. If at any point we get $A[2^k] = b$ we stop and return $2^k$. Once we have $A[2^k] > b > A[2^{k-1}]$, we throw away the first $2^{k-1}$ elements of $A$, and recursively search in the same fashion. For example, for an integer which is at position $3$ we will search the locations $1, 2, 4, 3$.
Define $g(x)$ to be a function which returns how many (not necessarily distinct) indices we look at when calling $\texttt{powSearch}$ with an integer $b$ at position $x$ in $A$. For example, $g(3) = 4$. If $A$ has length $64$, find
\[g(1) + g(2) + \ldots + g(64).\]
Suppose one is given $n$ real numbers, not all zero, but such that their sum is zero.
Prove that one can label these numbers $a_1, a_2, ..., a_n$ in such a manner that $a_1a_2 + a_2a_3 +...+a_{n-1}a_n + a_na_1 < 0$.
The inscribed circle of triangle $ABC$ touches the sides $BC$, $CA$ and $AB$ at $D$, $E$ and $F$ respectively. Let $Q$ denote the other point of intersection of $AD$ and the inscribed circle. Prove that $EQ$ extended passes through the midpoint of $AF$ if and only if $AC = BC$.
The polynomial $x^{2n}+1+(x+1)^{2n}$ is not divisible by $x^2+x+1$ if $n$ equals
$\text{(A)} \ 17 \qquad \text{(B)} \ 20 \qquad \text{(C)} \ 21 \qquad \text{(D)} \ 64 \qquad \text{(E)} \ 65$