Found problems: 85335
Let $f_0:[0,1]\to\mathbb R$ be a continuous function. Define the sequence of functions $f_n:[0,1]\to\mathbb R$ by
$$f_n(x)=\int^x_0f_{n-1}(t)dt$$
for all integers $n\ge1$.
a) Prove that the series $\sum_{n=1}^\infty f_n(x)$ is convergent for every $x\in[0,1]$.
b) Find an explicit formula for the sum of the series $\sum_{n=1}^\infty f_n(x),x\in[0,1]$.
Given a finite sequence $x_{1,1}, x_{2,1}, \dots , x_{n,1}$ of integers $(n\ge 2)$, not all equal, define the sequences $x_{1,k}, \dots , x_{n,k}$ by
\[ x_{i,k+1}=\frac{1}{2}(x_{i,k}+x_{i+1,k})\quad\text{where }x_{n+1,k}=x_{1,k}.\]
Show that if $n$ is odd, then not all $x_{j,k}$ are integers. Is this also true for even $n$?
Let $n$ be a positive integer and let $k$ be an odd positive integer. Moreover, let $a,b$ and $c$ be integers (not necessarily positive) satisfying the equations
\[a^n+kb=b^n+kc=c^n+ka \]
Prove that $a=b=c$.
A domino is a $ 1 \times 2 $ or $ 2 \times 1 $ tile.
Let $n \ge 3 $ be an integer. Dominoes are placed on an $n \times n$ board in such a way that each domino covers exactly two cells of the board, and dominoes do not overlap. The value of a row or column is the number of dominoes that cover at least one cell of this row or column. The configuration is called balanced if there exists some $k \ge 1 $ such that each row and each column has a value of $k$. Prove that a balanced configuration exists for every $n \ge 3 $, and find the minimum number of dominoes needed in such a configuration.
In a rectangular array of nonnegative reals with $m$ rows and $n$ columns, each row and each column contains at least one positive element. Moreover, if a row and a column intersect in a positive element, then the sums of their elements are the same. Prove that $m=n$.
Define for $n$ given positive reals the [i]strange mean[/i] as the sum of the squares of these numbers divided by their sum. Decide which of the following statements hold for $n=2$:
a) The strange mean is never smaller than the third power mean.
b) The strange mean is never larger than the third power mean.
c) The strange mean, depending on the given numbers, can be larger or smaller than the third power mean.
Which statement is valid for $n=3$?
A sequence of positive integers is constructed as follows: the first term is $ 1$, the following two terms are $ 2$, $ 4$, the following three terms are $ 5$, $ 7$, $ 9$, the following four terms are $ 10$, $ 12$, $ 14$, $ 16$, etc. Find the $ n$-th term of the sequence.
In $\triangle ABC$ we have $BC>CA>AB$. The nine point circle is tangent to the incircle, $A$-excircle, $B$-excircle and $C$-excircle at the points $T,T_A,T_B,T_C$ respectively. Prove that the segments $TT_B$ and lines $T_AT_C$ intersect each other.
Source: 2018 Canadian Open Math Challenge Part A Problem 1
-----
Suppose $x$ is a real number such that $x(x+3)=154.$ Determine the value of $(x+1)(x+2)$.
If $ m \equal{} \frac {cab}{a \minus{} b}$, then $ b$ equals:
$ \textbf{(A)}\ \frac {m(a \minus{} b)}{ca} \qquad\textbf{(B)}\ \frac {cab \minus{} ma}{ \minus{} m} \qquad\textbf{(C)}\ \frac {1}{1 \plus{} c} \qquad\textbf{(D)}\ \frac {ma}{m \plus{} ca}$
$ \textbf{(E)}\ \frac {m \plus{} ca}{ma}$
Suppose that $x$ is measured in radians. Find the maximum value of \[\frac{\sin2x+\sin4x+\sin6x}{\cos2x+\cos4x+\cos6x}\] for $0\le x\le \frac{\pi}{16}$
Let $ABC$ be a triangle with circumcircle $\omega$. The bisector of $\angle BAC$ intersects $\omega$ at point $A_1$. Let $A_2$ be a point on the segment $AA_1$, $CA_2$ cuts $AB$ and $\omega$ at points $C_1$ and $C_2$, respectively. Similarly, $BA_2$ cuts $AC$ and $\omega$ at points $B_1$ and $B_2$, respectively. Let $M$ be the intersection point of $B_1C_2$ and $B_2C_1$. Prove that $MA_2$ passes the midpoint of $BC$.
[i]proposed by Jhefferson Lopez, Perú[/i]
Three coins lie on integer points on the number line. A move consists of choosing and moving two coins, the first one $ 1$ unit to the right and the second one $ 1$ unit to the left.
Under which initial conditions is it possible to move all coins to one single point?
Consider the triangle $ ABC $ with $ \angle BAC>60^{\circ } $ and $ \angle BCA>30^{\circ } . $ On the other semiplane than that determined by $ BC $ and $ A $ we have the points $ D $ and $ E $ so that
$$ \angle ABE =\angle CBD =\angle BAE +30^{\circ } =\angle BCD +30^{\circ } =90^{\circ } . $$
Note by $ F,H $ the midpoints of $ AE, $ respectively, $ CD, $ and with $ G $ the intersection of $ AC $ and $ DE. $ Show:
[b]a)[/b] $ EBD\sim ABC $
[b]b)[/b] $ FGH\equiv ABC $
$ABCD$ is a square with centre $O$. Two congruent isosceles triangle $BCJ$ and $CDK$ with base $BC$ and $CD$ respectively are constructed outside the square. let $M$ be the midpoint of $CJ$. Show that $OM$ and $BK$ are perpendicular to each other.
Let $a_1,a_2,...,a_m(m\geq 1)$ be all the positive divisors of $n$. If there exist $m$ integers $b_1,b_2,...b_m$ such that $n=\sum_{i=1}^m (-1)^{b_i} a_i$, then $n$ is a $\textit{good}$ number. Prove that there exist a good number with exactly $2013$ distinct prime factors.
Find all functions $f: \mathbb{N}\to\mathbb{N}$ which satisfy the inequality:
\[f(3x+2y)=f(x)f(y)\]
for all non-negative integers $x,y$.
There are $k$ piles and there are $2019$ stones totally. In every move we split a pile into two or remove one pile. Using finite moves we can reach conclusion that there are $k$ piles left and all of them contain different number of stonws. Find the maximum of $k$.
The number of distinct points common to the graphs of $x^2+y^2=9$ and $y^2=9$ is:
$ \textbf{(A) }\text{infinitely many} \qquad\textbf{(B) } \text{four}\qquad\textbf{(C) }\text{two}\qquad\textbf{(D) }\text{one}\qquad\textbf{(E) }\text{none} $
On a spherical surface there is a set $M{}$ with $n{}$ points with the property: for every point $A{}$ from $M{}$ there exist points $B$ and $C$ from $M{}$ such that the triangle $ABC$ is equilateral. For every equilateral triangle with vertexes in $M{}$ the perpendicular on its plane that goes through the geometric center of the other points from $M{}$. Prove that all these perpendiculars are concurrent.
Let $\mathbb N$ denote the set of positive integers. Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that:
(i) The greatest common divisor of the sequence $f(1), f(2), \dots$ is $1$.
(ii) For all sufficiently large integers $n$, we have $f(n) \neq 1$ and \[ f(a)^n \mid f(a+b)^{a^{n-1}} - f(b)^{a^{n-1}} \] for all positive integers $a$ and $b$.
[i]Proposed by Yang Liu[/i]
Let $n\ge 2$ be an integer and let $P(X)=X^n+a_{n-1}X^{n-1}+\ldots +a_1X+1$ be a polynomial with positive integer coefficients. Suppose that $a_k=a_{n-k}$ for all $k\in 1,2,\ldots,n-1$. Prove that there exist infinitely many pairs of positive integers $x,y$ such that $x|P(y)$ and $y|P(x)$.
[i]Remus Nicoara[/i]
An equilateral triangle $ABC$ has side a. A square is constructed on the outside of each side of the triangle. A right regular pyramid with sloping side $a$ is placed on each square. These pyramids are rotated about the sides of the triangle so that the apex of each pyramid comes to a common point above the triangle. Show that when this has been done, the other vertices of the bases of the pyramids (apart from the vertices of the triangle) form a regular hexagon.
A prefrosh is participating in Caltech’s “Rotation.” They must rank Caltech’s $8$ houses, which are Avery, Page, Lloyd, Venerable, Ricketts, Blacker, Dabney, and Fleming, each a distinct integer rating from $1$ to $8$ inclusive. The conditions are that the rating $x$ they give to Fleming is at most the average rating $y$ given to Ricketts, Blacker, and Dabney, which is in turn at most the average rating $z$ given to Avery, Page, Lloyd, and Venerable. Moreover $x, y, z$ are all integers. How many such rankings can the prefrosh provide?
Given integer $d>1,m$,prove that there exists integer $k>l>0$, such that $$(2^{2^k}+d,2^{2^l}+d)>m.$$