Found problems: 85335
Prove that a positive integer $A$ is a perfect square if and only if, for all positive integers $n$, at least one of the numbers $(A + 1)^2 - A, (A + 2)^2 - A, (A + 3)^2 - A,.., (A + n)^2- A$ is a multiple of $n$.
Determine all functions $ f$ defined on the set of rational numbers that take rational values for which
\[ f(2f(x) \plus{} f(y)) \equal{} 2x \plus{} y,
\]
for each $ x$ and $ y$.
Let $S = \{1,2,3,4,5\}$. Find the number of functions $f : S \to S$ such that $f ^{50}(x)= x$ for all $x \in S$.
Show that there are an infinity of positive integers $n$ such that $2^{n}+3^{n}$ is divisible by $n^{2}$.
Let $a, b, c$ be positive real numbers such that $ab +be + ba \le 3abc$. Prove that
$$a^3+b^3+c^3 \ge a+b+c.$$
The sequence $ (a_n)$ satisfies $ a_0 \equal{} 0$ and $ \displaystyle a_{n \plus{} 1} \equal{} \frac85a_n \plus{} \frac65\sqrt {4^n \minus{} a_n^2}$ for $ n\ge0$. Find the greatest integer less than or equal to $ a_{10}$.
Let $A$ be an Abelian group with $n$ elements. Prove that there are two subgroups in $\text{GL}(n,\Bbb{C})$, isomorphic to $S_n$, whose intersection is isomorphic to the automorphism group of $A$.
[i]Proposed by Zoltán Halasi[/i]
Let $ f$ be a strictly increasing, continuous function mapping $ I=[0,1]$ onto itself. Prove that the following inequality holds for all pairs $ x,y \in I$: \[ 1-\cos (xy) \leq \int_0^xf(t) \sin (tf(t))dt + \int_0^y f^{-1}(t) \sin (tf^{-1}(t)) dt .\]
[i]Zs. Pales[/i]
The golden ratio $\phi = \frac{1+\sqrt5}{2}$ satisfies the property $\phi^2 =\phi + 1$. Point $P$ lies inside equilateral triangle $\vartriangle ABC$ such that $PA = \phi$, $PB = 2$, and angle $\angle APC$ measures $150$ degrees. What is the measure of $\angle BPC$ in degrees?
Two equally oriented regular $2n$-gons $A_1A_2\ldots A_{2n}$ and $B_1B_2\ldots B_{2n}$ are given. The perpendicular bisectors $\ell_i$ of the segments $A_iB_i$ are drawn. Let the lines $\ell_i$ and $\ell_{i+1}$ intersect at the point $K_i$ (hereafter we reduce indices modulo $2n$). Denote by $m_i$ the line $K_iK_{i+n}$. Prove that $n{}$ lines $m_i$ intersect at one point and at that the angles between the lines $m_i$ and $m_{i+1}$ are equal.
[i]Proposed by Chan Quang Hung (Vietnam)[/i]
We deal $n-1$ cards in some way to $n$ people sitting around a table. From then on, in one move a person with at least $2$ cards gives one card to each of his/her neighbors. Prove that eventually a state will be reached where everyone has at most one card.
If the arithmetic mean of two numbers is $6$ and thier geometric mean is $10$, then an equation with the given two numbers as roots is:
$\text{(A)} \ x^2+12x+100=0 ~~ \text{(B)} \ x^2+6x+100=0 ~~ \text{(C)} \ x^2-12x-10=0$
$\text{(D)} \ x^2-12x+100=0 \qquad \text{(E)} \ x^2-6x+100=0$
Consider $x_1,\ldots,x_n>0$. Show that there exists $a_1,a_2,\ldots,a_n\in \{-1,1\}$ such that
\[a_1x_1^2+a_2x_2^2+\ldots +a_nx_n^2\geqslant (a_1x_1+a_2x_2+\ldots +a_nx_n)^2.\]
[i]Laurențiu Panaitopol[/i]
In a given arithmetic sequence the first term is $2$, the last term is $29$, and the sum of all the terms is $155$. The common difference is:
$\text{(A)} \ 3 \qquad \text{(B)} \ 2 \qquad \text{(C)} \ \frac{27}{19} \qquad \text{(D)} \ \frac{13}9 \qquad \text{(E)} \ \frac{23}{38}$
Let $ABCD$ be a fixed square and $K$ a variable point on segment $AD$. The square $KLMN$ is constructed such that $B$ is on segment $LM$ and $C$ is on segment $MN$. Let $T$ be the intersection point of lines $LA$ and $ND$. Find the locus of $T$ as $K$ varies along segment $AD$.
Let $ABCD$ be a square with side length $2$, and let a semicircle with flat side $CD$ be drawn inside the square. Of the remaining area inside the square outside the semi-circle, the largest circle is drawn. What is the radius of this circle?
For a certain complex number $c$, the polynomial
\[ P(x) = (x^2 - 2x + 2)(x^2 - cx + 4)(x^2 - 4x + 8)\]
has exactly 4 distinct roots. What is $|c|$?
$\textbf{(A) } 2 \qquad \textbf{(B) } \sqrt{6} \qquad \textbf{(C) } 2\sqrt{2} \qquad \textbf{(D) } 3 \qquad \textbf{(E) } \sqrt{10}$
Consider a right -angle triangle $ABC$ with $A=90^{o}$, $AB=c$ and $AC=b$. Let $P\in AC$ and $Q\in AB$ such that $\angle APQ=\angle ABC$ and $\angle AQP = \angle ACB$. Calculate $PQ+PE+QF$, where $E$ and $F$ are the projections of $B$ and $Q$ onto $BC$, respectively.
Solve the system of equations $$ \qquad<br /> \begin{array}{c}<br /> x_1x_2 = 1\\<br /> x_2x_3 = 2\\<br /> x_3x_4 = 3\\<br /> \ldots\\<br /> x_nx_1 = n<br /> \end{array}$$
In triangle $ABC$ shown in the adjoining figure, $M$ is the midpoint of side $BC$, $AB=12$ and $AC=16$. Points $E$ and $F$ are taken on $AC$ and $AB$, respectively, and lines $EF$ and $AM$ intersect at $G$. If $AE=2AF$ then $\frac{EG}{GF}$ equals
[asy]
draw((0,0)--(12,0)--(14,7.75)--(0,0));
draw((0,0)--(13,3.875));
draw((5,0)--(8.75,4.84));
label("A", (0,0), S);
label("B", (12,0), S);
label("C", (14,7.75), E);
label("E", (8.75,4.84), N);
label("F", (5,0), S);
label("M", (13,3.875), E);
label("G", (7,1));
[/asy]
$ \textbf{(A)}\ \frac{3}{2} \qquad\textbf{(B)}\ \frac{4}{3} \qquad\textbf{(C)}\ \frac{5}{4} \qquad\textbf{(D)}\ \frac{6}{5} \\ \qquad\textbf{(E)}\ \text{not enough information to solve the problem} $
Depei is imprisoned by an evil wizard and is coerced to play the following game. Every turn, Depei flips a fair coin. Then, the following events occur in this order:
$\bullet$ The wizard computes the difference between the total number of heads and the total number of tails Depei has flipped. If that number is greater than or equal to $4$ or less than or equal to $-3$, then Depei is vaporized by the wizard.
$\bullet$ The wizard determines if Depei has flipped at least $10$ heads or at least $10$ tails. If so, then the wizard releases Depei from the prison.
The probability that Depei is released by the evil wizard equals $\frac{m}{2^k}$ , where $m, k$ are positive integers. Compute $m+k$.
Let $p, k$ and $x$ be positive integers such that $p \geq k$ and $x < \left[ \frac{p(p-k+1)}{2(k-1)} \right]$, where $[q]$ is the largest integer no larger than $q$. Prove that when $x$ balls are put into $p$ boxes arbitrarily, there exist $k$ boxes with the same number of balls.
Two players, $A$ and $B,$ alternatively take stones from a pile of $n \geq 2$ stones. $A$ plays first and in his first move he must take at least one stone and at most $n-1$ stones. Then each player must take at least one stone and at most as many stones as his opponent took in the previous move. The player who takes the last stone wins. Which player has a winning strategy?
Daniel had a string that formed the perimeter of a square with area $98$. Daniel cut the string into two pieces. With one piece he formed the perimeter of a rectangle whose width and length are in the ratio $2 : 3$. With the other piece he formed the perimeter of a rectangle whose width and length are in the ratio $3 : 8$. The two rectangles that Daniel formed have the same area, and each of those areas is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
The number $2013$ is expressed in the form \[2013=\frac{a_1!a_2!\cdots a_m!}{b_1!b_2!\cdots b_n!},\] where $a_1\ge a_2\ge\cdots\ge a_m$ and $b_1\ge b_2\ge\cdots\ge b_n$ are positive integers and $a_1+b_1$ is as small as possible. What is $|a_1-b_1|$?
${ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D}}\ 4\qquad\textbf{(E)}\ 5 $