Found problems: 5802
Let $ABC$ be an equilateral triangle and $n\ge 2$ be an integer. Denote by $\mathcal{A}$ the set of $n-1$ straight lines which are parallel to $BC$ and divide the surface $[ABC]$ into $n$ polygons having the same area and denote by $\mathcal{P}$ the set of $n-1$ straight lines parallel to $BC$ which divide the surface $[ABC]$ into $n$ polygons having the same perimeter.
Prove that the intersection $\mathcal{A} \cap \mathcal{P}$ is empty.
[i]Laurentiu Panaitopol[/i]
A sequence $ (S_n), n \geq 1$ of sets of natural numbers with $ S_1 = \{1\}, S_2 = \{2\}$ and
\[{ S_{n + 1} = \{k \in }\mathbb{N}|k - 1 \in S_n \text{ XOR } k \in S_{n - 1}\}.
\]
Determine $ S_{1024}.$
Let $n$ be a positive integer and $\{A,B,C\}$ a partition of $\{1,2,\ldots,3n\}$ such that $|A|=|B|=|C|=n$. Prove that there exist $x \in A$, $y \in B$, $z \in C$ such that one of $x,y,z$ is the sum of the other two.
The sequence $\{x_{n}\}_{n \ge 1}$ is defined by \[x_{1}=x_{2}=1, \; x_{n+2}= 14x_{n+1}-x_{n}-4.\] Prove that $x_{n}$ is always a perfect square.
Define $ f: \mathbb{R}\to\mathbb{R}$ by
\[ f(x)\equal{}\begin{cases}x&\text{if }x\le e\\ xf(\ln x)&\text{if }x>e\end{cases}\]
Does $ \displaystyle\sum_{n\equal{}1}^{\infty}\frac1{f(n)}$ converge?
For each positive integer $k$ find the number of solutions in nonnegative integers $x,y,z$ with $x\le y \le z$ of the equation
$$8^k=x^3+y^3+z^3-3xyz$$
Let $a_0, a_1, \ldots, a_n, a_{n+1}$ be a sequence of real numbers satisfying the following conditions:
\[a_0 = a_{n+1 }= 0,\]\[ |a_{k-1} - 2a_k + a_{k+1}| \leq 1 \quad (k = 1, 2,\ldots , n).\]
Prove that $|a_k| \leq \frac{k(n+1-k)}{2} \quad (k = 0, 1,\ldots ,n + 1).$
3. Plane is divided with horizontal and vertical lines into unit squares. Into each square we write a positive integer so that each positive integer appears exactly once. Determine whether it is possible to write numbers in such a way, that each written number is a divisor of a sum of its four neighbours.
Prove that for every non-negative integer $ n, $ there exists a non-negative integer $ m $ such that
$$ \left( 1+\sqrt{2} \right)^n=\sqrt m +\sqrt{m+1} . $$
Let $n$ be a positive integer. There are $2018n+1$ cities in the Kingdom of Sellke Arabia. King Mark wants to build two-way roads that connect certain pairs of cities such that for each city $C$ and integer $1\le i\le 2018,$ there are exactly $n$ cities that are a distance $i$ away from $C.$ (The [i]distance[/i] between two cities is the least number of roads on any path between the two cities.)
For which $n$ is it possible for Mark to achieve this?
[i]Proposed by Michael Ren[/i]
The function $f : \mathbb N \to \mathbb R$ satisfies $f(1) = 1, f(2) = 2$ and \[f (n+2) = f(n+2 - f(n+1) ) + f(n+1 - f(n) ).\] Show that $0 \leq f(n+1) - f(n) \leq 1$. Find all $n$ for which $f(n) = 1025$.
Find the number of squares in the sequence given by $ a_0\equal{}91$ and $ a_{n\plus{}1}\equal{}10a_n\plus{}(\minus{}1)^n$ for $ n \ge 0.$
Prove that there exist infinitely many positive integers $n$ such that the greatest prime divisor of $n^2+1$ is less than $n \cdot \pi^{-2019}.$
Let $n \ge 2$ be an integer. There are $n$ houses in a town. All distances between pairs of houses are different. Every house sends a visitor to the house closest to it. Find all possible values of $n$ (with full justification) for which we can design a town with $n$ houses where every house is visited.
Find all positive real numbers $r<1$ such that there exists a set $\mathcal{S}$ with the given properties:
i) For any real number $t$, exactly one of $t, t+r$ and $t+1$ belongs to $\mathcal{S}$;
ii) For any real number $t$, exactly one of $t, t-r$ and $t-1$ belongs to $\mathcal{S}$.
Let $\mathbb{Z}_{\ge 0}$ be the set of all nonnegative integers. Find all the functions $f: \mathbb{Z}_{\ge 0} \rightarrow \mathbb{Z}_{\ge 0} $ satisfying the relation
\[ f(f(f(n))) = f(n+1 ) +1 \]
for all $ n\in \mathbb{Z}_{\ge 0}$.
Define the sequence $A_1,A_2,\ldots$ of matrices by the following recurrence: $$ A_1 = \begin{pmatrix} 0 & 1 \\ 1 & 0 \\ \end{pmatrix}, \quad A_{n+1} = \begin{pmatrix} A_n & I_{2^n} \\ I_{2^n} & A_n \\ \end{pmatrix} \quad (n=1,2,\ldots) $$ where $I_m$ is the $m\times m$ identity matrix.
Prove that $A_n$ has $n+1$ distinct integer eigenvalues $\lambda_0< \lambda_1<\ldots <\lambda_n$ with multiplicities $\binom{n}{0},\binom{n}{1},\ldots,\binom{n}{n}$, respectively.
The sequence $ (a_n)$ is defined by: $ a_0\equal{}a_1\equal{}1$ and $ a_{n\plus{}1}\equal{}14a_n\minus{}a_{n\minus{}1}$ for all $ n\ge 1$.
Prove that $ 2a_n\minus{}1$ is a perfect square for any $ n\ge 0$.
Let $ n$ be a positive integer. Consider
\[ S \equal{} \left\{ (x,y,z) \mid x,y,z \in \{ 0, 1, \ldots, n\}, x \plus{} y \plus{} z > 0 \right \}
\]
as a set of $ (n \plus{} 1)^{3} \minus{} 1$ points in the three-dimensional space. Determine the smallest possible number of planes, the union of which contains $ S$ but does not include $ (0,0,0)$.
[i]Author: Gerhard Wöginger, Netherlands [/i]
In the plane are given a circle with center $ O$ and radius $ r$ and a point $ A$ outside the circle. For any point $ M$ on the circle, let $ N$ be the diametrically opposite point. Find the locus of the circumcenter of triangle $ AMN$ when $ M$ describes the circle.
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that
[list]
[*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and
[*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.
[/list]
Determine all positive integers $k$ for which there exist a positive integer $m$ and a set $S$ of positive integers such that any integer $n > m$ can be written as a sum of distinct elements of $S$ in exactly $k$ ways.
The terms of the sequence $ (a_i)$ defined by $ a_{n \plus{} 2} \equal{} \frac {a_n \plus{} 2009} {1 \plus{} a_{n \plus{} 1}}$ for $ n \ge 1$ are positive integers. Find the minimum possible value of $ a_1 \plus{} a_2$.
Let $a_0$ be an irrational number such that $0 < a_0 < \frac 12$ . Defi ne $a_n = \min \{2a_{n-1},1 - 2a_{n-1}\}$ for $n \geq 1$.
[list][b](a)[/b] Prove that $a_n < \frac{3}{16}$ for some $n$.
[b](b)[/b] Can it happen that $a_n > \frac{7}{40}$ for all $n$?[/list]
Let \( G \) be a graph colored using \( k \) colors. We say that a vertex is [b]forced[/b] if it has neighbors in all the other \( k - 1 \) colors.
Prove that for any \( 2024 \)-regular graph \( G \) that contains no triangles or quadrilaterals, there exists a coloring using \( 2025 \) colors such that at least \( 1013 \) of the colors have a forced vertex of that color.
Note: The graph coloring must be valid, this means no \( 2 \) vertices of the same color may be adjacent.