Found problems: 5802
There are 100 points on a circle that are about to be colored in two colors: red or blue. Find the largest number $k$ such that no matter how I select and color $k$ points, you can always color the remaining $100-k$ points such that you can connect 50 pairs of points of the same color with lines in a way such that no two lines intersect.
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all $x,y\in \mathbb{R}$:
$$f\left(f(x)^2-y^2\right)^2+f(2xy)^2=f\left(x^2+y^2\right)^2$$
[i]Proposed by Ali Behrouz - Mojtaba Zare Bidaki[/i]
Let $n \geq 2$ be a given integer
$a)$ Prove that one can arrange all the subsets of the set $\{1,2... ,n\}$ as a sequence of subsets $A_{1}, A_{2},\cdots , A_{2^{n}}$, such that $|A_{i+1}| = |A_{i}| + 1$ or $|A_{i}| - 1$ where $i = 1,2,3,\cdots , 2^{n}$ and $A_{2^{n} + 1} = A_{1}$
$b)$ Determine all possible values of the sum $\sum \limits_{i = 1}^{2^n} (-1)^{i}S(A_{i})$ where $S(A_{i})$ denotes the sum of all elements in $A_{i}$ and $S(\emptyset) = 0$, for any subset sequence $A_{1},A_{2},\cdots ,A_{2^n}$ satisfying the condition in $a)$
In the notebooks of Peter and Nick, two numbers are written. Initially, these two numbers are 1 and 2 for Peter and 3 and 4 for Nick. Once a minute, Peter writes a quadratic trinomial $f(x)$, the roots of which are the two numbers in his notebook, while Nick writes a quadratic trinomial $g(x)$ the roots of which are the numbers in [i]his[/i] notebook. If the equation $f(x)=g(x)$ has two distinct roots, one of the two boys replaces the numbers in his notebook by those two roots. Otherwise, nothing happens. If Peter once made one of his numbers 5, what did the other one of his numbers become?
Prove that $n^4 + 4^{n}$ is composite for all values of $n$ greater than $1$.
Let $n\ge 3$ be an integer, and let $a_2,a_3,\ldots ,a_n$ be positive real numbers such that $a_{2}a_{3}\cdots a_{n}=1$. Prove that
\[(1 + a_2)^2 (1 + a_3)^3 \dotsm (1 + a_n)^n > n^n.\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]
Let $n \in \mathbb{N}^+,$ $x_1,x_2,...,x_{n+1},p,q\in \mathbb{R}^+ $ , $p<q$ and $x^p_{n+1}>\sum_{i=1}^{n}x^p_{i}.$ Prove that
$(1)x^q_{n+1}>\sum_{i=1}^{n}x^q_{i};$
$(2)\left(x^p_{n+1}-\sum_{i=1}^{n}x^p_{i}\right)^{\frac{1}{p}}<\left(x^q_{n+1}-\sum_{i=1}^{n}x^q_{i}\right)^{\frac{1}{q}}.$
Find all functions $f : \mathbb{Z} \to \mathbb{Z}$ such that:
- $f$ is strictly increasing,
- there exists $M \in \mathbb{N}$ such that $f(x+1) - f(x) < M$ for all $x \in \mathbb{N}$,
- for every $x \in \mathbb{Z}$, there exists $y \in \mathbb{Z}$ such that
\[
f(y) = \frac{f(x) + f(x + 2024)}{2}.
\]
[i]Proposed by Pavle Martinović[/i]
$n$ positive numbers are given. Is it always possible to find a convex polygon with $n+3$ edges and a triangulation of it so that the length of the diameters used in the triangulation are the given $n$ numbers?
[i]Proposed by Morteza Saghafian[/i]
For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$
[i]Proposed by Shahjalal Shohag, Bangladesh[/i]
Integers are written in the cells of a table $2010 \times 2010$. Adding $1$ to all the numbers in a row or in a column is called a [i]move[/i]. We say that a table is [i]equilibrium[/i] if one can obtain after finitely many moves a table in which all the numbers are equal.
[list=a]
[*]Find the largest positive integer $n$, for which there exists an [i]equilibrium[/i] table containing the numbers $2^0, 2^1, \ldots , 2^n$.
[*] For this $n$, find the maximal number that may be contained in such a table.
[/list]
The Bank of Pittsburgh issues coins that have a heads side and a tails side. Vera has a row of 2023 such coins alternately tails-up and heads-up, with the leftmost coin tails-up.
In a [i]move[/i], Vera may flip over one of the coins in the row, subject to the following rules:
[list=disc]
[*] On the first move, Vera may flip over any of the $2023$ coins.
[*] On all subsequent moves, Vera may only flip over a coin adjacent to the coin she flipped on the previous move. (We do not consider a coin to be adjacent to itself.)
[/list]
Determine the smallest possible number of moves Vera can make to reach a state in which every coin is heads-up.
[i]Luke Robitaille[/i]
Prove that there exist infinitely many pairs $(a, b)$ of relatively prime positive integers such that \[\frac{a^{2}-5}{b}\;\; \text{and}\;\; \frac{b^{2}-5}{a}\] are both positive integers.
Given a convex polyhedron with an even number of edges.
Prove that we can attach an arrow to each edge, such that for every vertex of the polyhedron, the number of the arrows ending in this vertex is even.
For an integer $n \geq 5,$ two players play the following game on a regular $n$-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the $n$-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of $n$ does the player making the first move have a winning strategy?
$\boxed{A3}$The sequence $a_1,a_2,a_3,...$ is defined by $a_1=a_2=1,a_{2n+1}=2a_{2n}-a_n$ and $a_{2n+2}=2a_{2n+1}$ for $n\in{N}.$Prove that if $n>3$ and $n-3$ is divisible by $8$ then $a_n$ is divisible by $5$
We call a permutation $ \left(a_1, a_2, ..., a_n\right)$ of $ \left(1, 2, ..., n\right)$ [i]quadratic[/i] if there exists at least a perfect square among the numbers $ a_1$, $ a_1 \plus{} a_2$, $ ...$, $ a_1 \plus{} a_2 \plus{} ... \plus{} a_n$. Find all natural numbers $ n$ such that all permutations in $ S_n$ are quadratic.
[i]Remark.[/i] $ S_{n}$ denotes the $ n$-th symmetric group, the group of permutations on $ n$ elements.
What is $\frac{2+4+6}{1+3+5}-\frac{1+3+5}{2+4+6}$?
$\textbf{(A) }-1\qquad\textbf{(B) }\frac5{36}\qquad\textbf{(C) }\frac7{12}\qquad\textbf{(D) }\frac{49}{20}\qquad\textbf{(E) }\frac{43}3$
Determine, with proof, all positive integers $k$ such that $$\frac{1}{n+1} \sum_{i=0}^n \binom{n}{i}^k$$ is an integer for every positive integer $n.$
Given a positive integer number $k$, define the function $f$ on the set of all positive integer numbers to itself by
\[f(n)=\begin{cases}1, &\text{if }n\le k+1\\ f(f(n-1))+f(n-f(n-1)), &\text{if }n>k+1\end{cases}\]
Show that the preimage of every positive integer number under $f$ is a finite non-empty set of consecutive positive integers.
Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f(f(n))+f(n)=2n+2001 \text{ or }2n+2002.\]
Given is an integer sequence $\{a_n\}_{n \ge 0}$ such that $a_{0}=2$, $a_{1}=3$ and, for all positive integers $n \ge 1$, $a_{n+1}=2a_{n-1}$ or $a_{n+1}= 3a_{n} - 2a_{n-1}$. Does there exist a positive integer $k$ such that $1600 < a_{k} < 2000$?
Find all functions $f: \mathbb{Q^+} \rightarrow \mathbb{Q}$ satisfying $f(x)+f(y)= \left(f(x+y)+\frac{1}{x+y} \right) (1-xy+f(xy))$ for all $x, y \in \mathbb{Q^+}$.
Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$.
Prove that Sisyphus cannot reach the aim in less than
\[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \]
turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )
Consider the sequence $(a_n)_{n\geqslant 1}$ defined by $a_1=1/2$ and $2n\cdot a_{n+1}=(n+1)a_n.$[list=a]
[*]Determine the general formula for $a_n.$
[*]Let $b_n=a_1+a_2+\cdots+a_n.$ Prove that $\{b_n\}-\{b_{n+1}\}\neq \{b_{n+1}\}-\{b_{n+2}\}.$
[/list]