Found problems: 85335
There were $n{}$ positive integers. For each pair of those integers Boris wrote their arithmetic mean onto a blackboard and their geometric mean onto a whiteboard. It so happened that for each pair at least one of those means was integer. Prove that on at least one of the boards all the numbers are integer.
[i]Boris Frenkin[/i]
For certain real values of $a, b, c,$ and $d,$ the equation $x^4+ax^3+bx^2+cx+d=0$ has four non-real roots. The product of two of these roots is $13+i$ and the sum of the other two roots is $3+4i,$ where $i=\sqrt{-1}.$ Find $b.$
The bisectors $AA_1$ and $CC_1$ of triangle $ABC$ intersect at point $I$. The circumscribed circles of triangles $AIC_1$ and $CIA_1$ intersect the arcs $AC$ and $BC$ (not containing points $B$ and $A$ respectively) of the circumscribed circle of triangle $ABC$ at points $C_2$ and $A_2$, respectively. Prove that lines $A_1A_2$ and $C_1C_2$ intersect on the circumscribed circle of triangle $ABC$.
Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ that satisfy $$(f(a)-f(b))(f(b)-f(c))(f(c)-f(a)) = f(ab^2+bc^2+ca^2) - f(a^2b+b^2c+c^2a)$$for all real numbers $a$, $b$, $c$.
[i]Proposed by Ankan Bhattacharya, USA[/i]
Jesse cuts a circular paper disk of radius $12$ along two radii to form two sectors, the smaller having a central angle of $120$ degrees. He makes two circular cones, using each sector to form the lateral surface of a cone. What is the ratio of the volume of the smaller cone to that of the larger?
$ \textbf{(A)}\ \frac{1}{8} \qquad\textbf{(B)}\ \frac{1}{4} \qquad\textbf{(C)}\ \frac{\sqrt{10}}{10} \qquad\textbf{(D)}\ \frac{\sqrt{5}}{6} \qquad\textbf{(E)}\ \frac{\sqrt{10}}{5} $
A rectangular piece of paper is divided into square cells by lines parallel to the sides of the rectangle. $n$ (horizontal) rows of $m$ cells have emerged and $m$ (vertical) columns of $n$ cells have also been formed. There is a number in each cell. Find the largest number in each of the $n$ rows. The smallest maxima of those $n$ rows is called $A$. We also look for the smallest number in each of the $m$ columns. The largest minima of those $m$ columns is called $B$.
Prove that $A$ is greater than or equal to $B$. Can you give a simple example where $A = B$?
Let $ABC$ be a triangle with $AB=20, AC=21,$ and $\angle BAC = 90^{\circ}.$ Suppose $\Gamma_1$ is the unique circle centered at $B$ and passing through $A,$ and $\Gamma_2$ is the unique circle centered at $C$ and passing through $A.$ Points $E$ and $F$ are selected on $\Gamma_1$ and $\Gamma_2,$ respectively, such that $E, A, F$ are collinear in that order. The tangent to $\Gamma_1$ at $E$ and the tangent to $\Gamma_2$ at $F$ intersect at $P$. Given that $PA \bot BC$, compute the area of $PBC$.
On a $123 \times 123$ board, each square is painted red or blue according to the following conditions:
a) Each square painted red that is not on the edge of the board has exactly $5$ blue squares among its $8$ neighboring squares.
b) Each square painted blue that is not on the edge of the board has exactly $4$ red squares among its $8$ neighboring squares.
Determine the number of red-painted squares on the board.
In a village (where only dwarfs live) there are $k$ streets, and there are $k(n-1)+1$ clubs each containing $n$ dwarfs. A dwarf can be in more than one clubs, and two dwarfs know each other if they live in the same street or they are in the same club (there is a club they are both in).
Prove that is it possible to choose $n$ different dwarfs from $n$ different clubs (one dwarf from each club), such that the $n$ dwarfs know each other!
The triangle $ABC$ has angle $A = 30^o$ and $AB = \frac{3}{4} AC$. Find the point $P$ inside the triangle which minimizes $5 PA + 4 PB + 3 PC$.
Given: point $ A $, line $ p $, and circle $ k $. Construct a triangle $ ABC $ with angles $ A = 60^\circ $, $ B = 90^\circ $, whose vertex $ B $ lies on line $ p $, and vertex $ C $ - on circle $ k $.
There are $2001$ marked points in the plane. It is known that the area of any triangle with vertices at the given points is less than or equal than $1 \ cm^2$. Prove that there exists a triangle with area no more than $4 \ cm^2$, which contains all $2001$ points.
For $a,b,c,d>0$ prove that $$\frac {a+\sqrt{ab}+\sqrt[3]{abc}+\sqrt[4]{abcd}}{4} \leq \sqrt[4]{a.\frac{a+b}{2}.\frac{a+b+c}{3}.\frac{a+b+c+d}{4}}$$
Consider a cyclic quadrilateral $ABCD$, and let $S$ be the intersection of $AC$ and $BD$.
Let $E$ and $F$ the orthogonal projections of $S$ on $AB$ and $CD$ respectively.
Prove that the perpendicular bisector of segment $EF$ meets the segments $AD$ and $BC$ at their midpoints.
Alice and Bianca have one hundred marbles. At the start of the game they split these hundred marbles into two piles. Thereafter, a move consists of choosing a pile, then choosing a positive integer not larger than half of the number of marbles in that pile, and finally removing that number of marbles from the chosen pile. The first player unable to remove any marbles loses. Alice makes the first move of the game. Determine all initial pile sizes for which Bianca has a winning strategy.
Let $ABCD$ be a cyclic quadrilateral and let $K,L,M,N,S,T$ the midpoints of $AB, BC, CD, AD, AC, BD$ respectively. Prove that the circumcenters of $KLS, LMT, MNS, NKT$ form a cyclic quadrilateral which is similar to $ABCD$.
A regular hexagon with sides of length $6$ has an isosceles triangle attached to each side. Each of these triangles has two sides of length $8$. The isosceles triangles are folded to make a pyramid with the hexagon as the base of the pyramid. What is the volume of the pyramid?
$\textbf{(A) }18\qquad\textbf{(B) }162\qquad\textbf{(C) }36\sqrt{21}\qquad\textbf{(D) }18\sqrt{138}\qquad\textbf{(E) }54\sqrt{21}$
Tao plays the following game:given a constant $v>1$;for any positive integer $m$,the time between the $m^{th}$ round and the $(m+1)^{th}$ round of the game is $2^{-m}$ seconds;Tao chooses a circular safe area whose radius is $2^{-m+1}$ (with the border,and the choosing time won't be calculated) on the plane in the $m^{th}$ round;the chosen circular safe area in each round will keep its center fixed,and its radius will decrease at the speed $v$ in the rest of the time(if the radius decreases to $0$,erase the circular safe area);if it's possible to choose a circular safe area inside the union of the rest safe areas sometime before the $100^{th}$ round(including the $100^{th}$ round),then Tao wins the game.If Tao has a winning strategy,find the minimum value of $\biggl\lfloor\frac{1}{v-1}\biggr\rfloor$.
When a function $f(x)$ is differentiated $n$ times ,the function we get id denoted $f^n(x)$.If $f(x)=\dfrac {e^x}{x}$.Find the value of
\[\lim_{n \to \infty} \dfrac {f^ {2n}(1)}{(2n)!}\]
Find the remainder when \[9 \times 99 \times 999 \times \cdots \times \underbrace{99\cdots9}_{\text{999 9's}}\] is divided by $ 1000$.
For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$
(a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$
(b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$
[I]United Kingdom[/i]
Can a figure have a greater than $1$ and finite number of centers of symmetry?
Determine a polynomial of non-negative real coefficients that satisfies the following two conditions:
$$p(0) = 0, p(|z|) \le x^4 + y^4,$$
being $|z|$ the module of the complex number $z = x + iy$ .
Given a (simple) graph $G$ with $n \geq 2$ vertices $v_1, v_2, \dots, v_n$ and $m \geq 1$ edges, Joël and Robert play the following game with $m$ coins:
[list=i]
[*]Joël first assigns to each vertex $v_i$ a non-negative integer $w_i$ such that $w_1+\cdots+w_n=m$.
[*]Robert then chooses a (possibly empty) subset of edges, and for each edge chosen he places a coin on exactly one of its two endpoints, and then removes that edge from the graph. When he is done, the amount of coins on each vertex $v_i$ should not be greater than $w_i$.
[*]Joël then does the same for all the remaining edges.
[*]Joël wins if the number of coins on each vertex $v_i$ is equal to $w_i$.
[/list]
Determine all graphs $G$ for which Joël has a winning strategy.
In the coordinate space, define a square $S$, defined by the inequality $|x|\leq 1,\ |y|\leq 1$ on the $xy$-plane, with four vertices $A(-1,\ 1,\ 0),\ B(1,\ 1,\ 0),\ C(1,-1,\ 0), D(-1,-1,\ 0)$. Let $V_1$ be the solid by a rotation of the square $S$ about the line $BD$ as the axis of rotation, and let $V_2$ be the solid by a rotation of the square $S$ about the line $AC$ as the axis of rotation.
(1) For a real number $t$ such that $0\leq t<1$, find the area of cross section of $V_1$ cut by the plane $x=t$.
(2) Find the volume of the common part of $V_1$ and $V_2$.