Found problems: 85335
How many complex numbers $z$ such that $\left| z \right| < 30$ satisfy the equation
\[
e^z = \frac{z - 1}{z + 1} \, ?
\]
A rectangular piece of paper with side lengths 5 by 8 is folded along the dashed lines shown below, so that the folded flaps just touch at the corners as shown by the dotted lines. Find the area of the resulting trapezoid.
[asy]
size(150);
defaultpen(linewidth(0.8));
draw(origin--(8,0)--(8,5)--(0,5)--cycle,linewidth(1));
draw(origin--(8/3,5)^^(16/3,5)--(8,0),linetype("4 4"));
draw(origin--(4,3)--(8,0)^^(8/3,5)--(4,3)--(16/3,5),linetype("0 4"));
label("$5$",(0,5/2),W);
label("$8$",(4,0),S);
[/asy]
A positive integer $n$ is called $\textit{good}$ if $2 \mid \tau(n)$ and if its divisors are $$1=d_1<d_2<\ldots<d_{2k-1}<d_{2k}=n, $$ then $d_{k+1}-d_k=2$ and $d_{k+2}-d_{k-1}=65$. Find the smallest $\textit{good}$ number.
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all $x,y, \in \mathbb{R}$,
\[xf(x+xy)=xf(x)+f(x^{2})\cdot f(y).\]
Let $a_1 < a_2 < \cdots < a_k$ denote the sequence of all positive integers between $1$ and $91$ which are relatively prime to $91$, and set $\omega = e^{2\pi i/91}$. Define \[S = \prod_{1\leq q < p\leq k}\left(\omega^{a_p} - \omega^{a_q}\right).\] Given that $S$ is a positive integer, compute the number of positive divisors of $S$.
The number "3" is written on a board. Ana and Bernardo take turns, starting with Ana, to play the following game. If the number written on the board is $n$, the player in his/her turn must replace it by an integer $m$ coprime with $n$ and such that $n<m<n^2$. The first player that reaches a number greater or equal than 2016 loses. Determine which of the players has a winning strategy and describe it.
Let a,b,c>0 with ab+bc+ca=1. Prove that: $\frac{b^3c}{a^2+b^2}+\frac{c^3a}{b^2+c^2}+\frac{a^3b}{c^2+a^2}\ge\frac{1}{2}.$
$7$ boys each went to a shop $3$ times. Each pair met at the shop. Show that $3$ must have been in the shop at the same time.
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that
\[ f(x) f(y) = |x - y| \cdot f \left( \frac{xy + 1}{x - y} \right) \]
Holds for all $x \not= y \in \mathbb{R}$
$a,b,c$ are the length of three sides of a triangle. Let $A= \frac{a^2 +bc}{b+c}+\frac{b^2 +ca}{c+a}+\frac{c^2 +ab}{a+b}$, $B=\frac{1}{\sqrt{(a+b-c)(b+c-a)}}+\frac{1}{\sqrt{(b+c-a)(c+a-b)}}$$+\frac{1}{\sqrt{(c+a-b)(a+b-c)}}$. Prove that $AB \ge 9$.
Let $n$ be a positive integer not divisible by $2$ or $3$. Prove that for all integers $k$, the number $(k+1)^n-k^n-1$ is divisible by $k^2+k+1$.
Let $VABC$ be a regular triangular pyramid with base $ABC$, of center $O$. Points $I$ and $H$ are the center of the inscribed circle, respectively the orthocenter $\vartriangle VBC$. Knowing that $AH = 3 OI$, determine the measure of the angle between the lateral edge of the pyramid and the plane of the base.
Determine all nonzero integers $a$ for which there exists two functions $f,g:\mathbb Q\to\mathbb Q$ such that
\[f(x+g(y))=g(x)+f(y)+ay\text{ for all } x,y\in\mathbb Q.\]
Also, determine all pairs of functions with this property.
[i]Vasile Pop[/i]
Given pairs $(a_1,b_1)$, $(a_2,b_2),\ldots, (a_n,b_n)$ of non-negative real numbers such that for any real $x$ and $y$ the equality
$$\sqrt{a_1x^2+b_1y^2}+\sqrt{a_2x^2+b_2y^2}+\ldots+\sqrt{a_nx^2+b_ny^2}=\sqrt{x^2+y^2}$$
Prove that $a_1=b_1,a_2=b_2,\ldots$,$a_n=b_n$
[i]A. Vaidzelevich[/i]
For how many positive integers $n$ is $n^3-8n^2+20n-13$ a prime number?
$\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }\text{more than 4}$
Let triangle $ABC$ have side lengths $AB=11$, $BC=7$, and $AC=12$. Let $D$ be a point on $AC$ and $E$ be a point on $AB$ such that $\angle CDE=90^\circ$ and the area of triangle $CDE$ is maximized. Find the area of triangle $CDE$.
Find all pairs $(a, b)$ of real numbers such that $a \cdot \lfloor b \cdot n\rfloor = b \cdot \lfloor a \cdot n \rfloor$ applies to all positive integers$ n$.
(For a real number $x, \lfloor x\rfloor$ denotes the largest integer that is less than or equal to $x$.)
Let the two base angles of a triangle be $A$ and $B$, with $B$ larger than $A$. The altitude to the base divides the vertex angle $C$ into two parts, $C_1$ and $C_2$, with $C_2$ adjacent to side $a$. Then:
${{{ \textbf{(A)}\ C_1+C_2=A+B \qquad\textbf{(B)}\ C_1-C_2=B-A \qquad\textbf{(C)}\ C_1-C_2=A-B} \qquad\textbf{(D)}\ C_1+C_2=B-A}\qquad\textbf{(E)}\ C_1-C_2=A+B} $
Find the coordinates of the point in the plane at which the sum of the distances from it to the three points $(0, 0)$, $(2, 0)$, $(0, \sqrt{3})$ is minimal.
On the sides $ BC $, $ CA $, $ AB $ of the triangle $ ABC $, the points $ M $, $ N $, $ P $ are taken, respectively, in such a way that $$\frac{BM}{MC} = \frac{CN}{NA} = \frac{AP}{PB} = k, $$
where $ k $ means a given number greater than $ 1 $, then the segments $ AM $, $ BN $, $ CP $ were drawn . Given the area $ S $ of the triangle $ ABC $, calculate the area of the triangle bounded by the lines $ AM $, $ BN $ and $ CP $.
$ABCD$ is a parallelogram in which angle $DAB$ is acute. Points $A, P, B, D$ lie on one circle in exactly this order. Lines $AP$ and $CD$ intersect in $Q$. Point $O$ is the circumcenter of the triangle $CPQ$. Prove that if $D \neq O$ then the lines $AD$ and $DO$ are perpendicular.
Let $n$ be a positive integer, and $a_j$, for $j=1,2,\ldots,n$ are complex numbers. Suppose $I$ is an arbitrary nonempty subset of $\{1,2,\ldots,n\}$, the inequality $\left|-1+ \prod_{j\in I} (1+a_j) \right| \leq \frac 12$ always holds.
Prove that $\sum_{j=1}^n |a_j| \leq 3$.
Let $k$ be a positive integer and let $S$ be a finite set of odd prime numbers. Prove that there is at most one way (up to rotation and reflection) to place the elements of $S$ around the circle such that the product of any two neighbors is of the form $x^2+x+k$ for some positive integer $x$.
Let $k>1$ be a given positive integer. A set $S$ of positive integers is called [i]good[/i] if we can colour the set of positive integers in $k$ colours such that each integer of $S$ cannot be represented as sum of two positive integers of the same colour. Find the greatest $t$ such that the set $S=\{a+1,a+2,\ldots ,a+t\}$ is [i]good[/i] for all positive integers $a$.
[i]A. Ivanov, E. Kolev[/i]
Let $f(x)=Ax^2+Bx+C$, $g(x)=ax^2+bx+c$ be two quadratic polynomial functions with real coefficients that satisfy the relation \[|f(x)| \ge |g(x)|\] for all real $x$. Prove that $|b^2-4ac| \le |B^2-4AC|.$
My solution was nearly complete...