Found problems: 85335
Suppose that $ f: [0,1]\to\mathbb{R}$ has a continuous derivative and that $ \int_0^1f(x)\,dx\equal{}0.$
Prove that for every $ \alpha\in(0,1),$
\[ \left|\int_0^{\alpha}f(x)\,dx\right|\le\frac18\max_{0\le x\le 1}|f'(x)|\]
For a given positive integer $m$, the series
$$\sum_{k=1,k\neq m}^{\infty}\frac{1}{(k+m)(k-m)}$$
evaluates to $\frac{a}{bm^2}$, where $a$ and $b$ are positive integers. Compute $a+b$.
We place n points in the unit square independently, according to a uniform distribution. These points are the vertices of a graph $G_n$. Two points are connected by an edge if the slope of the segment connecting them is nonnegative. Denote by $M_n$ the event that the graph $G_n$ has a 1-factor. Prove that $\lim_{n \to \infty} P(M_ {2n}) = 1$.
For each pair $a, \,b$ of coprime natural numbers, let $d_{a,\,b}$ be the greatest common divisor of $51a + b$ and $a + 51b$. Find the maximum possible value of $d_{a,\,b}$.
Are there any sequences of positive integers $ 1 \leq a_{1} < a_{2} < a_{3} < \ldots$ such that for each integer $ n$, the set $ \left\{a_{k} \plus{} n\ |\ k \equal{} 1, 2, 3, \ldots\right\}$ contains finitely many prime numbers?
Ravon, Oscar, Aditi, Tyrone, and Kim play a card game. Each person is given $2$ cards out of a set of $10$ cards numbered $1,2,3, \dots,10.$ The score of a player is the sum of the numbers of their cards. The scores of the players are as follows: Ravon--$11,$ Oscar--$4,$ Aditi--$7,$ Tyrone--$16,$ Kim--$17.$ Which of the following statements is true?
$\textbf{(A) }\text{Ravon was given card 3.}$
$\textbf{(B) }\text{Aditi was given card 3.}$
$\textbf{(C) }\text{Ravon was given card 4.}$
$\textbf{(D) }\text{Aditi was given card 4.}$
$\textbf{(E) }\text{Tyrone was given card 7.}$
Let $a$ be a positive constant. Find the value of $\ln a$ such that
\[\frac{\int_1^e \ln (ax)\ dx}{\int_1^e x\ dx}=\int_1^e \frac{\ln (ax)}{x}\ dx.\]
Let $ABC$ be a triangle with $\angle BAC > 90 ^{\circ}$, and let $O$ be its circumcenter and $\omega$ be its circumcircle. The tangent line of $\omega$ at $A$ intersects the tangent line of $\omega$ at $B$ and $C$ respectively at point $P$ and $Q$. Let $D,E$ be the feet of the altitudes from $P,Q$ onto $BC$, respectively. $F,G$ are two points on $\overline{PQ}$ different from $A$, so that $A,F,B,E$ and $A,G,C,D$ are both concyclic. Let M be the midpoint of $\overline{DE}$. Prove that $DF,OM,EG$ are concurrent.
In parallelogram $ABCD$ of the accompanying diagram, line $DP$ is drawn bisecting $BC$ at $N$ and meeting $AB$ (extended) at $P$. From vertex $C$, line $CQ$ is drawn bisecting side $AD$ at $M$ and meeting $AB$ (extended) at $Q$. Lines $DP$ and $CQ$ meet at $O$. If the area of parallelogram $ABCD$ is $k$, then the area of the triangle $QPO$ is equal to
[asy]
size((400));
draw((0,0)--(5,0)--(6,3)--(1,3)--cycle);
draw((6,3)--(-5,0)--(10,0)--(1,3));
label("A", (0,0), S);
label("B", (5,0), S);
label("C", (6,3), NE);
label("D", (1,3), NW);
label("P", (10,0), E);
label("Q", (-5,0), W);
label("M", (.5,1.5), NW);
label("N", (5.65, 1.5), NE);
label("O", (3.4,1.75));
[/asy]
$ \textbf{(A)}\ k \qquad\textbf{(B)}\ \frac{6k}{5} \qquad\textbf{(C)}\ \frac{9k}{8} \qquad\textbf{(D)}\ \frac{5k}{4} \qquad\textbf{(E)}\ 2k $
The equation
\[x^5 + 5 \lambda x^4 - x^3 + (\lambda \alpha - 4)x^2 - (8 \lambda + 3)x + \lambda \alpha - 2 = 0\]
is given. Determine $\alpha$ so that the given equation has exactly (i) one root or (ii) two roots, respectively, independent from $\lambda.$
Oriol has a finite collection of cards, each one with a positive integer written on it. We say the collection is $n$-[i]complete[/i] if for any integer $k$ from $1$ to $n$ (inclusive), he can choose some cards such that the sum of the numbers on them is exactly $k$. Suppose that Oriol's collection is $n$-complete, but it stops being $n$-complete if any card is removed from it. What is the maximum possible sum of the numbers on all the cards?
[i]Proposed by Ariel García[/i]
In a non-obtuse triangle $ABC$, prove that
\[ \frac{\sin A \sin B}{\sin C} + \frac{\sin B \sin C}{\sin A} + \frac{\sin C \sin A}{ \sin B} \ge \frac 52. \][i]Proposed by Ryan Alweiss[/i]
Prove that there are infinitely many multiples of 2005 that contain all the digits 0, 1, 2,...,9 an equal number of times.
Given positive integers $a,b,c,d$ such that $a\mid c^d$ and $b\mid d^c$. Prove that
\[
ab\mid (cd)^{max(a,b)}
\]
suppose that $\mathcal F\subseteq X^{(k)}$ and $|X|=n$. we know that for every three distinct elements of $\mathcal F$ like $A,B,C$, at most one of $A\cap B$,$B\cap C$ and $C\cap A$ is $\phi$. for $k\le \frac{n}{2}$ prove that:
a) $|\mathcal F|\le max(1,4-\frac{n}{k})\times \dbinom{n-1}{k-1}$.(15 points)
b) find all cases of equality in a) for $k\le \frac{n}{3}$.(5 points)
There exists a unique pair of polynomials $(P(x),Q(x))$ such that
\begin{align*}
P(Q(x))&= P(x)(x^2-6x+7) \\
Q(P(x))&= Q(x)(x^2-3x-2)
\end{align*}
Compute $P(10)+Q(-10)$.
[i]Proposed by Connor Gordon[/i]
Henry rolls a fair die. If the die shows the number $k$, Henry will then roll the die $k$ more times. The probability that Henry will never roll a 3 or a 6 either on his first roll or on one of the $k$ subsequent rolls is given by $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
There are distinct points $O, A, B, K_1, . . . , K_n, L_1, . . . , L_n$ on a plane such that no three points are collinear. The open line segments $K_1L_1, . . . , K_nL_n$ are coloured red, other points on the plane are left uncoloured. An allowed path from point $O$ to point $X$ is a polygonal chain with first and last vertices at points $O$ and $X$, containing no red points. For example, for $n = 1$, and $K_1 = (-1, 0)$, $L_1 = (1, 0)$, $O = (0,-1)$, and $X = (0,1)$, $OK_1X$ and $OL_1X$ are examples of allowed paths from $O$ to $X$, there are no shorter allowed paths. Find the least positive integer n such that it is possible that the first vertex that is not $O$ on any shortest possible allowed path from $O$ to $A$ is closer to $B$ than to $A$, and the first vertex that is not $O$ on any shortest possible allowed path from $O$ to $B$ is closer to $A$ than to $B$.
A train consist of $2010$ wagons containing gold coins, all of the same shape. Any two coins have equal weight provided that they are in the same wagon, and differ in weight if they are in different ones. The weight of a coin is one of the positive reals
\begin{align*} m_1 <m_2 <\ldots <m_{2010} \end{align*}
Each wagon is marked by a label with one of the numbers $m_1,m_2, \ldots , m_{2010}$ (the numbers on different labels are different).
A controller has a pair of scales (allowing only to compare masses) at his disposal. During each measurement he can use an arbitrary number of coins from any of the wagons. The controller has the task to establish: if all labels show rightly the common weight of the coins in a wagon or if there exists at least one wrong label. What is the least number of measurement that the controller has to perform to accomplish his task?
A sequence ($a_n$) is given by $a_0 = 0, a_1 = 1$ and $a_{k+2} = a_{k+1} +a_k$ for all integers $k \ge 0$.
Prove that the inequality $\sum_{k=0}^n \frac{a_k}{2^k}< 2$ holds for all positive integers $n$.
A circle can be circumscribed around the quadrilateral $ABCD$. Point $P$ is the foot of the perpendicular drawn from point $A$ on line $BC$, and respectively $Q$ from $A$ on $DC$, $R$ from $D$ on $AB$ and $T$ from $D$ on $BC$ . Prove that points $P,Q,R$ and $T$ lie on the same circle.
(A. Myakishev)
The figure shows all 6 colorings with for different colors of a $1\times 1$ square divided in four $\tfrac{1}{2} \times \tfrac{1}{2}$ cells (two colorings are considered equal if one is the result of rotating the other). Each of the $1\times 1$ colorings will be used as a piece for a puzzle. The pieces can be rotated but not reflected. Two pieces [i]fit[/i] if when sharing a side, the touching $\tfrac{1}{2} \times \tfrac{1}{2}$ cells are the same color respectively (see examples). ¿Is it possible to assemble a $3 \times 2$ puzzle using each of the 6 pieces exactly once and such that every pair of adjacent pieces fit?
[img]https://imagizer.imageshack.com/img922/6019/ZUKcED.jpg[/img]
Let $f$ and $g$ be functions from the set $A$ to the same set $A$. We define $f$ to be a functional $n$-th root of $g$ ($n$ is a positive integer) if $f^n(x) = g(x)$, where $f^n(x) = f^{n-1}(f(x)).$
(a) Prove that the function $g : \mathbb R \to \mathbb R, g(x) = 1/x$ has an infinite number of $n$-th functional roots for each positive integer $n.$
(b) Prove that there is a bijection from $\mathbb R$ onto $\mathbb R$ that has no nth functional root for each positive integer $n.$
Let $n \ge 2$ be a positive integer and let $A \in \mathcal{M}_n(\mathbb{R})$ be a matrix such that $A^2=-I_n$. If $B \in \mathcal{M}_n(\mathbb{R})$ and $AB = BA$, prove that $\det B \ge 0$.
A grid consists of $2n$ vertical and $2n$ horizontal lines, each group disposed at equal distances. The lines are all painted in red and black, such that exactly $n$ vertical and $n$ horizontal lines are red.
Find the smallest $n$ such that for any painting satisfying the above condition, there is a square formed by the intersection of two vertical and two horizontal lines, all of the same colour.