Found problems: 85335
Consider a directed graph $G$ with $n$ vertices, where $1$-cycles and $2$-cycles are permitted. For any set $S$ of vertices, let $N^{+}(S)$ denote the out-neighborhood of $S$ (i.e. set of successors of $S$), and define $(N^{+})^k(S)=N^{+}((N^{+})^{k-1}(S))$ for $k\ge2$.
For fixed $n$, let $f(n)$ denote the maximum possible number of distinct sets of vertices in $\{(N^{+})^k(X)\}_{k=1}^{\infty}$, where $X$ is some subset of $V(G)$. Show that there exists $n>2012$ such that $f(n)<1.0001^n$.
[i]Linus Hamilton.[/i]
Let $P(x)$ be a polynomial with rational coefficients. Prove that there exists a positive integer $n$ such that the polynomial $Q(x)$ defined by
\[Q(x)= P(x+n)-P(x)\]
has integer coefficients.
Let $m$ and $n$ be positive integers, where $m < 2^n.$ Determine the smallest possible number of not necessarily pairwise distinct powers of two that add up to $m\cdot(2^n- 1).$
[i]The Problem Selection Committee[/i]
Exactly one number from the set $\{ -1,0,1 \}$ is written in each unit cell of a $2005 \times 2005$ table, so that the sum of all the entries is $0$. Prove that there exist two rows and two columns of the table, such that the sum of the four numbers written at the intersections of these rows and columns is equal to $0$.
Let $x_1,...,x_n$ be positive real numbers, satisfying $x_1+\dots+x_n=n$. Prove that
$\frac{x_1}{x_2}+\frac{x_2}{x_3}+\dots+\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}\leq\frac{4}{x_1\cdot x_2\cdot\dots\cdot x_n}+n-4$.
For a triangle $ ABC,$ let $ k$ be its circumcircle with radius $ r.$ The bisectors of the inner angles $ A, B,$ and $ C$ of the triangle intersect respectively the circle $ k$ again at points $ A', B',$ and $ C'.$ Prove the inequality
\[ 16Q^3 \geq 27 r^4 P,\]
where $ Q$ and $ P$ are the areas of the triangles $ A'B'C'$ and $ABC$ respectively.
Let $a,b,c,d$ be four positive real numbers. If they satisfy \[a+b+\frac{1}{ab}=c+d+\frac{1}{cd}\quad\text{and}\quad\frac1a+\frac1b+ab=\frac1c+\frac1d+cd\] then prove that at least two of the values $a,b,c,d$ are equal.
Determine all values of $n$ for which there is a set $S$ with $n$ points, with no 3 collinear, with the following property: it is possible to paint all points of $S$ in such a way that all angles determined by three points in $S$, all of the same color or of three different colors, aren't obtuse. The number of colors available is unlimited.
Let $ \clubsuit(x)$ denote the sum of the digits of the positive integer $ x$. For example, $ \clubsuit(8)\equal{}8$ and $ \clubsuit(123)\equal{}1\plus{}2\plus{}3\equal{}6$. For how many two-digit values of $ x$ is $ \clubsuit(\clubsuit(x))\equal{}3$?
$ \textbf{(A)}\ 3 \qquad
\textbf{(B)}\ 4 \qquad
\textbf{(C)}\ 6 \qquad
\textbf{(D)}\ 9 \qquad
\textbf{(E)}\ 10$
We consider a prism which has the upper and inferior basis the pentagons: $A_{1}A_{2}A_{3}A_{4}A_{5}$ and $B_{1}B_{2}B_{3}B_{4}B_{5}$. Each of the sides of the two pentagons and the segments $A_{i}B_{j}$ with $i,j=1,\ldots$,5 is colored in red or blue. In every triangle which has all sides colored there exists one red side and one blue side. Prove that all the 10 sides of the two basis are colored in the same color.
A boat is traveling upstream at 5 mph relative to the current flowing against it at 1 mph. If a tree branch 10 miles upstream from the boat falls into the current of the river, how many hours does it take to reach the boat?
Prove that $\mathbb R^{2}$ has a dense subset such that has no three collinear points.
Define a $ k$-[i]clique[/i] to be a set of $ k$ people such that every pair of them are acquainted with each other. At a certain party, every pair of 3-cliques has at least one person in common, and there are no 5-cliques. Prove that there are two or fewer people at the party whose departure leaves no 3-clique remaining.
A number N is inserted into the list 2, 6, 7, 7, 28. The mean is now twice as great as the median. What is N?
$\textbf{(A) } 7\qquad\textbf{(B) } 14\qquad\textbf{(C) } 20\qquad\textbf{(D) } 28\qquad\textbf{(E) } 34$
A non self-intersecting polygon is given in a Cartesian coordinate system such that its perimeter contains no lattice points, and its vertices have no integer coordinates. A point is called semi-integer if exactly one of its coordinates is an integer. Let $P_1, P_2,\ldots, P_k$ denote the semi-integer points on the perimeter of the polygon. Let ni denote the floor of the non-integer coordinate of $P_i$. Prove that integers $n_1,n_2,\ldots ,n_k$ can be divided into two groups with the same sum.
[i]Proposed by Áron Bán-Szabó, Budapest[/i]
The smaller angle between the hands of a clock at $ 12: 25$ p.m. is:
$ \textbf{(A)}\ 132^\circ 30' \qquad
\textbf{(B)}\ 137^\circ 30' \qquad
\textbf{(C)}\ 150^\circ \qquad
\textbf{(D)}\ 137^\circ 32' \qquad
\textbf{(E)}\ 137^\circ$
$I$ is incenter of triangle $ABC$. Incircle of $ABC$ touches $AB,AC$ at $X,Y$. $XI$ intersects incircle at $M$. Let $CM\cap AB=X'$. $L$ is a point on the segment $X'C$ that $X'L=CM$. Prove that $A,L,I$ are collinear iff $AB=AC$.
et $ABCDEF$ be a convex hexagon which has an inscribed circle and a circumcribed. Denote by $\omega_{A}, \omega_{B},\omega_{C},\omega_{D},\omega_{E}$ and $\omega_{F}$ the inscribed circles of the triangles $FAB, ABC, BCD, CDE, DEF$ and $EFA$, respecitively. Let $l_{AB}$, be the external of $\omega_{A}$ and $\omega_{B}$; lines $l_{BC}$, $l_{CD}$, $l_{DE}$, $l_{EF}$, $l_{FA}$ are analoguosly defined. Let $A_1$ be the intersection point of the lines $l_{FA}$ and $l_{AB}$, $B_1, C_1, D_1, E_1, F_1$ are analogously defined.
Prove that $A_1D_1, B_1E_1, C_1F_1$ are concurrent.
Let $I$ be the incenter of $ABC$ and $I_A$ the excenter of the side $BC$, let $M$ be the midpoint of $CB$ and $N$ the midpoint of arc $BC$(with the point $A$). If $T$ is the symmetric of the point $N$ by the point $A$, prove that the quadrilateral $I_AMIT$ is cyclic.
The vertices of 100-gon (i.e., polygon with 100 sides) are colored alternately white or black. One of the vertices contains a checker. Two players in turn do two things: move the checker into other vertice along the side of 100-gon and then erase some side. The game ends when it is impossible to move the checker. At the end of the game if the checker is in the white vertice then the first player wins. Otherwise the second player wins. Does any of the players have winning strategy? If yes, then who?
[i]Remark.[/i] The answer may depend on initial position of the checker.
Solve the following equation in natural numbers:
\begin{align*}
x^2=2^y+2021^z
\end{align*}
For how many positive integers $n$ less than or equal to $1000$ is \[(\sin t + i \cos t)^n=\sin nt + i \cos nt\] true for all real $t$?
Find the number of lattice points that the line $19x+20y=1909$ passes through in Quadrant I.
Let $P_0(x) = x^3 + 313x^2 - 77x - 8$. For integers $n \ge 1$, define $P_n(x) = P_{n - 1}(x - n)$. What is the coefficient of $x$ in $P_{20}(x)$?
The polygon $M{}$ is bicentric. The polygon $P{}$ has vertices at the points of contact of the sides of $M{}$ with the inscribed circle. The polygon $Q{}$ is formed by the external bisectors of the angles of $M{}.$ Prove that $P{}$ and $Q{}$ are homothetic.