The roots of a monic cubic polynomial $p$ are positive real numbers forming a geometric sequence. Suppose that the sum of the roots is equal to $10$. Under these conditions, the largest possible value of $|p(-1)|$ can be written as $\frac{m}{n}$, where $m$, $n$ are relatively prime integers. Find $m + n$.

Let $ABC$ be an isosceles triangle with $AB=AC$ . Let also $\omega$ be a circle of center $K$ tangent to the line $AC$ at $C$ which intersects the segment $BC$ again at $H$ . Prove that $HK \bot AB $.

Find $\lim_{n\to\infty} \int_0^1 |\sin nx|^3dx\ (n=1,\ 2,\ \cdots).$ [i]2010 Kyoto Institute of Technology entrance exam/Textile, 2nd exam[/i]

The number devil has coloured the integer numbers: every integer is coloured either black or white. The number $1$ is coloured white. For every two white numbers $a$ and $b$ ($a$ and $b$ are allowed to be equal) the numbers $a-b$ and $a + $b have different colours. Prove that $2011$ is coloured white.

Petrică, Vasile and Tudor participated at a math contest. At the contest $ 5$ problems where proposed, each worth distinct integer numbers of points. Petrică solved $4$ problems completely and got $21$ points and Vasile solved $3 $ problems completely and got $22$ points. Tudor solved all problems completely. What are the lowest and highest possible scores of Tudor?

A graph consists of 6 vertices. For each pair of vertices, a coin is flipped, and an edge connecting the two vertices is drawn if and only if the coin shows heads. Such a graph is $\it{good}$ if, starting from any vertex $V$ connected to at least one other vertex, it is possible to draw a path starting and ending at $V$ that traverses each edge exactly once. What is the probability that the graph is good?

Points $A, B$, and $C$ lie on a circle with centre $M$. The reflection of point $M$ in the line $AB$ lies inside triangle $ABC$ and is the intersection of the angle bisectors of angles $A$ and $B$. Line $AM$ intersects the circle again in point $D$. Show that $|CA| \cdot |CD| = |AB| \cdot |AM|$.

For every four points $P_{1},P_{2},P_{3},P_{4}$ on the plane, find the minimum value of $\frac{\sum_{1\le\ i<j\le\ 4}P_{i}P_{j}}{\min_{1\le\ i<j\le\ 4}(P_{i}P_{j})}$.

Find the least real number $K$ such that for all real numbers $x$ and $y$, we have $(1 + 20 x^2)(1 + 19 y^2) \ge K xy$.

Kevin writes a nonempty subset of $S = \{ 1, 2, \dots 41 \}$ on a board. Each day, Evan takes the set last written on the board and decreases each integer in it by $1.$ He calls the result $R.$ If $R$ does not contain $0$ he writes $R$ on the board. If $R$ contains $0$ he writes the set containing all elements of $S$ not in $R$. On Evan's $n$th day, he sees that he has written Kevin's original subset for the $1$st time. Find the sum of all possible $n.$

For $n \in \mathbb N$, let $f(n)$ be the number of positive integers $k \leq n$ that do not contain the digit $9$. Does there exist a positive real number $p$ such that $\frac{f(n)}{n} \geq p$ for all positive integers $n$?

Among the spatial points $ A,B,C,D, $ at most two of are aparted at a distance greater than $ 1. $ Find the the maximum value of the expression: $$ g(A,B,C,D) =AB+BC+ AD+CA+DB+DC. $$

In the plane, there are $n \geqslant 6$ pairwise disjoint disks $D_{1}, D_{2}, \ldots, D_{n}$ with radii $R_{1} \geqslant R_{2} \geqslant \ldots \geqslant R_{n}$. For every $i=1,2, \ldots, n$, a point $P_{i}$ is chosen in disk $D_{i}$. Let $O$ be an arbitrary point in the plane. Prove that \[O P_{1}+O P_{2}+\ldots+O P_{n} \geqslant R_{6}+R_{7}+\ldots+R_{n}.\] (A disk is assumed to contain its boundary.)

Astrophysicists have discovered a minor planet of radius $30$ kilometers whose surface is completely covered in water. A spherical meteor hits this planet and is submerged in the water. This incidence causes an increase of $1$ centimeters to the height of the water on this planet. What is the radius of the meteor in meters?

Prove that the set of all divisors of a positive integer which is not a perfect square can be divided into pairs so that in each pair, one number is divided by another.

There are $1001$ red marbles and $1001$ black marbles in a box. Let $P_s$ be the probability that two marbles drawn at random from the box are the same color, and let $P_d$ be the probability that they are different colors. Find $|P_s-P_d|$. $\textbf{(A) }0\qquad\textbf{(B) }\dfrac1{2002}\qquad\textbf{(C) }\dfrac1{2001}\qquad\textbf{(D) }\dfrac2{2001}\qquad\textbf{(E) }\dfrac1{1000}$

[b]p1.[/b] A light beam shines from the origin into the unit square at an angle of $\theta$ to one of the sides such that $\tan \theta = \frac{13}{17}$ . The light beam is reflected by the sides of the square. How many times does the light beam hit a side of the square before hitting a vertex of the square? [img]https://cdn.artofproblemsolving.com/attachments/5/7/1db0aad33ed9bf82bee3303c7fbbe0b7c2574f.png[/img] [b]p2.[/b] Alex is given points $A_1,A_2,...,A_{150}$ in the plane such that no three are collinear and $A_1$, $A_2$, $...$, $A_{100}$ are the vertices of a convex polygon $P$ containing $A_{101}$, $A_{102}$, $ ...$, $A_{150}$ in its interior. He proceeds to draw edges $A_iA_j$ such that no two edges intersect (except possibly at their endpoints), eventually dividing $P$ up into triangles. How many triangles are there? [img]https://cdn.artofproblemsolving.com/attachments/d/5/12c757077e87809837d16128b018895a8bcc94.png[/img] [b]p3. [/b]The polynomial P(x) has the property that $P(1)$, $P(2)$, $P(3)$, $P(4)$, and $P(5)$ are equal to $1$, $2$, $3$, $4$,$5$ in some order. How many possibilities are there for the polynomial $P$, given that the degree of $P$ is strictly less than $4$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$ and $b$ be real numbers from interval $\left[0,\frac{\pi}{2}\right]$. Prove that $$\sin^6 {a}+3\sin^2 {a}\cos^2 {b}+\cos^6 {b}=1$$ if and only if $a=b$

A square $ (n \minus{} 1) \times (n \minus{} 1)$ is divided into $ (n \minus{} 1)^2$ unit squares in the usual manner. Each of the $ n^2$ vertices of these squares is to be coloured red or blue. Find the number of different colourings such that each unit square has exactly two red vertices. (Two colouring schemse are regarded as different if at least one vertex is coloured differently in the two schemes.)

An eighth degree polynomial funtion $ y \equal{} ax^8 \plus{} bx^7 \plus{} cx^6 \plus{} dx^5 \plus{} ex^4 \plus{} fx^3 \plus{} gx^2\plus{}hx\plus{}i\ (a\neq 0)$ touches the line $ y \equal{} px \plus{} q$ at $ x \equal{} \alpha ,\ \beta ,\ \gamma ,\ \delta \ (\alpha < \beta < \gamma <\delta).$ Find the area of the region bounded by these graphs in terms of $ a,\ \alpha ,\ \beta ,\gamma ,\ \delta .$

If $A$ is the $3\times 3$ square matrix $\begin{bmatrix} 5 & 3 & 8\\ 2 & 2 & 5\\ 3 & 5 & 1 \end{bmatrix}$ and $B$ is the $4\times 4$ square matrix $\begin{bmatrix} 32 & 2 & 4 & 3 \\ 3 & 4 & 8 & 3 \\ 11 & 3 & 6 & 1 \\ 5 & 5 & 10 & 1 \end{bmatrix} $ find the sum of the determinants of $A$ and $B$.

Peter's family ordered a 12-slice pizza for dinner. Peter ate one slice and shared another slice equally with his brother Paul. What fraction of the pizza did Peter eat? $\textbf{(A)}\hspace{.05in} \dfrac1{24}\qquad \textbf{(B)}\hspace{.05in}\dfrac1{12} \qquad \textbf{(C)}\hspace{.05in}\dfrac18 \qquad \textbf{(D)}\hspace{.05in}\dfrac16 \qquad \textbf{(E)}\hspace{.05in}\dfrac14 $

A sequence $(a_{n})$ is defined by $a_{1}= 1$ and $a_{n}= a_{1}a_{2}...a_{n-1}+1$ for $n \geq 2.$ Find the smallest real number $M$ such that $\sum_{n=1}^{m}\frac{1}{a_{n}}<M\; \forall m\in\mathbb{N}$.

Let $\mathbb{N}^*$ be the set of positive integers. Define $a_1=2$, and for $n=1, 2, \ldots,$\[ a_{n+1}=\min\{\lambda|\frac{1}{a_1}+\frac{1}{a_2}+\cdots\frac{1}{a_n}+\frac{1}{\lambda}<1,\lambda\in \mathbb{N}^*\}\] Prove that $a_{n+1}=a_n^2-a_n+1$ for $n=1,2,\ldots$.

Positive sequences $\{a_n\},\{b_n\}$ satisfy:$a_1=b_1=1,b_n=a_nb_{n-1}-\frac{1}{4}(n\geq 2)$. Find the minimum value of $4\sqrt{b_1b_2\cdots b_m}+\sum_{k=1}^m\frac{1}{a_1a_2\cdots a_k}$,where $m$ is a given positive integer.