Found problems: 85335
Find the smallest integer $n$ such that an $n\times n$ square can be partitioned into $40\times 40$ and $49\times 49$ squares, with both types of squares present in the partition, if
a) $40|n$; b) $49|n$; c) $n\in \mathbb N$.
Prove that if the polynomial $x^3 + ax^2 + bx + c$ has three distinct real roots, so does the polynomial
$x^3 + ax^2 + \frac{1}{4}(a^2 + b)x + \frac{1}{8}(ab-c)$.
How many real numbers $a \in (1,9)$ such that the corresponding number $a- \frac1a$ is an integer?
(A): $0$, (B): $1$, (C): $8$, (D): $9$, (E) None of the above.
A solid box is $ 15$ cm by $ 10$ cm by $ 8$ cm. A new solid is formed by removing a cube $ 3$ cm on a side from each corner of this box. What percent of the original volume is removed?
$ \textbf{(A)}\ 4.5 \qquad
\textbf{(B)}\ 9 \qquad
\textbf{(C)}\ 12 \qquad
\textbf{(D)}\ 18 \qquad
\textbf{(E)}\ 24$
In triangle $ABC$ with incenter $I$ and circumcircle $\omega$, the tangent through $C$ to $\omega$ intersects $AB$ at point $D$. The angle bisector of $\angle CDB$ intersects $AI$ and $BI$ at $E$ and $F$, respectively. Let $M$ be the midpoint of $[EF]$. Prove that line $MI$ passes through the midpoint of arc $ACB$ of $w$ .
Let $ABC$ an acute triangle and $\Gamma$ its circumcircle. The bisector of $BAC$ intersects $\Gamma$ at $M\neq A$. A line $r$ parallel to $BC$ intersects $AC$ at $X$ and $AB$ at $Y$. Also, $MX$ and $MY$ intersect $\Gamma$ again at $S$ and $T$, respectively.
If $XY$ and $ST$ intersect at $P$, prove that $PA$ is tangent to $\Gamma$.
The sum of six consecutive positive integers is 2013. What is the largest of these six integers?
$\textbf{(A)}\ 335 \qquad \textbf{(B)}\ 338 \qquad \textbf{(C)}\ 340 \qquad \textbf{(D)}\ 345 \qquad \textbf{(E)}\ 350$
Find all natural numbers $n$ the product of whose decimal digits is $n^2-10n-22$.
Suppose $\triangle JHU$ satisfies $JH = JU = 44$ and $HU = 32$. There is a unique circle passing through $U$ that is tangent to $\overline{JH}$ at its midpoint; let this circle intersect $\overline{JU}$ and $\overline{HU}$ again at points $X \neq U$ and $Y \neq U$, respectively. Let $Z$ be the unique point on $\overline{JH}$ such that $JZ = XU$. Compute the perimeter of quadrilateral $UXZY$.
[b]i)[/b] Let $0<a<b$.Prove that amongst all triangles having base $a$ and perimeter $a+b$ the triangle having two sides(other than the base) equal to $\frac {b}{2}$ has the maximum area.
[b]ii)[/b]Using $i)$ or otherwise, prove that amongst all quadrilateral having give perimeter the square has the maximum area.
Given a circle and two tangents to this circle. Draw a third tangent to the circle in such a way that its segment contained by the given tangents has the given length $ d $.
The tangents at $B$ and $C$ to the circumcircle of the acute-angled triangle $ABC$ meet at $X$. Let $M$ be the midpoint of $BC$. Prove that
[i](a)[/i] $\angle BAM = \angle CAX$, and
[i](b)[/i] $\frac{AM}{AX} = \cos\angle BAC.$
Find all functions $\,f: {\mathbb{N}}\rightarrow {\mathbb{N}}\,$ such that\[f(a)^{bf(b^2)}\le a^{f(b)^3}\hspace{0.2in}\text{for all}\,a,b\in \mathbb{N}. \]
Consider $\vartriangle ABC$, right at $B$, let $I$ be its incenter and $F,D,E$ the points where the circle inscribed on sides AB, $BC$ and $AC$, respectively. If $M$ is the intersection point of $CI$ and $EF$, and $N$ is the intersection point of $DM$ and $AB$. Prove that $AN = ID$.
Let $\alpha$ be an irrational number with $0<\alpha < 1$, and draw a circle in the plane whose circumference has length $1$. Given any integer $n\ge 3$, define a sequence of points $P_1, P_2, \ldots , P_n$ as follows. First select any point $P_1$ on the circle, and for $2\le k\le n$ define $P_k$ as the point on the circle for which the length of arc $P_{k-1}P_k$ is $\alpha$, when travelling counterclockwise around the circle from $P_{k-1}$ to $P_k$. Suppose that $P_a$ and $P_b$ are the nearest adjacent points on either side of $P_n$. Prove that $a+b\le n$.
Let $n, k, \ell$ be positive integers and $\sigma : \lbrace 1, 2, \ldots, n \rbrace \rightarrow \lbrace 1, 2, \ldots, n \rbrace$ an injection such that $\sigma(x)-x\in \lbrace k, -\ell \rbrace$ for all $x\in \lbrace 1, 2, \ldots, n \rbrace$. Prove that $k+\ell|n$.
Let $a_o,a_1,a_2,..,a_ n$ be a non-decreasing sequence of $n+1$ real numbers where $a_0 = 0$ and for every $j > i $ we have $a_j - a_i \le j - i$. Show that $$\left (\sum_{i=0}^n a_i \right )^2 \ge \sum_{i=0}^n a_i^3$$
John can purchase pieces of gum in packs of $4$, $14$, and $20$ pieces. Given that he purchases at least one of each kind of pack, what is the positive difference between the greatest and least number of packs he can purchase to end up with exactly $86$ pieces of gum?
$\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$
Suppose a class contains $100$ students. Let, for $1\le i\le 100$, the $i^{\text{th}}$ student have $a_i$ many friends. For $0\le j\le 99$ let us define $c_j$ to be the number of students who have strictly more than $j$ friends. Show that \begin{align*} & \sum_{i=1}^{100}a_i=\sum_{j=0}^{99}c_j \end{align*}
Determine all pairs $(x, y)$ of positive integers such that \[\sqrt[3]{7x^2-13xy+7y^2}=|x-y|+1.\]
[i]Proposed by Titu Andreescu, USA[/i]
There were finitely many persons at a party among whom some were friends. Among any $4$ of them there were either $3$ who were all friends among each other or $3$ who weren't friend with each other. Prove that you can separate all the people at the party in two groups in such a way that in the first group everyone is friends with each other and that all the people in the second group are not friends to anyone else in second group. (Friendship is a mutual relation).
Let $\rho:G\to GL(V)$ be a representation of a finite $p$-group $G$ over a field of characteristic $p$. Prove that if the restriction of the linear map $\sum_{g\in G} \rho(g)$ to a finite dimensional subspace $W$ of $V$ is injective, then the subspace spanned by the subspaces $\rho(g)W$ $(g\in G)$ is the direct sum of these subspaces.
Laura has $2010$ lamps connected with $2010$ buttons in front of her. For each button, she wants to know the corresponding lamp. In order to do this, she observes which lamps are lit when Richard presses a selection of buttons. (Not pressing anything is also a possible selection.) Richard always presses the buttons simultaneously, so the lamps are lit simultaneously, too.
a) If Richard chooses the buttons to be pressed, what is the maximum number of different combinations of buttons he can press until Laura can assign the buttons to the lamps correctly?
b) Supposing that Laura will choose the combinations of buttons to be pressed, what is the minimum number of attempts she has to do until she is able to associate the buttons with the lamps in a correct way?
If $\alpha $ is the real root of the equation
\[E(x) = x^3 - 5x -50 = 0\]
such that $x_{n+1} = (5x_n + 50)^{1/3}$ and $x_1 = 5$, where $n$ is a positive integer, prove that:
[b](a)[/b] $x_{n+1}^3 - \alpha^3 = 5(x_n - \alpha)$
[b](b)[/b] $\alpha < x_{n+1} < x_n.$
Let $A_1$, $B_1$ and $C_1$ be the midpoints of sides $BC$, $CA$ and $AB$ of triangle $ABC$, respectively. Points $B_2$ and $C_2$ are the midpoints of segments $BA_1$ and $CA_1$ respectively. Point $B_3$ is symmetric to $C_1$ wrt $B$, and $C_3$ is symmetric to $B_1$ wrt $C$.
Prove that one of common points of circles $BB_2B_3$ and $CC_2C_3$ lies on the circumcircle of triangle $ABC$.