Found problems: 85335
Let $f(x)=x^{n}+5x^{n-1}+3$, where $n>1$ is an integer. Prove that $f(x)$ cannot be expressed as the product of two nonconstant polynomials with integer coefficients.
Let $n$ be a positive integer. We know that the set $I_n = \{ 1, 2,\ldots , n\}$ has exactly $2^n$ subsets, so there are $8^n$ ordered triples $(A, B, C)$, where $A, B$, and $C$ are subsets of $I_n$. For each of these triples we consider the number $\mid A \cap B \cap C\mid$. Prove that the sum of the $8^n$ numbers considered is a multiple of $n$. Clarification: $\mid Y\mid$ denotes the number of elements in the set $Y$.
Which one divides $2^{2^{2010}}+2^{2^{2009}}+1$?
$ \textbf{(A)}\ 19
\qquad\textbf{(B)}\ 17
\qquad\textbf{(C)}\ 13
\qquad\textbf{(D)}\ 11
\qquad\textbf{(E)}\ \text{None}
$
Solve the following equation in the set of integer numbers:
\[ x^{2010}-2006=4y^{2009}+4y^{2008}+2007y. \]
(a) Two players take turns taking $1, 2$ or $3$ stones at random from a given set of $3$ piles, in which initially on $11, 22$ and $33$ stones. If after the move of one of the players in any two groups the same number of stones will remain, this player has won. Who will win with the right game of both players?
(b) Two players take turns taking $1$ or $2$ stones from one pile, randomly selected from a given set of $3$ ordered piles, in which at first $100, 200$ and $300$ stones, in order from left to right. Additionally it is forbidden to make a course at which, for some pair of the next handfuls, quantity of stones in the left will be more than the number of stones in the right. If after the move of one of the players of the stones in handfuls will not remain, then this player won. Who will win with the right game of both players?
[hide=original wording]
1. Два гравця по черзi беруть 1, 2 чи 3 камiнця довiльним чином з заданого набору з 3 купок, в
яких спочатку по 11, 22 i 33 камiнцiв. Якщо пiсля хода одного з гравцiв в якихось двух купках
залишиться однакова кiлькiсть камiнцiв, то цей гравець виграв. Хто виграє при правильнiй грi обох
гравцiв?
2. Два гравця по черзi беруть 1 чи 2 камiнця з одної купки, довiльної вибраної з заданого набору
з 3 впорядкованих купок, в яких спочатку по 100, 200 i 300 камiнцiв, в порядку злiва направо.
Додатково забороняется робити ход при якому, для деякої пари сусiднiх купок, кiлькiсть камiнцiв в
лiвiй стане бiльше нiж кiлькiсть камiнцiв в правiй. Якщо пiсля ходу одного з гравцiв камiнцiв в
купках не залишиться, то цей гравець виграв. Хто виграє при правильнiй грi обох гравцiв?[/hide]
Let $a, b$ be positive integers such that $54^a=a^b$. Prove that $a$ is a power of $54$.
A rectangle with integer side lengths has the property that its area minus $5$ times its perimeter equals $2023$. Find the minimum possible perimeter of this rectangle.
(A. Myakishev, 8--9) In the plane, given two concentric circles with the center $ A$. Let $ B$ be an arbitrary point on some of these circles, and $ C$ on the other one. For every triangle $ ABC$, consider two equal circles mutually tangent at the point $ K$, such that one of these circles is tangent to the line $ AB$ at point $ B$ and the other one is tangent to the line $ AC$ at point $ C$. Determine the locus of points $ K$.
Say that a function $f : \{1, 2, . . . , 1001\} \to Z$ is [i]almost [/i] polynomial if there is a polynomial $p(x) = a_{200}x^{200} +... + a_1x + a_0$ such that each an is an integer with $|a_n| \le 201$, and such that $|f(x) - p(x)| \le 1$ for all $x \in \{1, 2, . . . , 1001\}$. Let $N$ be the number of almost polynomial functions. Compute the remainder upon dividing $N$ by $199$.
Evaluate
\[\int_{\frac{\pi}{4}}^{\frac{\pi}{2}} \frac{(1+\cos x)\{1-\tan ^ 2 \frac{x}{2}\tan (x+\sin x)\tan (x-\sin x)\}}{\tan (x+\sin x)}\ dx\]
Let $a,b,c$ be positive reals satisfying $a^3+b^3+c^3+abc=4$. Prove that
\[ \frac{(5a^2+bc)^2}{(a+b)(a+c)} + \frac{(5b^2+ca)^2}{(b+c)(b+a)} + \frac{(5c^2+ab)^2}{(c+a)(c+b)} \ge \frac{(a^3+b^3+c^3+6)^2}{a+b+c} \] and determine the cases of equality.
[i]Proposed by Evan Chen[/i]
Let $x_1=1/20$, $x_2=1/13$, and \[x_{n+2}=\dfrac{2x_nx_{n+1}(x_n+x_{n+1})}{x_n^2+x_{n+1}^2}\] for all integers $n\geq 1$. Evaluate $\textstyle\sum_{n=1}^\infty(1/(x_n+x_{n+1}))$.
Determine all (not necessarily finite) sets $S$ of points in the plane such that given any four distinct points in $S$, there is a circle passing through all four or a line passing through some three.
[i]Carl Lian.[/i]
Let $ABC$ be a triangle with $AB = AC \neq BC$ and let $I$ be its incentre. The line $BI$ meets $AC$ at $D$, and the line through $D$ perpendicular to $AC$ meets $AI$ at $E$. Prove that the reflection of $I$ in $AC$ lies on the circumcircle of triangle $BDE$.
How many rectangles are there in the diagram below such that the sum of the numbers within the rectangle is a multiple of 7?
[asy]
int n;
n=0;
for (int i=0; i<=7;++i)
{
draw((i,0)--(i,7));
draw((0,i)--(7,i));
for (int a=0; a<=7;++a)
{
if ((a != 7)&&(i != 7))
{
n=n+1;
label((string) n,(a,i),(1.5,2));
}
}
}
[/asy]
Suppose that the differentiable functions $a, b, f, g:\mathbb{R} \rightarrow \mathbb{R} $ satisfy
\[ f(x)\geq 0, f'(x) \geq 0,g(x)\geq 0, g'(x) \geq 0 \text{ for all } x \in \mathbb{R}, \]
\[\lim_{x\rightarrow \infty} a(x)=A\geq 0,\lim_{x\rightarrow \infty} b(x)=B\geq 0, \lim_{x\rightarrow \infty} f(x)=\lim_{x\rightarrow \infty} g(x)=\infty,\]
and
\[\frac{f'(x)}{g'(x)}+a(x)\frac{f(x)}{g(x)}=b(x).\]
Prove that $\lim_{x\rightarrow\infty}\frac{f(x)}{g(x)}=\frac{B}{A+1}$.
Alice and Bob play a game on a circle with 8 marked points. Alice places an apple beneath one of the points, then picks five of the other seven points and reveals that none of them are hiding the apple. Bob then drops a bomb on any of the points, and destroys the apple if he drops the bomb either on the point containing the apple or on an adjacent point. Bob wins if he destroys the apple, and Alice wins if he fails. If both players play optimally, what is the probability that Bob destroys the apple?
What is the value of the series $\sum_{1 \leq l <m<n} \frac{1}{5^l3^m2^n}$
The sequence an of non-zero reals satisfies $a_n^2 - a_{n-1}a_{n+1} = 1$ for $n \geq 1$. Prove that there exists a real number $\alpha$ such that $a_{n+1} = \alpha a_n - a_{n-1}$ for $n \geq 1$.
Equilateral $\triangle ABC$ has side length $1$, and squares $ABDE$, $BCHI$, $CAFG$ lie outside the triangle. What is the area of hexagon $DEFGHI$?
[asy]
import graph;
size(6cm);
pen dps = linewidth(0.7) + fontsize(8); defaultpen(dps);
pair B = (0,0);
pair C = (1,0);
pair A = rotate(60,B)*C;
pair E = rotate(270,A)*B;
pair D = rotate(270,E)*A;
pair F = rotate(90,A)*C;
pair G = rotate(90,F)*A;
pair I = rotate(270,B)*C;
pair H = rotate(270,I)*B;
draw(A--B--C--cycle);
draw(A--E--D--B);
draw(A--F--G--C);
draw(B--I--H--C);
draw(E--F);
draw(D--I);
draw(I--H);
draw(H--G);
label("$A$",A,N);
label("$B$",B,SW);
label("$C$",C,SE);
label("$D$",D,W);
label("$E$",E,W);
label("$F$",F,E);
label("$G$",G,E);
label("$H$",H,SE);
label("$I$",I,SW);
[/asy]
$ \textbf{(A)}\ \dfrac{12+3\sqrt3}4\qquad\textbf{(B)}\ \dfrac92\qquad\textbf{(C)}\ 3+\sqrt3\qquad\textbf{(D)}\ \dfrac{6+3\sqrt3}2\qquad\textbf{(E)}\ 6 $
Senators Sernie Banders and Cedric "Ced" Truz of OMOrica are running for the office of Price Dent. The election works as follows: There are $66$ states, each composed of many adults and $2017$ children, with only the latter eligible to vote. On election day, the children each cast their vote with equal probability to Banders or Truz. A majority of votes in the state towards a candidate means they "win" the state, and the candidate with the majority of won states becomes the new Price Dent. Should both candidates win an equal number of states, then whoever had the most votes cast for him wins.
Let the probability that Banders and Truz have an unresolvable election, i.e., that they tie on both the state count and the popular vote, be $\frac{p}{q}$ in lowest terms, and let $m, n$ be the remainders when $p, q$, respectively, are divided by $1009$. Find $m + n$.
[i]Proposed by Ashwin Sah[/i]
A finite set $S$ of positive integers is given. Show that there is a positive integer $N$ dependent only on $S$, such that any $x_1, \dots, x_m \in S$ whose sum is a multiple of $N$, can be partitioned into groups each of whose sum is exactly $N$. (The numbers $x_1, \dots, x_m$ need not be distinct.)
Let $A$ be a set of positive integers such that for any two distinct elements $x, y\in A$ we have $|x-y| \geq \frac{xy}{25}.$ Prove that $A$ contains at most nine elements. Give an example of such a set of nine elements.
A triangular piece of sheet metal weighs $900$ g. Prove that by cutting this sheet metal along a straight line passing through the center of gravity of the triangle, it is impossible to cut off a piece weighing less than $400$ g.
Positive integers $m,n,k$ satisfy $1+2+3++...+n=mk$ and $m \ge n$.
Show that we can partite $\{1,2,3,...,n \}$ into $k$ subsets (Every element belongs to exact one of these $k$ subsets), such that the sum of elements in each subset is equal to $m$.