Found problems: 5802
On a table there is a pile with $ T$ tokens which incrementally shall be converted into piles with three tokens each. Each step is constituted of selecting one pile removing one of its tokens. And then the remaining pile is separated into two piles. Is there a sequence of steps that can accomplish this process?
a.) $ T \equal{} 1000$ (Cono Sur)
b.) $ T \equal{} 2001$ (BWM)
Let $P \in \mathbb{R}[x]$. Suppose that the multiset of real roots (where roots are counted with multiplicity) of $P(x)-x$ and $P^3(x)-x$ are distinct. Prove that for all $n\in \mathbb{N}$, $P^n(x)-x$ has at least $\sigma(n)-2$ distinct real roots.
(Here $P^n(x):=P(P^{n-1}(x))$ with $P^1(x) = P(x)$, and $\sigma(n)$ is the sum of all positive divisors of $n$).
[i]Proposed by Malay Mahajan[/i]
Suppose we have a simple polygon (that is it does not intersect itself, but not necessarily convex).
Show that this polygon has a diameter which is completely inside the polygon and the two arcs it creates on the polygon perimeter (the two arcs have 2 vertices in common) both have at least one third of the vertices of the polygon.
Let $\tau(n)$ be the number of positive divisors of $n$. Let $\tau_1(n)$ be the number of positive divisors of $n$ which have remainders $1$ when divided by $3$. Find all positive integral values of the fraction $\frac{\tau(10n)}{\tau_1(10n)}$.
Let $\mathbb{R}^{+}$ denote the set of all positive real numbers. Find all functions $f:\mathbb{R}^{+}\longrightarrow \mathbb{R}$ satisfying
\[f(x)+f(y)\le \frac{f(x+y)}{2}, \frac{f(x)}{x}+\frac{f(y)}{y}\ge \frac{f(x+y)}{x+y},\]
for all $x, y\in \mathbb{R}^{+}$.
A function $ f: R^3\rightarrow R$ for all reals $ a,b,c,d,e$ satisfies a condition:
\[ f(a,b,c)\plus{}f(b,c,d)\plus{}f(c,d,e)\plus{}f(d,e,a)\plus{}f(e,a,b)\equal{}a\plus{}b\plus{}c\plus{}d\plus{}e\]
Show that for all reals $ x_1,x_2,\ldots,x_n$ ($ n\geq 5$) equality holds:
\[ f(x_1,x_2,x_3)\plus{}f(x_2,x_3,x_4)\plus{}\ldots \plus{}f(x_{n\minus{}1},x_n,x_1)\plus{}f(x_n,x_1,x_2)\equal{}x_1\plus{}x_2\plus{}\ldots\plus{}x_n\]
Adithya and Bill are playing a game on a connected graph with $n > 2$ vertices, two of which are labeled $A$ and $B$, so that $A$ and $B$ are distinct and non-adjacent and known to both players. Adithya starts on vertex $A$ and Bill starts on $B$. Each turn, both players move simultaneously: Bill moves to an adjacent vertex, while Adithya may either move to an adjacent vertex or stay at his current vertex. Adithya loses if he is on the same vertex as Bill, and wins if he reaches $B$ alone. Adithya cannot see where Bill is, but Bill can see where Adithya is. Given that Adithya has a winning strategy, what is the maximum possible number of edges the graph may have? (Your answer may be in terms of $n$.)
[i]Proposed by Steven Liu[/i]
Determine all primes $p$ such that $5^p + 4 p^4$ is a perfect square, i.e., the square of an integer.
Define the sequence $a_1 = 2$ and $a_n = 2^{a_{n-1}} + 2$ for all integers $n \ge 2$. Prove that $a_{n-1}$ divides $a_n$ for all integers $n \ge 2$.
[i]Proposed by Sam Korsky[/i]
A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$.
(a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced.
(b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$.
[i]Proposed by Jorge Tipe, Peru[/i]
Let $1=d_1<d_2<\ldots<d_{2m}=n$ be the divisors of a positive integer $n$, where $n$ is not a perfect square. Consider the determinant
$$D=\begin{vmatrix}n+d_1&n&\ldots&n\\n&n+d_2&\ldots&n\\\ldots&\ldots&&\ldots\\n&n&\ldots&n+d_{2m}\end{vmatrix}.$$
(a) Prove that $n^m$ divides $D$.
(b) Prove that $1+d_1+d_2+\ldots+d_{2m}$ divides $D$.
Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that
$$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$
for all positive integers $n$. Show that $a_{2022}\leq 1$.
Let $P(n)$ be a quadratic trinomial with integer coefficients. For each positive integer $n$, the number $P(n)$ has a proper divisor $d_n$, i.e., $1<d_n<P(n)$, such that the sequence $d_1,d_2,d_3,\ldots$ is increasing. Prove that either $P(n)$ is the product of two linear polynomials with integer coefficients or all the values of $P(n)$, for positive integers $n$, are divisible by the same integer $m>1$.
In a $100\times 100$ table $110$ unit squares are marked. Is it always possible to rearrange rows and columns so that all the marked unit squares
are above the main diagonal or on it?
Given a circle and $2006$ points lying on this circle. Albatross colors these $2006$ points in $17$ colors. After that, Frankinfueter joins some of the points by chords such that the endpoints of each chord have the same color and two different chords have no common points (not even a common endpoint). Hereby, Frankinfueter intends to draw as many chords as possible, while Albatross is trying to hinder him as much as he can. What is the maximal number of chords Frankinfueter will always be able to draw?
A sequence $ a_1, a_2, a_3, \ldots$ is defined recursively by $ a_1 \equal{} 1$ and $ a_{2^k\plus{}j} \equal{} \minus{}a_j$ $ (j \equal{} 1, 2, \ldots, 2^k).$ Prove that this sequence is not periodic.
Let $f: Z ^+ \to R$, such that $f (1) = 2018$ and $f (1) + f (2) + ...+ f (n) = n^2f (n)$, for all $n> 1$. Find the value $f (2017)$.
Prove that for all positive integer $n$, there is a positive integer $m$ that $7^n | 3^m +5^m -1$.
The sequence $\{a_{n}\}_{n \ge 1}$ is defined by $a_{1}=1$ and \[a_{n+1}= \frac{a_{n}}{2}+\frac{1}{4a_{n}}\; (n \in \mathbb{N}).\] Prove that $\sqrt{\frac{2}{2a_{n}^{2}-1}}$ is a positive integer for $n>1$.
A function $f(\theta)$ satisfies the following conditions $(a),(b)$.
$(a)\ f(\theta)\geq 0$
$(b)\ \int_0^{\pi} f(\theta)\sin \theta d\theta =1$
Prove the following inequality.
\[\int_0^{\pi} f(\theta)\sin n\theta \ d\theta \leq n\ (n=1,2,\cdots)\]
Let $\mathbb{P}$ be the set of positive rational numbers and let $f:\mathbb{P}\to\mathbb{P}$ be such that $$f(x)+f\left(\frac{1}{x}\right)=1$$ and $$f(2x)=2f(f(x))$$ for all $x\in\mathbb{P}$.
Find, with proof, an explicit expression for $f(x)$ for all $x\in \mathbb{P}$.
Let $n>1$ be an integer and $a,b,c$ be three complex numbers such that $a+b+c=0$ and $a^n+b^n+c^n=0$. Prove that two of $a,b,c$ have the same magnitude.
[i]Evan O'Dorney.[/i]
Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]
Find all positive integers $a$ such that for any positive integer $n\ge 5$ we have $2^n-n^2\mid a^n-n^a$.
Find all positive integers $n \geqslant 2$ for which there exist $n$ real numbers $a_1<\cdots<a_n$ and a real number $r>0$ such that the $\tfrac{1}{2}n(n-1)$ differences $a_j-a_i$ for $1 \leqslant i<j \leqslant n$ are equal, in some order, to the numbers $r^1,r^2,\ldots,r^{\frac{1}{2}n(n-1)}$.