Found problems: 85335
Let $r, s$, and $t$ be the three roots of the equation $8x^3 + 1001x + 2008 = 0$. Find $(r + s)^3 + (s + t)^3 + (t + r)^3$ .
Alice has a map of Wonderland, a country consisting of $n \geq 2$ towns. For every pair of towns, there is a narrow road going from one town to the other. One day, all the roads are declared to be “one way” only. Alice has no information on the direction of the roads, but the King of Hearts has offered to help her. She is allowed to ask him a number of questions. For each question in turn, Alice chooses a pair of towns and the King of Hearts tells her the direction of the road connecting those two towns.
Alice wants to know whether there is at least one town in Wonderland with at most one outgoing road. Prove that she can always find out by asking at most $4n$ questions.
A function $ f: R^3\rightarrow R$ for all reals $ a,b,c,d,e$ satisfies a condition:
\[ f(a,b,c)\plus{}f(b,c,d)\plus{}f(c,d,e)\plus{}f(d,e,a)\plus{}f(e,a,b)\equal{}a\plus{}b\plus{}c\plus{}d\plus{}e\]
Show that for all reals $ x_1,x_2,\ldots,x_n$ ($ n\geq 5$) equality holds:
\[ f(x_1,x_2,x_3)\plus{}f(x_2,x_3,x_4)\plus{}\ldots \plus{}f(x_{n\minus{}1},x_n,x_1)\plus{}f(x_n,x_1,x_2)\equal{}x_1\plus{}x_2\plus{}\ldots\plus{}x_n\]
There is located real number $f(A)$ in any point A on the plane. It's known that if $M$ will be centroid of triangle $ABC$ then $f(M)=f(A)+f(B)+f(C)$. Prove that $f(A)=0$ for all points A.
$a_1,a_2,\dots,a_k$ and $b_1,b_2,\dots,a_n$ are integer sequences with $a_1=b_1=0$, $a_k=26,b_n=25$, and $k+n=23$. It is known that $a_{i+1}-a_i=2\enspace\text{or}\enspace3$ and $b_{j+1}-b_j=2\enspace\text{or}\enspace3$ for all applicable $i$ and $j$, and the numbers $a_2,\dots,a_k,b_2,\dots,b_n$ are pairwise different. Determine the total number of such pairs of sequences.
Triangle $BCF$ has a right angle at $B$. Let $A$ be the point on line $CF$ such that $FA=FB$ and $F$ lies between $A$ and $C$. Point $D$ is chosen so that $DA=DC$ and $AC$ is the bisector of $\angle{DAB}$. Point $E$ is chosen so that $EA=ED$ and $AD$ is the bisector of $\angle{EAC}$. Let $M$ be the midpoint of $CF$. Let $X$ be the point such that $AMXE$ is a parallelogram. Prove that $BD,FX$ and $ME$ are concurrent.
Is there an arithmetic sequence with
a. $2003$
b. infinitely many
terms such that each term is a power of a natural number with a degree greater than $1$?
Let $ABC$ be a triangle contained in one of the halfplanes determined by a line $r$. Points $A',B',C'$ are the reflections of $A,B,C$ in $r,$ respectively. Consider the line through $A'$ parallel to $BC$, the line through $B'$ parallel to $AC$ and the line through $C'$ parallel to $AB$. Show that these three lines have a common point.
Let $\Gamma$ be the maximum possible value of $a+3b+9c$ among all triples $(a,b,c)$ of positive real numbers such that
\[ \log_{30}(a+b+c) = \log_{8}(3a) = \log_{27} (3b) = \log_{125} (3c) .\]
If $\Gamma = \frac{p}{q}$ where $p$ and $q$ are relatively prime positive integers, then find $p+q$.
Let $a_1, a_2, \ldots, a_8$ be real numbers. Prove that
$$\sum_{i=1}^{8} \left( a_i^2 + a_i a_{i+2} \right) \geq \sum_{i=1}^{8} \left( a_i a_{i+1} + a_i a_{i+3} \right),$$
where the indices are taken modulo 8, i.e., $a_9 = a_1$, $a_{10} = a_2$, and $a_{11} = a_3$. In which cases does equality hold?
[i]Proposed by Vukašin Pantelić and Andrija Živadinović[/i]
Ankit, Box, and Clark are taking the tiebreakers for the geometry round, consisting of three problems. Problem $k$ takes each $k$ minutes to solve. If for any given problem there is a $\frac13$ chance for each contestant to solve that problem first, what is the probability that Ankit solves a problem first?
Let $n$ be a positive integer divisible by $4$. We consider the permutations $(a_1, a_2,...,a_n)$ of $(1,2,..., n)$ having the following property: for each j we have $a_i + j = n + 1$ where $i = a_j$ . Prove that there are exactly $\frac{ (\frac12 n)!}{(\frac14 n)!}$ such permutations.
Factor the polynomial $(a+b+c)^3- a^3 -b^3 -c^3$
Let $m$ be a positive integer. Find polynomials $P(x)$ with real coefficients such that $$(x-m)P(x+2023) = xP(x)$$
is satisfied for all real numbers $x.$
The sum $$\sum_{k=3}^{\infty} \frac{1}{k(k^4-5k^2+4)^2}$$ is equal to $\frac{m^2}{2n^2}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
$ABCD$ is a regular tetrahedron with side length $1$. Find the area of the cross section of $ABCD$ cut by the plane that passes through the midpoints of $AB$, $AC$, and $CD$.
A natural number is called [i]triangular[/i] if it may be presented in the form $\frac{n(n+1)}2$. Find all values of $a$ $(1\le a\le9)$ for which there exist a triangular number all digit of which are equal to $a$.
In a plane there is a triangle $ABC$. Line $AC$ is tangent to circle $c_A$ at point $C$ and circle $c_A$ passes through point $B$. Line $BC$ is tangent to circle $c_B$ at point $C$ and circle $c_B$ passes through point $A$. The second intersection point $S$ of circles $c_A$ and $c_B$ coincides with the incenter of triangle $ABC$. Prove that the triangle $ABC$ is equilateral.
Solve the equation $\frac{1}{\sin x}+\frac{1}{\cos x}=\frac 1p$ where $p$ is a real parameter.
Discuss for which values of $p$ the equation has at least one real solution and determine the number of solutions in $[0, 2\pi)$ for a given $p.$
Let $M = \{1, 2, \ldots, n\}$ and $\phi : M \to M$ be a bijection.
(i) Prove that there exist bijections $\phi_1, \phi_2 : M \to M$ such that $\phi_1 \cdot \phi_2 = \phi , \phi_1^2 =\phi_2^2=E$, where $E$ is the identity mapping.
(ii) Prove that the conclusion in (i) is also true if $M$ is the set of all positive integers.
In the plane, $2022$ points are chosen such that no three points lie on the same line. Each of the points is coloured red or blue such that each triangle formed by three distinct red points contains at least one blue point.
What is the largest possible number of red points?
[i]Proposed by Art Waeterschoot, Belgium[/i]
Some blue and red circular disks of identical size are packed together to form a triangle. The top level has one disk and each level has 1 more disk than the level above it. Each disk not at the bottom level touches two disks below it and its colour is blue if these two disks are of the same colour. Otherwise its colour is red.
Suppose the bottom level has 2048 disks of which 2014 are red. What is the colour of the disk at the top?
$ABC$ is a triangle: $A=(0,0)$, $B=(36,15)$ and both the coordinates of $C$ are integers. What is the minimum area $\triangle ABC$ can have?
$ \textbf{(A)}\ \frac{1}{2} \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ \frac{3}{2} \qquad\textbf{(D)}\ \frac{13}{2} \qquad\textbf{(E)}\ \text{there is no minimum} $
For n points \[ P_1;P_2;...;P_n \] in that order on a straight line. We colored each point by 1 in 5 white, red, green, blue, and purple. A coloring is called acceptable if two consecutive points \[ P_i;P_{i+1} (i=1;2;...n-1) \] is the same color or 2 points with at least one of 2 points are colored white. How many ways acceptable color?
Let $\overline{CH}$ be an altitude of $\triangle ABC$. Let $R$ and $S$ be the points where the circles inscribed in the triangles $ACH$ and $BCH$ are tangent to $\overline{CH}$. If $AB = 1995$, $AC = 1994$, and $BC = 1993$, then $RS$ can be expressed as $m/n$, where $m$ and $n$ are relatively prime integers. Find $m + n$