Found problems: 85335
A positive integer $n\geq 4$ is called [i]interesting[/i] if there exists a complex number $z$ such that $|z|=1$ and \[1+z+z^2+z^{n-1}+z^n=0.\] Find how many interesting numbers are smaller than $2022.$
Let $f(x) =x^2-2x$. Find all $x$ for which $f(f(x))<3$.
The diagonals of a convex $18$-gon are colored in $5$ different colors, each color appearing on an equal number of diagonals. The diagonals of one color are numbered $1, 2,\cdots$. One randomly chooses one-fifth of all the diagonals. Find the number of possibilities for which among the chosen diagonals there exist exactly $n$ pairs of diagonals of the same color and with fixed indices $i, j$.
[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes
\[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\]
[b](b)[/b] Find the rearrangement that minimizes $Q.$
Positive integers $ a<b$ are given. Prove that among every $ b$ consecutive positive integers there are two numbers whose product is divisible by $ ab$.
Determine all digits $z$ such that for each integer $k \ge 1$ there exists an integer $n\ge 1$ with the property that the decimal representation of $n^9$ ends with at least $k$ digits $z$.
[i](Proposed by Walther Janous)[/i]
Find all sets of six points in the plane, no three collinear, such that if we partition the set into two sets, then the obtained triangles are congruent.
Find all pairs of positive integers ($x$,$y$) such that $y^3=x^3+7x^2+4x+15$.
Ben starts with an integer greater than $9$ and subtracts the sum of its digits from it to get a new integer. He repeats this process with each new integer he gets until he gets a positive $1$-digit integer. Find all possible $1$-digit integers Ben can end with from this process.
For positive integers $t,a,b,$a $(t,a,b)$-[i]game[/i] is a two player game defined by the following rules. Initially, the number $t$ is written on a blackboard. At his first move, the 1st player replaces $t$ with either $t-a$ or $t-b$. Then, the 2nd player subtracts either $a$ or $b$ from this number, and writes the result on the blackboard, erasing the old number. After this, the first player once again erases either $a$ or $b$ from the number written on the blackboard, and so on. The player who first reaches a negative number loses the game. Prove that there exist infinitely many values of $t$ for which the first player has a winning strategy for all pairs $(a,b)$ with $a+b=2005$.
Let $(x_n)$ define by $x_1\in \left(0;\dfrac{1}{2}\right)$ and $x_{n+1}=3x_n^2-2nx_n^3$ for all $n\ge 1$.
a) Prove that $(x_n)$ convergence to $0$.
b) For each $n\ge 1$, let $y_n=x_1+2x_2+\cdots+n x_n$. Prove that $(y_n)$ has a limit.
Let $ABCD$ be a convex quadrilateral, such that $ A$, $ B$, $C$, and $D$ lie on a circle, with $\angle DAB < \angle ABC$. Let $I$ be the intersection of the bisector of $\angle ABC$ with the bisector of $\angle BAD$. Let $\ell$ be the parallel line to $CD$ passing through point $I$. Suppose $\ell$ cuts segments $DA$ and $BC$ at $ L$ and $J$, respectively. Prove that $AL + JB = LJ$.
The sequence of polynomials $(a_n)$ is defined by $a_0=0$, $ a_1=x+2$ and $a_n=a_{n-1}+3a_{n-1}a_{n-2} +a_{n-2}$ for $n>1$.
(a) Show for all positive integers $k,m$: if $k$ divides $m$ then $a_k$ divides $a_m$.
(b) Find all positive integers $n$ such that the sum of the roots of polynomial $a_n$ is an integer.
A numismatist Fred has some coins. A diameter of any coin is no more than $10$ cm. All the coins are contained in a one-layer box of dimensions $30$ cm by $70$ cm. He is presented with a new coin. Its diameter is $25$ cm. Prove that it is possible to put all the coins in a one-layer box of dimensions $55$ cm by $55$ cm.
(Fedja Nazarov, St Petersburg)
Points $D$ and $E$ are chosen on the exterior of $\vartriangle ABC$ such that $\angle ADC = \angle BEC = 90^o$. If $\angle ACB = 40^o$, $AD = 7$, $CD = 24$, $CE = 15$, and $BE = 20$, what is the measure of $\angle ABC $ in,degrees?
Let $ABCD$ be a cyclic quadrilateral an let $P$ be a point on the side $AB.$ The diagonals $AC$ meets the segments $DP$ at $Q.$ The line through $P$ parallel to $CD$ mmets the extension of the side $CB$ beyond $B$ at $K.$ The line through $Q$ parallel to $BD$ meets the extension of the side $CB$ beyond $B$ at $L.$ Prove that the circumcircles of the triangles $BKP$ and $CLQ$ are tangent .
For a positive integer $p$, define the positive integer $n$ to be $p$-safe if $n$ differs in absolute value by more than $2$ from all multiples of $p$. For example, the set of $10$-safe numbers is $\{3, 4, 5, 6, 7, 13, 14, 15, 16, 17,23, \ldots \}$. Find the number of positive integers less than or equal to $10,000$ which are simultaneously $7$-safe, $11$-safe, and $13$-safe.·
Sequences $(a_n), (b_n)$ are defined by $ a_1 = 1, b_1 = 2$, $a_{n+1} = \frac{ 1 + a_n + a_nb_n}{b_n}$, $ b_{n+1} = \frac{ 1 +b_n+ a_nb_n}{a_n}$ for all positive integers $n$. Prove that $a_{2020} < 5$.
\[\int_0^{2\pi} \frac{1}{3+2 \sqrt{3} \cos x + \cos^2 x}\mathrm dx\]
[i]Proposed by Robert Trosten[/i]
Let $ABC$ be an acute triangle with $AC \neq BC$. Points $H$ and $I$ are the orthocenter and incenter of the triangle, respectively. Line $CH$ and $CI$ meet the circumcircle of triangle $ABC$ again at $D$ and $L$ (other than $C$), respectively. Prove that $\angle CIH=90^{\circ}$ if and only if $\angle IDL=90^{\circ}$.
Let $R$ be a square region and $n \ge 4$ an integer. A point $X$ in the interior of $R$ is called [i]n-ray partitional[/i] if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are 100-ray partitional but not 60-ray partitional?
$\textbf{(A)}\ 1500 \qquad
\textbf{(B)}\ 1560 \qquad
\textbf{(C)}\ 2320 \qquad
\textbf{(D)}\ 2480 \qquad
\textbf{(E)}\ 2500$
How many lattice points $P$ in or on the circle $x^2+y^2=25$ have the property that there exists a unique line with rational slope through $P$ that divides the circle into two parts with equal areas?
[i]Proposed by Nathan Ramesh
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for any real value of $x,y$ we have:
$$f(xf(y)+f(x)+y)=xy+f(x)+f(y)$$
For integers $a$ and $b$ consider the complex number \[\dfrac{\sqrt{ab+2016}}{ab+100} - \left(\frac{\sqrt{|a+b|}}{ab+100}\right)i.\] Find the number of ordered pairs of integers $(a, b)$ such that this complex number is a real number.
Let $m$ be a positive integer and let $A$, respectively $B$, be two alphabets with $m$, respectively $2m$ letters. Let also $n$ be an even integer which is at least $2m$. Let $a_n$ be the number of words of length $n$, formed with letters from $A$, in which appear all the letters from $A$, each an even number of times. Let $b_n$ be the number of words of length $n$, formed with letters from $B$, in which appear all the letters from $B$, each an odd number of times. Compute $\frac{b_n}{a_n}$.