Found problems: 85335
Find all functions $f : R \to R$ that satisfy the functional equation $$f(x + f(xy)) = f(x)(1 + y).$$
Let $p$ be a prime number and let $k$ be a positive integer. Suppose that the numbers $a_i=i^k+i$ for $i=0,1, \ldots,p-1$ form a complete residue system modulo $p$. What is the set of possible remainders of $a_2$ upon division by $p$?
Let $\mathbb{N}$ denote the set of positive integers. For how many positive integers $k\le 2018$ do there exist a function $f: \mathbb{N}\to \mathbb{N}$ such that $f(f(n))=2n$ for all $n\in \mathbb{N}$ and $f(k)=2018$?
[i]Proposed by James Lin
Points $P$ and $Q$ lies inside triangle $ABC$ such that $\angle ACP =\angle BCQ$ and $\angle CAP = \angle BAQ$. Denote by $D,E$, and $F$ the feet of perpendiculars from $P$ to lines $BC,CA$, and $AB$, respectively. Prove that if $\angle DEF = 90^o$, then $Q$ is the orthocenter of triangle $BDF$.
In an isosceles triangle $ABC$ with $AB = AC$, $D$ is the midpoint of $AC$ and $E$ is the projection of $D$ onto $BC$. Let $F$ be the midpoint of $DE$. Prove that the lines $BF$ and $AE$ are perpendicular if and only if the triangle $ABC$ is equilateral.
Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold:
(a) the union of any two white subsets is white;
(b) the union of any two black subsets is black;
(c) there are exactly $N$ white subsets.
Let $n$ be a positive integer. Let $x_1, x_2, \dots, x_n > 1$ be real numbers whose product is $n+1$. Prove that \[\left(\frac{1}{1^2(x_1-1)}+1\right)\left(\frac{1}{2^2(x_2-1)}+1\right)\cdots\left(\frac{1}{n^2(x_n-1)}+1\right)\geq n+1\] and find for which values equality holds.
In a triangle $ABC$, let $D$ and $E$ be the midpoints of $AC$ and $BC$ respectively. The distance from the midpoint of $BD$ to the midpoint of $AE$ is $4.5$. What is the length of side $AB$?
Let \(p\) a prime number, and \(N\) the number of matrices \(p \times p\)
\[\begin{array}{cccc}
a_{11} & a_{12} & \ldots & a_{1p}\\
a_{21} & a_{22} & \ldots & a_{2p}\\
\vdots & \vdots & \ddots & \vdots \\
a_{p1} & a_{p2} & \ldots & a_{pp}
\end{array}\]
such that \(a_{ij} \in \{0,1,2,\ldots,p\} \) and if \(i \leq i^\prime\) and \(j \leq j^\prime\), then \(a_{ij} \leq a_{i^\prime j^\prime}\).
Find \(N \pmod{p}\).
A linear binomial $l(z) = Az + B$ with complex coefficients $A$ and $B$ is given. It is known that the maximal value of $|l(z)|$ on the segment $-1 \leq x \leq 1$ $(y = 0)$ of the real line in the complex plane $z = x + iy$ is equal to $M.$ Prove that for every $z$
\[|l(z)| \leq M \rho,\]
where $\rho$ is the sum of distances from the point $P=z$ to the points $Q_1: z = 1$ and $Q_3: z = -1.$
In $\triangle ABC$, prove that $1< \sum_{cyc}{\cos A}\le \frac{3}{2}$.
For how many pairs $(a,b)$ from $(1,2)$, $(3,5)$, $(5,7)$, $(7,11)$, the polynomial $P(x)=x^5+ax^4+bx^3+bx^2+ax+1$ has exactly one real root?
$
\textbf{(A)}\ 4
\qquad\textbf{(B)}\ 3
\qquad\textbf{(C)}\ 2
\qquad\textbf{(D)}\ 1
\qquad\textbf{(E)}\ 0
$
A strip consists of $n$ squares which are numerated in their order by integers $1,2,3,..., n$. In the beginning, one square is empty while each remaining square contains one piece. Whenever a square contains a piece and its some neighbouring square contains another piece while the square immediately following the neighbouring square is empty, one may raise the first piece over the second one to the empty square, removing the second piece from the strip.
Find all possibilites which square can be initially empty, if it is possible to reach a state where the strip contains only one piece and
a) $n = 2008$,
b) $n = 2009$.
Let $p$ and $q$ be relatively prime positive odd integers such that $1 < p < q$. Let $A$ be a set of pairs of integers $(a, b)$, where $0 \le a \le p - 1, 0 \le b \le q - 1$, containing exactly one pair from each of the sets $$\{(a, b),(a + 1, b + 1)\}, \{(a, q - 1), (a + 1, 0)\}, \{(p - 1,b),(0, b + 1)\}$$ whenever $0 \le a \le p - 2$ and $0 \le b \le q - 2$. Show that $A$ contains at least $(p - 1)(q + 1)/8$ pairs whose entries are both even.
Agnijo Banerjee and Joe Benton, United Kingdom
Let \[ f(n)= \sum_{p|n , \;p^{\alpha} \leq n < p^{\alpha+1} \ } p^{\alpha} .\] Prove that \[ \limsup_{n \rightarrow \infty}f(n) \frac{ \log \log n}{n \log n}=1 .\]
[i]P. Erdos[/i]
Two circles are given for which there is a family of quadrilaterals circumscribed around the first circle and inscribed in the second. Let's denote by $a, b, c$ and $d{}$ the consecutive lengths of the sides of one of these quadrilaterals. Prove that the sum \[\frac{a}{c}+\frac{c}{a}+\frac{b}{d}+\frac{d}{b}\]does not depend on the choice of the quadrilateral.
[i]Proposed by I. Weinstein[/i]
The number $125$ can be written as a sum of some pairwise coprime integers larger than $1$. Determine the largest number of terms that the sum may have.
Congruent unit circles intersect in such a way that the center of each circle lies on the circumference of the other. Let $R$ be the region in which two circles overlap. Determine the perimeter of $R.$
Show that $ n\equiv 0\pmod 9 $ if $ 2^n\equiv -1\pmod n, $ where $ n $ is a natural number greater than $ 3. $
An insect lives on the surface of a regular tetrahedron with edges of length 1. It wishes to travel on the surface of the tetrahedron from the midpoint of one edge to the midpoint of the opposite edge. What is the length of the shortest such trip? (Note: Two edges of a tetrahedron are opposite if they have no common endpoint.)
$ \displaystyle \textbf{(A)} \ \frac {1}{2} \sqrt {3} \qquad \textbf{(B)} \ 1 \qquad \textbf{(C)} \ \sqrt {2} \qquad \textbf{(D)} \ \frac {3}{2} \qquad \textbf{(E)} \ 2$
You have an unlimited supply of monominos, dominos, and L-trominos. How many ways, in terms of $n$, can you cover a $2 \times n$ grid with these shapes? Please note that you do [i]NOT[/i] have to use all the shapes. Also, you are allowed to [i]rotate[/i] any of the pieces, so they do not have to be aligned exactly as they are in the diagram below.
[asy]
pen db = rgb(0,0,0.5); real r = 0.08; pair s1 = (3,0), s2 = 2*s1;
fill(unitsquare, db); fill(shift(s1)*unitsquare, db); fill(shift(s1-(0,1+r))*unitsquare, db); fill(shift(s2)*unitsquare, db); fill(shift(s2-(0,1+r))*unitsquare, db); fill(shift(s2+(1+r,-1-r))*unitsquare, db);
[/asy]
There are 20 buns with jam and 20 buns with treacle arranged in a row in random order. Alice and Bob take in turn a bun from any end of the row. Alice starts, and wants to finally obtain 10 buns of each type; Bob tries to prevent this. Is it true for any order of the buns that Alice can win no matter what are the actions of Bob?
[i]Alexandr Gribalko[/i]
Let $p(x) = 3x^2 + 1$. Compute the largest prime divisor of $p(100) - p(3)$
Find all pairs of non-negative integers $m$ and $n$ that satisfy $$3 \cdot 2^m + 1 = n^2.$$
Let be two $ 3\times 3 $ real matrices that have the property that
$$ AX=\begin{pmatrix}0\\0\\0\end{pmatrix}\implies BX=\begin{pmatrix}0\\0\\0\end{pmatrix} , $$
for any three-dimensional vectors $ X. $
Prove that there exists a $ 3\times 3 $ real matrix $ C $ such that $ B=CA. $