Found problems: 85335
Given a real number $c$ and an integer $m, m \ge 2$. Real numbers $x_1, x_2,... , x_m$ satisfy the conditions $x_1 + x_2 +...+ x_m = 0$ and $\frac{x^2_1 + x^2_2 + ...+ x^2_m}{m}= c$. Find max $(x_1, x_2,..., x_m)$ if it is known to be as small as possible.
Find the number of ways to color $n \times m$ board with white and black
colors such that any $2 \times 2$ square contains the same number of black and white cells.
Find the sum of all positive integers $B$ such that $(111)_B=(aabbcc)_6$, where $a,b,c$ represent distinct base $6$ digits, $a\neq 0$.
Let $A$ and $E$ be opposite vertices of an octagon. A frog starts at vertex $A.$ From any vertex except $E$ it jumps to one of the two adjacent vertices. When it reaches $E$ it stops. Let $a_n$ be the number of distinct paths of exactly $n$ jumps ending at $E$. Prove that: \[ a_{2n-1}=0, \quad a_{2n}={(2+\sqrt2)^{n-1} - (2-\sqrt2)^{n-1} \over\sqrt2}. \]
For a fixed integer $k$, determine all polynomials $f(x)$ with integer coefficients such that $f(n)$ divides $(n!)^k$ for every positive integer $n$.
Let $n$ be a positive integer. Let $D_n$ be the set of all divisors of $n$ and let $f(n)$ denote the smallest natural $m$ such that the elements of $D_n$ are pairwise distinct in mod $m$. Show that there exists a natural $N$ such that for all $n \geq N$, one has $f(n) \leq n^{0.01}$.
Determine all $6$-tuples $(p,q,r,x,y,z)$ where $p,q,r$ are prime, and $x,y,z$ natural numbers such that $p^{2x}=q^yr^z+1$.
A positive integer $N$ has $20$ digits when written in base $9$ and $13$ digits when written in base $27$. How many digits does $N$ have when written in base $3$?
[i]Proposed by Aaron Lin[/i]
Let $S_n=\int_0^{\pi} \sin ^ n x\ dx\ (n=1,\ 2,\ ,\ \cdots).$ Find $\lim_{n\to\infty} nS_nS_{n+1}.$
Find all functions $f : R \to R$ such that $f(2xy) + f(f(x + y)) = xf(y) + yf(x) + f(x + y)$ for all real numbers $x$ and $y$.
$2021$ points are marked on a circle. $2021$ segments with marked endpoints are drawn. After that one counts the number of different points where some $2$ drawn segments intersect(endpoints of segments do [b]not[/b] count as intersections)
Find the maximum number one can get.
Let $p$ and $n$ be positive integers, with $p\geq2$, and let $a$ be a real number such that $1\leq a<a+n\leq p$. Prove that the set
\[ \mathcal {S}=\left\{\left\lfloor \log_{2}x\right\rfloor +\left\lfloor \log_{3}x\right\rfloor +\cdots+\left\lfloor \log_{p}x\right\rfloor\mid x\in\mathbb{R},a\leq x\leq a+n\right\} \]
has exactly $n+1$ elements.
For a real number $a$, let $F_a(x)=\sum_{n\geq 1}n^ae^{2n}x^{n^2}$ for $0\leq x<1$. Find a real number $c$ such that
\begin{align*}
\lim_{x\to 1^-}F_a(x)e^{-1/(1-x)}&=0 \ \ \ \text{for all $a<c$, and}\\
\lim_{x\to 1^-}F_a(x)e^{-1/(1-x)}&=\infty \ \ \ \text{for all $a>c$.}
\end{align*}
Let $a_n$ be a sequence of reals. Suppose $\sum a_n$ converges. Do these sums converge aswell?
(a) $a_1+a_2+(a_4+a_3)+(a_8+...+a_5)+(a_{16}+...+a_9)+...$
(b) ${a_1+a_2+(a_3)+(a_4)+(a_5+a_7)+(a_6+a_8)+(a_9+a_{11}+a_{13}+a_{15})+(a_{10}+a_{12}+a_{14}+a_{16})+(a_{17}+a_{19}+...}$
$N$ children no two of the same height stand in a line. The following two-step procedure is applied: first, the line is split into the least possible number of groups so that in each group all children are arranged from the left to the right in ascending order of their heights (a group may consist of a single child). Second, the order of children in each group is reversed, so now in each group the children stand in descending order of their heights. Prove that in result of applying this procedure $N - 1$ times the children in the line would stand from the left to the right in descending order of their heights.
[i](12 points)[/i]
Find all positive integers $n$ for which it is possible to partition a regular $n$-gon into triangles with diagonals not intersecting inside the $n$-gon such that at every vertex of the $n$-gon an odd number of triangles meet.
On the plane are given four distinct points $A,B,C,D$ on a line $g$ in this order, at the mutual distances $AB = a, BC = b, CD = c$.
(a) Construct (if possible) a point $P$ outside line $g$ such that $\angle APB =\angle BPC =\angle CPD$.
(b) Prove that such a point $P$ exists if and only if $ (a+b)(b+c) < 4ac$
Prove that there exist infinitely many pairs of different positive integers $(m, n)$ for which $m!n!$ is a square of an integer.
[i]Proposed by Anton Trygub[/i]
Let $S$ be a string of $99$ characters, $66$ of which are $A$ and $33$ are $B$. We call $S$ [i]good[/i] if, for each $n$ such that $1\le n \le 99$, the sub-string made from the first $n$ characters of $S$ has an odd number of distinct permutations. How many good strings are there? Which strings are good?
Find all $(x,y,n) \in {\mathbb{N}}^3$ such that $\gcd(x, n+1)=1$ and $x^{n}+1=y^{n+1}$.
A point-sized cue ball is fired in a straight path from the center of a regular hexagonal billiards table of side length $1$. If it is not launched directly into a pocket but travels an integer distance before falling into one of the pockets (located in the corners), find the minimum distance that it could have traveled.
$ n>2$ is an integer such that $ n^2$ can be represented as a difference of cubes of 2 consecutive positive integers. Prove that $ n$ is a sum of 2 squares of positive integers, and that such $ n$ does exist.
Find the volume of the solid generated by a rotation of the region enclosed by the curve $y=x^3-x$ and the line $y=x$ about the line $y=x$ as the axis of rotation.
Find the greatest positive integer $A$ with the following property: For every permutation of $\{1001,1002,...,2000\}$ , the sum of some ten consecutive terms is great than or equal to $A$.
Find all functions $f: \mathbb{Q}\to \mathbb{Q}$ such that for all $x,y \in \mathbb{Q}$: \[f(x+y)+f(x-y)=2(f(x)+f(y)).\]