Found problems: 5802
Let $p(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a monic polynomial of degree $n>2$, with real coefficients and all its roots real and different from zero. Prove that for all $k=0,1,2,\cdots,n-2$, at least one of the coefficients $a_k,a_{k+1}$ is different from zero.
Given a sequence $a_n$:
\[ 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, \dots \] (one '1', two '2' and so on) and another sequence $b_n$ such that $a_{b_n}=b_{a_n}$ for all positive integers $n$. It is known that $b_k=1$ for some $k>100$. Prove that $b_m=1$ for all $m>k$.
An $n\times n\times n$ cube is divided into unit cubes. We are given a closed non-self-intersecting polygon (in space), each of whose sides joins the centers of two unit cubes sharing a common face. The faces of unit cubes which intersect the polygon are said to be distinguished. Prove that the edges of the unit cubes may be colored in two colors so that each distinguished face has an odd number of edges of each color, while each nondistinguished face has an even number of edges of each color.
[i]M. Smurov[/i]
Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers.
[i]Proposed by Dorlir Ahmeti, Albania[/i]
An [i]$n$-type triangle[/i] where $n\geqslant 2$ is formed by the cells of a $(2n+1)\times(2n+1)$ board, situated under both main diagonals. For instance, a $3$-type triangle looks like this:[img]https://i.ibb.co/k4fmwWY/Screenshot-2024-07-31-153932.png[/img]Determine the maximal length of a sequence with pairwise distinct cells in an $n$-type triangle, such that, beggining with the second one, any cell of the sequence has a common side with the previous one.
[i]Cristi Săvescu[/i]
Suppose $f:\mathbb{R} \to \mathbb{R}$ is a function such that
\[|f(x+y)-f(x)-f(y)|\le 1\ \ \ \text{for all} \ \ x, y \in\mathbb R.\]
Prove that there is a function $g:\mathbb{R}\to\mathbb{R}$ such that $|f(x)-g(x)|\le 1$ and $g(x+y)=g(x)+g(y)$ for all $x,y \in\mathbb R.$
Let $a$ be a positive integer which is not a perfect square, and consider the equation \[k = \frac{x^2-a}{x^2-y^2}.\] Let $A$ be the set of positive integers $k$ for which the equation admits a solution in $\mathbb Z^2$ with $x>\sqrt{a}$, and let $B$ be the set of positive integers for which the equation admits a solution in $\mathbb Z^2$ with $0\leq x<\sqrt{a}$. Show that $A=B$.
Let $p > 3$ be a prime number, and let $F_p$ denote the (fi nite) set of residue classes modulo $p$.
Let $S_d$ denote the set of $2$-variable polynomials $P(x, y)$ with coefficients in $F_p$, total degree $\le d$, and satisfying $P(x, y) = P(y,- x -y)$. Show that $$|S_d| = p^{\lceil (d+1)(d+2)/6 \rceil}$$.
[i]The total degree of a $2$-variable polynomial $P(x, y)$ is the largest value of $i + j$ among monomials $x^iy^j$
[/i] appearing in $P$.
Let $2\mathbb{Z} + 1$ denote the set of odd integers. Find all functions $f:\mathbb{Z} \mapsto 2\mathbb{Z} + 1$ satisfying \[ f(x + f(x) + y) + f(x - f(x) - y) = f(x+y) + f(x-y) \] for every $x, y \in \mathbb{Z}$.
Let $f : [0, 1] \to \mathbb R$ be continuous and satisfy:
\[ \begin{cases}bf(2x) = f(x), &\mbox{ if } 0 \leq x \leq 1/2,\\ f(x) = b + (1 - b)f(2x - 1), &\mbox{ if } 1/2 \leq x \leq 1,\end{cases}\]
where $b = \frac{1+c}{2+c}$, $c > 0$. Show that $0 < f(x)-x < c$ for every $x, 0 < x < 1.$
Prove for any $M>2$, there exists an increasing sequence of positive integers $a_1<a_2<\ldots $ satisfying:
1) $a_i>M^i$ for any $i$;
2) There exists a positive integer $m$ and $b_1,b_2,\ldots ,b_m\in\left\{ -1,1\right\}$, satisfying $n=a_1b_1+a_2b_2+\ldots +a_mb_m$ if and only if $n\in\mathbb{Z}/ \{0\}$.
Let $a_1,\ldots , a_{p-2}{}$ be nonzero residues modulo an odd prime $p{}$. For every $d\mid p - 1$ there are at least $\lfloor(p - 2)/d\rfloor$ indices $i{}$ for which $p{}$ does not divide $a_i^d-1$. Prove that the product of some of $a_1,\ldots , a_{p-2}$ gives the remainder two modulo $p{}$.
[b]10.[/b] Prove that if a graph with $2n+1$ vertices has at least $3n+1$ edges, then the graph contains a circuit having an even number of edges. Prove further that this statemente does not hold for $3n$ edges. (By a circuit, we mean a closed line which does not intersect itself.) [b](C. 5)[/b]
(a) Find all positive integers $ n$ for which $ 2^n\minus{}1$ is divisible by $ 7$.
(b) Prove that there is no positive integer $ n$ for which $ 2^n\plus{}1$ is divisible by $ 7$.
Find all pairs of positive integers $(a, b)$, such that $S(a^{b+1})=a^b$, where $S(m)$ denotes the digit sum of $m$.
Sofiya and Marquis are playing a game. Sofiya announces to Marquis that she's thinking of a polynomial of the form $f(x)=x^3+px+q$ with three integer roots that are not necessarily distinct. She also explains that all of the integer roots have absolute value less than (and not equal to) $N$, where $N$ is some fixed number which she tells Marquis. As a "move" in this game, Marquis can ask Sofiya about any number $x$ and Sofiya will tell him whether $f(x)$ is positive negative, or zero. Marquis's goal is to figure out Sofiya's polynomial.
If $N=3\cdot 2^k$ for some positive integer $k$, prove that there is a strategy which allows Marquis to identify the polynomial after making at most $2k+1$ "moves".
For positive integer $n \ge 3$, find the number of ordered pairs $(a_1, a_2, ... , a_n)$ of integers that satisfy the following two conditions
[list=disc]
[*]For positive integer $i$ such that $1\le i \le n$, $1 \le a_i \le i$
[*]For positive integers $i,j,k$ such that $1\le i < j < k \le n$, if $a_i = a_j$ then $a_j \ge a_k$
[/list]
Let $k, m, n$ be integers such that $1<n\le m-1 \le k$. Determine the maximum size of a subset $S$ of the set $\{ 1,2, \cdots, k \}$ such that no $n$ distinct elements of $S$ add up to $m$.
Evaluate the infinite product
\[
\prod_{k = 2}^{\infty} \left( 1 - 4 \sin^2 \frac{\pi}{3\cdot 2^{k}} \right) .
\]
On some planet, there are $2^N$ countries $(N \geq 4).$ Each country has a flag $N$ units wide and one unit high composed of $N$ fields of size $1 \times 1,$ each field being either yellow or blue. No two countries have the same flag. We say that a set of $N$ flags is diverse if these flags can be arranged into an $N \times N$ square so that all $N$ fields on its main diagonal will have the same color. Determine the smallest positive integer $M$ such that among any $M$ distinct flags, there exist $N$ flags forming a diverse set.
[i]Proposed by Tonći Kokan, Croatia[/i]
Find all functions $f:\mathbb{Q}^{+} \to \mathbb{Q}^{+}$ such that for all $x\in \mathbb{Q}^+$: [list] [*] $f(x+1)=f(x)+1$, [*] $f(x^2)=f(x)^2$. [/list]
Graphistan has $2011$ cities and Graph Air (GA) is running one-way flights between all pairs of these cities. Determine the maximum possible value of the integer $k$ such that no matter how these flights are arranged it is possible to travel between any two cities in Graphistan riding only GA flights as long as the absolute values of the difference between the number of flights originating and terminating at any city is not more than $k.$
$\{a_{n}\}_{n\geq 0}$ and $\{b_{n}\}_{n\geq 0}$ are two sequences of positive integers that $a_{i},b_{i}\in \{0,1,2,\cdots,9\}$. There is an integer number $M$ such that $a_{n},b_{n}\neq 0$ for all $n\geq M$ and for each $n\geq 0$
$$(\overline{a_{n}\cdots a_{1}a_{0}})^{2}+999 \mid(\overline{b_{n}\cdots b_{1}b_{0}})^{2}+999 $$
prove that $a_{n}=b_{n}$ for $n\geq 0$.\\
(Note that $(\overline{x_nx_{n-1}\dots x_0}) = 10^n\times x_n + \dots + 10\times x_1 + x_0$.)
[i]Proposed by Yahya Motevassel[/i]
Let $a_1,a_2,\ldots,a_n$ be a finite sequence of non negative integers, its subsequences are the sequences of the form $a_i,a_{i+1},\ldots,a_j$ with $1\le i\le j \le n$. Two subsequences are said to be equal if they have the same length and have the same terms, that is, two subsequences $a_i,a_{i+1},\ldots,a_j$ and $a_u,a_{u+1},\ldots a_v$ are equal iff $j-i=u-v$ and $a_{i+k}=a_{u+k}$ forall integers $k$ such that $0\le k\le j-1$. Finally, we say that a subsequence $a_i,a_{i+1},\ldots,a_j$ is palindromic if $a_{i+k}=a_{j-k}$ forall integers $k$ such that $0\le k \le j-i$
What is the greatest number of different palindromic subsequences that can a palindromic sequence of length $n$ contain?
At a math contest there are $2n$ students participating. Each of them submits a problem to the jury, which thereafter gives each students one of the $2n$ problems submitted. One says that the contest is [i]fair[/i] is there are $n$ participants which receive their problems from the other $n$ participants.
Prove that the number of distributions of the problems in order to obtain a fair contest is a perfect square.