Found problems: 85335
Let $n$ be a positive integer. Determine, in terms of $n$, the greatest integer which divides
every number of the form $p + 1$, where $p \equiv 2$ mod $3$ is a prime number which does not divide $n$.
Prove that the number \[\sum_{k=0}^{n}\binom{2n+1}{2k+1}2^{3k}\] is not divisible by $5$ for any integer $n\geq 0$.
Prove that there exist infinitely many integers $n$ such that $n^2+1$ is squarefree.
Do there exist three different quadratic trinomials $f(x), g(x), h(x)$ such that the roots of the equation $f(x)=g(x)$ are $1$ and $4$, the roots of the equation $g(x)=h(x)$ are $2$ and $5$, and the roots of the equation $h(x)=f(x)$ are $3$ and $6$?
[i]Proposed by A. Golovanov[/i]
In the quadrilateral $ABCD$, we have $\measuredangle BAD = 100^{\circ}$, $\measuredangle BCD = 130^{\circ}$, and $AB=AD=1$ centimeter. Find the length of diagonal $AC$.
The 2010 positive numbers $a_1, a_2, \ldots , a_{2010}$ satisfy the inequality $a_ia_j \le i+j$ for all distinct indices $i, j$. Determine, with proof, the largest possible value of the product $a_1a_2\ldots a_{2010}$.
Let $P$ be a point on the circumcircle of triangle $ABC$. Let $A_1$ be the reflection of the orthocenter of triangle $PBC$ about the reflection of the perpendicular bisector of $BC$. Points $B_1$ and $C_1$ are defined similarly. Prove that $A_1,B_1,C_1$ are collinear.
Xavier takes a permutation of the numbers $1$ through $2011$ at random, where each permutation has an equal probability of being selected. He then cuts the permutation into increasing contiguous subsequences, such that each subsequence is as long as possible. Compute the expected number of such subsequences.
[i]Author: Alex Zhu[/i]
[hide="Clarification"]An increasing contiguous subsequence is an increasing subsequence all of whose terms are adjacent in the original sequence. For example, 1,3,4,5,2 has two maximal increasing contiguous subsequences: (1,3,4,5) and (2). [/hide]
Find a prime number $p$ such that $\frac{p+1}{2}$ and $\frac{p^2+1}{2}$ are perfect square
Let $ ABC$ be an isosceles triangle with $ AC \equal{} BC.$ Its incircle touches $ AB$ in $ D$ and $ BC$ in $ E.$ A line distinct of $ AE$ goes through $ A$ and intersects the incircle in $ F$ and $ G.$ Line $ AB$ intersects line $ EF$ and $ EG$ in $ K$ and $ L,$ respectively. Prove that $ DK \equal{} DL.$
Let $p$ be a monic cubic polynomial such that $p(0)=1$ and such that all the zeroes of $p^\prime (x)$ are also zeroes of $p(x)$. Find $p$. Note: monic means that the leading coefficient is $1$.
Solve the following system
\[
\left\{ \begin{array}{l}
xyzu-x^3=9 \\
x+yz=\dfrac{3}{2}u \\
\end{array} \right.
\]
in positive integers $x$, $y$, $z$ and $u$.
Let $f$ be a polynomial with real coefficients and suppose $f$ has no nonnegative real root. Prove that there exists a polynomial $h$ with real coefficients such that the coefficients of $fh$ are nonnegative.
$P$ is a point in the interior of acute triangle $ABC$. $D,E,F$ are the reflections of $P$ across $BC,CA,AB$ respectively. Rays $AP,BP,CP$ meet the circumcircle of $\triangle ABC$ at $L,M,N$ respectively. Prove that the circumcircles of $\triangle PDL,\triangle PEM,\triangle PFN$ meet at a point $T$ different from $P$.
Does there exist a sequence of $2017$ consecutive integers which contains exactly $17$ primes?
For a real coefficient cubic polynomial $f(x)=ax^3+bx^2+cx+d$, denote three roots of the equation $f(x)=0$ by $\alpha,\beta,\gamma$. Prove that the three roots $\alpha,\beta,\gamma$ are distinct real numbers iff the real symmetric matrix
$$\begin{pmatrix} 3 & p_1 & p_2 \\ p_1 & p_2 & p_3 \\ p_2 & p_3 & p_4 \end{pmatrix},\quad p_i = \alpha^i + \beta^i + \gamma^i$$
is positive definite.
Let $n \ge 2$ be an integer. Consider an $n \times n$ chessboard consisting of $n^2$ unit squares. A configuration of $n$ rooks on this board is [i]peaceful[/i] if every row and every column contains exactly one rook. Find the greatest positive integer $k$ such that, for each peaceful configuration of $n$ rooks, there is a $k \times k$ square which does not contain a rook on any of its $k^2$ unit squares.
$\triangle ABC$ is a triangle and $D,E,F$ are points on $BC$, $CA$, $AB$ respectively. It is given that $BF=BD$, $CD=CE$ and $\angle BAC=48^{\circ}$. Find the angle $\angle EDF$
$ \textbf{(A) }64^{\circ}\qquad\textbf{(B) }66^{\circ}\qquad\textbf{(C) }68^{\circ}\qquad\textbf{(D) }70^{\circ}\qquad\textbf{(E) }72^{\circ} $
Consider the orthogonal projections of the vertices $A$, $B$ and $C$ of triangle $ABC$ on external bisectors of $ \angle ACB$, $ \angle BAC$ and $ \angle ABC$, respectively. Prove that if $d$ is the diameter of the circumcircle of the triangle, which is formed by the feet of projections, while $r$ and $p$ are the inradius and the semiperimeter of triangle $ABC$, prove that $r^2+p^2=d^2$
[i]Proposed by Alexander Ivanov[/i]
For each real number $a$ with $0 \leq a \leq 1$, let numbers $x$ and $y$ be chosen independently at random from the intervals $[0, a]$ and $[0, 1]$, respectively, and let $P(a)$ be the probability that
$$\sin^2{(\pi x)} + \sin^2{(\pi y)} > 1.$$
What is the maximum value of $P(a)?$
$\textbf{(A)}\ \frac{7}{12} \qquad\textbf{(B)}\ 2 - \sqrt{2} \qquad\textbf{(C)}\ \frac{1+\sqrt{2}}{4} \qquad\textbf{(D)}\ \frac{\sqrt{5}-1}{2} \qquad\textbf{(E)}\ \frac{5}{8}$
Let the numbers $a_1,a_2,a_3,a_4$ form an arithmetic progression with difference $d\ne0$. Prove that there are no exists geometric progressions $b_1,b_2,b_3,b_4$ and $c_1,c_2,c_3,c_4$ such that:
$$a_1=b_1+c_1,a_2=b_2+c_2,a_3=b_3+c_3,a_4=b_4+c_4.$$
Let $X$ be a bounded, nonempty set of points in the Cartesian plane. Let $f(X)$ be the set of all points that are at a distance of at most $1$ from some point in $X$. Let $f_n(X) = f(f(\cdots(f(X))\cdots))$ ($n$ times). Show that $f_n(X)$ becomes “more circular” as $n$ gets larger.
In other words, if $r_n = \sup\{\text{radii of circles contained in } f_n(X) \}$ and $R_n = \inf \{\text{radii of circles containing } f_n(X)\}$, then show that $R_n/r_n$ gets arbitrarily close to $1$ as $n$ becomes arbitrarily large.
[hide]I'm not sure that I'm posting this in a right forum. If it's in a wrong forum, please mods move it.[/hide]
Let $N$ be a positive integer with $2k$ digits. Its chunks are defined by the two numbers formed by the digits from $1$ to $k$ and $k+1$ to $2k$ (e.g. the chunks of 142856 are 142 and 856). We define the $N$-[i]reverse[/i] as the number formed by switching its chunks (e.g. the reverse of 142856 is 856142 and for 1401 it is 114). We call a number [i]cearense[/i] is it satisfies the following conditions:
[list=i]
[*] Has an even number of digits
[*] Its chunks are relatively prime
[*]Divides its reverse
[/list]
Find the two smallest cearense integer.
Three chords $AB, CD$ and $EF$ of a circle intersect at the midpoint $M$ of $AB$. Show that if $CE$ produced and $DF$ produced meet the line $AB$ at the points $P$ and $Q$ respectively, then $M$ is also the midpoint of $PQ$.
Let $a, b, c$ be positive integers. Suppose that $(a + b)(a + c) = 77$ and $(a + b)(b + c) = 56$. Find $(a + c)(b + c)$.