Found problems: 85335
Prove that the volume $V$ and the lateral area $S$ of a right circular cone satisfy the inequality
\[\left( \frac{6V}{\pi}\right)^2 \leq \left( \frac{2S}{\pi \sqrt 3}\right)^3\]
When does equality occur?
Let $f(x)=x^4-4x^2+2.$ Find the smallest natural $n \in \mathbb{N}$ such that there exists $k,c \in \mathbb{N}$ with $$\left|f^k\left(\frac{n^2+1}{n}\right)-c^{144}\right| < \frac{1}{100}.$$
A rectangle $ABCD$ with $AB>AD$ is given. The circle with center $B$ and radius $AB$ intersects the line $CD$ at $E$ and $F$.
(a) Prove that the circumcircle of triangle $EBF$ is tangent to the circle with diameter $AD$. Denote the tangency point by $G$.
(b) Prove that the points $D,G,$ and $B$ are collinear.
A positive integer n is called [i]primary divisor [/i] if for every positive divisor $d$ of $n$ at least one of the numbers $d - 1$ and $d + 1$ is prime. For example, $8$ is divisor primary, because its positive divisors $1$, $2$, $4$, and $8$ each differ by $1$ from a prime number ($2$, $3$, $5$, and $7$, respectively), while $9$ is not divisor primary, because the divisor $9$ does not differ by $1$ from a prime number (both $8$ and $10$ are composite). Determine the largest primary divisor number.
Johnny writes down quadratic equation
\[ax^2 + bx + c = 0.\]
with positive integer coefficients $a, b, c$. Then Pete changes one, two, or none “$+$” signs to “$-$”. Johnny wins, if both roots of the (changed) equation are integers. Otherwise (if there are no real roots or at least one of them is not an integer), Pete wins. Can Johnny choose the coefficients in such a way that he will always win?
Let $n\ge3$ be an integer. Two regular $n$-gons $\mathcal{A}$ and $\mathcal{B}$ are given in the plane. Prove that the vertices of $\mathcal{A}$ that lie inside $\mathcal{B}$ or on its boundary are consecutive.
(That is, prove that there exists a line separating those vertices of $\mathcal{A}$ that lie inside $\mathcal{B}$ or on its boundary from the other vertices of $\mathcal{A}$.)
Let $a, b, c$ be non zero integers,$ a\ne c$ such that $$\frac{a}{c}=\frac{a^2+b^2}{c^2+b^2}$$
Prove that $a^2 +b^2 +c^2$ cannot be a prime number.
Consider a circle $k$ and a point $K$ in the plane. For any two distinct points $P$ and $Q$ on $k$, denote by $k'$ the circle through $P,Q$ and $K$. The tangent to $k'$ at $K$ meets the line $PQ$ at point $M$. Describe the locus of the points $M$ when $P$ and $Q$ assume all possible positions.
A real number $a \ne 0$ is given. Determine all functions $f : R \to R$ satisfying $f(x)f(y) + f(x + y) = axy$ for all real numbers $x, y$.
Show that there exists a unique sequence of decimal digits $p_0=5,p_1,p_2,\ldots$ such that, for any $k$, the square of any positive integer ending with $\overline{p_kp_{k-1}\cdots p_0}$ ends with the same digits.
Let $ABCDE$ be a convex pentagon such that $AB = BC = CD$ and $\angle BDE =
\angle EAC = 30 ^{\circ}$. Find the possible values of $\angle BEC$.
[i]Proposed by Josef Tkadlec (Czech Republic)[/i]
Points $A ,B ,C ,D$ lie on a line in this order. Draw parallel lines $a$ and $b$ through $A$ and $B$, respectively, and parallel lines $c$ and $d$ through $C$ and $D$, respectively, such that their points of intersection are vertices of a square. Prove that the side length of this square does not depend on the length of segment $BC$.
A $2008 \times 2009$ rectangle is divided into unit squares. In how many ways can you remove a pair of squares such that the remainder can be covered with $1 \times 2$ dominoes?
Let $ABC$ be a triangle with incenter $I$. Let the circle centered at $B$ and passing through $I$ intersect side $AB$ at $D$ and let the circle centered at $C$ passing through $I$ intersect side $AC$ at $E$. Suppose $DE$ is the perpendicular bisector of $AI$. What are all possible measures of angle $BAC $ in degrees?
Let $ABCD$ be a cyclic quadrilateral satisfying $\angle ABD = \angle DBC$. Let $E$ be the intersection of the diagonals $AC$ and $BD$. Let $M$ be the midpoint of $AE$, and $N$ be the midpoint of $DC$. Show that $MBCN$ is a cyclic quadrilateral.
The larger of two consecutive odd integers is three times the smaller. What is their sum?
$ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 20$
Let $ABC$ be a triangle with circumcircle $\omega$. Let $l_B$ and $l_C$ be two lines through the points $B$ and $C$, respectively, such that $l_B \parallel l_C$. The second intersections of $l_B$ and $l_C$ with $\omega$ are $D$ and $E$, respectively. Assume that $D$ and $E$ are on the same side of $BC$ as $A$. Let $DA$ intersect $l_C$ at $F$ and let $EA$ intersect $l_B$ at $G$. If $O$, $O_1$ and $O_2$ are circumcenters of the triangles $ABC$, $ADG$ and $AEF$, respectively, and $P$ is the circumcenter of the triangle $OO_1O_2$, prove that $l_B \parallel OP \parallel l_C$.
[i]Proposed by Stefan Lozanovski, Macedonia[/i]
Sheila is making a regular-hexagon-shaped sign with side length $ 1$. Let $ABCDEF$ be the regular hexagon, and let $R, S,T$ and U be the midpoints of $FA$, $BC$, $CD$ and $EF$, respectively. Sheila splits the hexagon into four regions of equal width: trapezoids $ABSR$, $RSCF$ , $FCTU$, and $UTDE$. She then paints the middle two regions gold. The fraction of the total hexagon that is gold can be written in the form $m/n$ , where m and n are relatively prime positive integers. Compute $m + n$.
[img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvYS9lLzIwOTVmZmViZjU3OTMzZmRlMzFmMjM1ZWRmM2RkODMyMTA0ZjNlLnBuZw==&rn=MjAyMCBCTVQgSW5kaXZpZHVhbCAxMy5wbmc=[/img]
Let $a, b, c$ be positive reals so that $a^2+b^2+c^2=1$. Find the minimum value of $S=1/a^2+1/b^2+1/c^2-2(a^3+b^3+c^3)/abc$
Show that there exist infinitely many pairs $(a, b)$ of positive integers with the property that $a+b$ divides $ab+1$, $a-b$ divides $ab-1$, $b>1$ and $a>b\sqrt{3}-1$
The only prime factors of an integer $n$ are 2 and 3. If the sum of the divisors of $n$ (including itself) is $1815$, find $n$.
At a time $t = 0$, a navy ship is at a point $O$, while an enemy ship is at a point $A$ cruising with speed $v$ perpendicular to $OA = a$. The speed and direction of the enemy ship do not change. The strategy of the navy ship is to travel with constant speed $u$ at a angle $0 < \phi < \pi /2$ to the line $OA$.
1) Let $\phi$ be chosen. What is the minimum distance between the two ships? Under what conditions will the distance vanish?
2) If the distance does not vanish, what is the choice of $\phi$ to minimize the distance? What are directions of the two ships when their distance is minimum?
$$F(x)=x^{6}+15x^{5}+85x^{4}+225x^{3}+274x^{2}+120x+1$$
Let $k,m,n$ be natural numbers such that $m+k+1$ is a prime greater than $n+1$. Let $c_s=s(s+1)$. Prove that
\[(c_{m+1}-c_k)(c_{m+2}-c_k)\ldots(c_{m+n}-c_k)\]
is divisible by the product $c_1c_2\ldots c_n$.
When Andris entered the room, there were the numbers $3$ and $24$ on the board. In one step, if there are the (not necessarily different) numbers $k$ and $n$ on the board already, then Andris can write the number$ kn + k + n$ on the board, too.
a) Can Andris write the number $9999999$ on the board after a few moves?
b) What if he wants to get $99999999$?
c) And what about $48999999$?