Found problems: 85335
Let $f : \mathbb{R} \to \mathbb{R}$ a periodic and continue function with period $T$ and $F : \mathbb{R} \to \mathbb{R}$ antiderivative of $f$. Then $$\int \limits_0^T \left[F(nx)-F(x)-f(x)\frac{(n-1)T}{2}\right]dx=0$$
Can a square of side length $5$ be covered by three squares of side length $4$?
Let a and b be non-negative integers such that $ab \ge c^{2}$ where $c$ is an integer. Prove that there is a positive integer n and integers $x_{1}$, $x_{2}$, $\cdots$, $x_{n}$, $y_{1}$, $y_{2}$, $\cdots$, $y_{n}$ such that \[{x_{1}}^{2}+\cdots+{x_{n}}^{2}=a,\;{y_{1}}^{2}+\cdots+{y_{n}}^{2}=b,\; x_{1}y_{1}+\cdots+x_{n}y_{n}=c\]
Find $\displaystyle \sum_{k=0}^{49}(-1)^k\binom{99}{2k}$, where $\binom{n}{j}=\frac{n!}{j!(n-j)!}$.
$ \textbf{(A)}\ -2^{50} \qquad\textbf{(B)}\ -2^{49} \qquad\textbf{(C)}\ 0 \qquad\textbf{(D)}\ 2^{49} \qquad\textbf{(E)}\ 2^{50} $
The largest factor of $n$ not equal to $n$ is $35$. Compute the largest possible value of $n$.
Let $d$ be a real number. For each integer $m \geq 0,$ define a sequence $\left\{a_{m}(j)\right\}, j=0,1,2, \ldots$ by the condition
\begin{align*}
a_{m}(0)&=d / 2^{m},\\
a_{m}(j+1)&=\left(a_{m}(j)\right)^{2}+2 a_{m}(j), \quad j \geq 0.
\end{align*}
Evaluate $\lim _{n \rightarrow \infty} a_{n}(n).$
Suppose there are three empty buckets and $n \ge 3$ marbles. Ani and Budi play a game. For the first turn, Ani distributes all the marbles into the buckets so that each bucket has at least one marble. Then Budi and Ani alternate turns, starting with Budi. On a turn, the current player may choose a bucket and take 1, 2, or 3 marbles from it. The player that takes the last marble wins. Find all $n$ such that Ani has a winning strategy, including what Ani's first move (distributing the marbles) should be for these $n$.
Let $n$ and $k$ be positive integers. A function $f : \{1, 2, 3, 4, \dots , kn - 1, kn\} \to \{1, \cdots , 5\}$ is [i]good[/i] if $f(j + k) - f(j)$ is multiple of $k$ for every $j = 1, 2. \cdots , kn - k$.
[b](a)[/b] Prove that, if $k = 2$, then the number of good functions is a perfect square for every positive integer $n$.
[b](b)[/b] Prove that, if $k = 3$, then the number of good functions is a perfect cube for every positive integer $n$.
$$(b+c)x^2+(a+c)x+(a+b)=0$$ has not real roots. Prove that $$4ac-b^2 \leq 3a(a+b+c)$$
If $i^2 = -1$, then the sum
\[ \cos{45^\circ} + i\cos{135^\circ} + \cdots + i^n\cos{(45 + 90n)^\circ} \]
\[ + \cdots + i^{40}\cos{3645^\circ} \]
equals
\[ \text{(A)}\ \frac{\sqrt{2}}{2} \qquad \text{(B)}\ -10i\sqrt{2} \qquad \text{(C)}\ \frac{21\sqrt{2}}{2} \]
\[ \text{(D)}\ \frac{\sqrt{2}}{2}(21 - 20i) \qquad \text{(E)}\ \frac{\sqrt{2}}{2}(21 + 20i) \]
Find the largest positive integer $N$ satisfying the following properties:
[list]
[*]$N$ is divisible by $7$;
[*]Swapping the $i^{\text{th}}$ and $j^{\text{th}}$ digits of $N$ (for any $i$ and $j$ with $i\neq j$) gives an integer which is $\textit{not}$ divisible by $7$.
[/list]
In a $2\times n$ array we have positive reals s.t. the sum of the numbers in each of the $n$ columns is $1$. Show that we can select a number in each column s.t. the sum of the selected numbers in each row is at most $\frac{n+1}4$.
In the space is given a tetrahedron with length of the edge $2$. Prove that distances from some point $M$ to all of the vertices of the tetrahedron are integer numbers if and only if $M$ is a vertex of tetrahedron.
[i]J. Tabov[/i]
Define the sequnce ${(a_n)}_{n\ge1}$ by $a_1=1$ and $a_n=5a_{n-1}+3^{n-1}$ for $n\ge2$.
Find the greatest power of $2$ that divides $a_{2^{2019}}$.
For which natural numbers $n$ does $2^n > 10n^2 -60n + 80$ hold?
Find all strictly increasing functions $f: \mathbb{N}\to \mathbb{N}$ such that \[f(f(n))=3n.\]
Let $ABC$ be a triangle. $M$ the midpoint of $AB$ and $L$ the midpoint of $BC$. We denote by $G$ the intersection of $AL$ with $CM$ and we take $E$ a point such that $G$ is the midpoint of the segment $AE$. Prove that the quadrilateral $MCEB$ is cyclic if and only if $MB = BG$.
Determine the general term of the sequence ($a_n$) given by $a_0 =\alpha > 0$ and $a_{n+1} =\frac{a_n}{1+a_n}$
.
Let $ABC$ be a triangle with $CA \neq CB$. Let $D$, $F$, and $G$ be the midpoints of the sides $AB$, $AC$, and $BC$ respectively. A circle $\Gamma$ passing through $C$ and tangent to $AB$ at $D$ meets the segments $AF$ and $BG$ at $H$ and $I$, respectively. The points $H'$ and $I'$ are symmetric to $H$ and $I$ about $F$ and $G$, respectively. The line $H'I'$ meets $CD$ and $FG$ at $Q$ and $M$, respectively. The line $CM$ meets $\Gamma$ again at $P$. Prove that $CQ = QP$.
[i]Proposed by El Salvador[/i]
In a non-isosceles triangle $ABC$, let $I$ be its incenter. The incircle of $ABC$ touches $BC$, $CA$, and $AB$ at $D$, $E$, and $F$, respectively. A line passing through $D$ and perpendicular to $AD$ intersects $IB$ and $IC$ at $A_b$ and $A_c$, respectively. Define the points $B_c$, $B_a$, $C_a$, and $C_b$ similarly. Let $G$ be the intersection of the cevians $AD$, $BE$, and $CF$. The points $O_1$ and $O_2$ are the circumcenter of the triangles $A_bB_cC_a$ and $A_cB_aC_b$, respectively. Prove that $IG$ is the perpendicular bisector of $O_1O_2$.
The sequence $\{x_n\}_{n\ge1}$ is defined by $x_1 = 7$, $x_{n+1} = 2x^2_n - 1$, for all positive integers $n$. Prove that for all positive integers $n$ the number $x_n$ cannot be divisible by $2003$.
Let $ABC$ be an acute triangle. Let $\omega$ be a circle whose centre $L$ lies on the side $BC$. Suppose that $\omega$ is tangent to $AB$ at $B'$ and $AC$ at $C'$. Suppose also that the circumcentre $O$ of triangle $ABC$ lies on the shorter arc $B'C'$ of $\omega$. Prove that the circumcircle of $ABC$ and $\omega$ meet at two points.
[i]Proposed by Härmel Nestra, Estonia[/i]
Let $p\neq 3$ be a prime number. Show that there is a non-constant arithmetic sequence of positive integers $x_1,x_2,\ldots ,x_p$ such that the product of the terms of the sequence is a cube.
Let $n$ be a positive integer with $n>1$, and let $a_1$, $a_2$, ..., $a_n$ be positive integers such that $a_1<a_2<...<a_n$ and $\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n} \le 1$.
Prove that
$(\frac{1}{a_1^2+x^2}+\frac{1}{a_2^2+x^2}+...+\frac{1}{a_n^2+x^2})^2 \le \frac{1}{2} \cdot \frac{1}{a_1(a_1-1)+x^2}$
for all real numbers $x$.
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.