Found problems: 5802
Let $f(x)$ be a continuous function such that $f(2x^2-1)=2xf(x)$ for all $x$. Show that $f(x)=0$ for $-1\le x \le 1$.
Call a positive integer [i]challenging[/i] if it can be expressed as $2^a(2^b+1)$, where $a,b$ are positive integers. Prove that if $X$ is a set of challenging numbers smaller than $2^n (n$ is a given positive integer) and $|X|\ge \frac{4}{3}(n-1)$, there exist two disjoint subsets $A,B\subset X$ such that $|A|=|B|$ and $\sum_{a\in A}a=\sum_{b \in B}b$.
Let $n$ be a positive integer prove that $$6\nmid \lfloor (\sqrt[3]{28}-3)^{-n} \rfloor.$$
Let $A_1A_2\dotsm A_{2025}$ be a convex 2025-gon, and let $A_i = A_{i+2025}$ for all integers $i$. Distinct points $P$ and $Q$ lie in its interior such that $\angle A_{i-1}A_iP = \angle QA_iA_{i+1}$ for all $i$. Define points $P^{j}_{i}$ and $Q^{j}_{i}$ for integers $i$ and positive integers $j$ as follows:
[list]
[*] For all $i$, $P^1_i = Q^1_i = A_i$.
[*] For all $i$ and $j$, $P^{j+1}_{i}$ and $Q^{j+1}_i$ are the circumcenters of $PP^j_iP^j_{i+1}$ and $QQ^j_iQ^{j}_{i+1}$, respectively.
[/list]
Let $\mathcal{P}$ and $\mathcal{Q}$ be the polygons $P^{2025}_{1}P^{2025}_{2}\dotsm P^{2025}_{2025}$ and $Q^{2025}_{1}Q^{2025}_{2}\dotsm Q^{2025}_{2025}$, respectively.
[list=a]
[*] Prove that $\mathcal{P}$ and $\mathcal{Q}$ are cyclic.
[*] Let $O_P$ and $O_Q$ be the circumcenters of $\mathcal{P}$ and $\mathcal{Q}$, respectively. Assuming that $O_P\neq O_Q$, show that $O_PO_Q$ is parallel to $PQ$.
[/list]
[i]Ruben Carpenter[/i]
Find all prime numbers $p$ for which there exist positive integers $x$, $y$, and $z$ such that the number
$x^p + y^p + z^p - x - y - z$
is a product of exactly three distinct prime numbers.
Let $P(x)$ be a polynomial of degree $n$ with real coefficients and let $a\geq 3$. Prove that
\[\max_{0\leq j \leq n+1}\left | a^j-P(j) \right |\geq 1\]
Start with a finite sequence $ a_1,a_2,\dots,a_n$ of positive integers. If possible, choose two indices $ j < k$ such that $ a_j$ does not divide $ a_k$ and replace $ a_j$ and $ a_k$ by $ \gcd(a_j,a_k)$ and $ \text{lcm}\,(a_j,a_k),$ respectively. Prove that if this process is repeated, it must eventually stop and the final sequence does not depend on the choices made. (Note: $ \gcd$ means greatest common divisor and lcm means least common multiple.)
We define an operation $\oplus$ on the set $\{0, 1\}$ by
\[ 0 \oplus 0 = 0 \,, 0 \oplus 1 = 1 \,, 1 \oplus 0 = 1 \,, 1 \oplus 1 = 0 \,.\]
For two natural numbers $a$ and $b$, which are written in base $2$ as $a = (a_1a_2 \ldots a_k)_2$ and $b = (b_1b_2 \ldots b_k)_2$ (possibly with leading 0's), we define $a \oplus b = c$ where $c$ written in base $2$ is $(c_1c_2 \ldots c_k)_2$ with $c_i = a_i \oplus b_i$, for $1 \le i \le k$. For example, we have $7 \oplus 3 = 4$ since $ 7 = (111)_2$ and $3 = (011)_2$.
For a natural number $n$, let $f(n) = n \oplus \left[ n/2 \right]$, where $\left[ x \right]$ denotes the largest integer less than or equal to $x$. Prove that $f$ is a bijection on the set of natural numbers.
Find all prime numbers $p$ for which there exist positive integers $x$, $y$, and $z$ such that the number
$x^p + y^p + z^p - x - y - z$
is a product of exactly three distinct prime numbers.
The number 2021 is fantabulous. For any positive integer $m$, if any element of the set $\{m, 2m+1, 3m\}$ is fantabulous, then all the elements are fantabulous. Does it follow that the number $2021^{2021}$ is fantabulous?
We have $n$ keys, each of them belonging to exactly one of $n$ locked chests. Our goal is to decide which key opens which chest. In one try we may choose a key and a chest, and check whether the chest can be opened with the key. Find the minimal number $p(n)$ with the property that using $p(n)$ tries, we can surely discover which key belongs to which chest.
Let $A$ be an infinite set of positive integers such that every $n \in A$ is the product of at most $1987$ prime numbers. Prove that there is an infinite set $B \subset A$ and a number $p$ such that the greatest common divisor of any two distinct numbers in $B$ is $p.$
Given 2005 distinct numbers $a_1,\,a_2,\dots,a_{2005}$. By one question, we may take three different indices $1\le i<j<k\le 2005$ and find out the set of numbers $\{a_i,\,a_j,\,a_k\}$ (unordered, of course). Find the minimal number of questions, which are necessary to find out all numbers $a_i$.
Define the [i]mexth[/i] of \(k\) sets as the \(k\)th smallest positive integer that none of them contain, if it exists. Does there exist a family \(\mathcal F\) of sets of positive integers such that [list] [*]for any nonempty finite subset \(\mathcal G\) of \(\mathcal F\), the mexth of \(\mathcal G\) exists, and [*]for any positive integer \(n\), there is exactly one nonempty finite subset \(\mathcal G\) of \(\mathcal F\) such that \(n\) is the mexth of \(\mathcal G\). [/list]
[i]Proposed by Espen Slettnes[/i]
Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that
$$f(x + f(y)) = f(x) + f(y)$$
for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.
Prove that for all positive integers $n$, $1^3 + 2^3 + 3^3 +\dots+n^3$ is a perfect square.
Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties:
(a) if $x\le y$, then $f(x)\le f(y)$; and
(b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$.
Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$.
[i](United Kingdom) Ben Elliott[/i]
A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation
$$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$
Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.
Denote by $\mathbb{S}$ the set of all proper subsets of $\mathbb{Z}_{>0}$. Find all functions $f : \mathbb{S} \mapsto \mathbb{Z}_{>0}$ that satisfy the following:\\
[color=#FFFFFF]___[/color]1. For all sets $A, B \in \mathbb{S}$ we have \[f(A \cap B) = \text{min}(f(A), f(B)).\]
[color=#FFFFFF]___[/color]2. For all positive integers $n$ we have \[\sum \limits_{X \subseteq [1, n]}
f(X) = 2^{n+1}-1.\]
(Here, by a proper subset $X$ of $\mathbb{Z}_{>0}$ we mean $X \subset \mathbb{Z}_{>0}$ with $X \ne \mathbb{Z}_{>0}$. It is allowed for $X$ to have infinite size.) \\
[i]Proposed by MV Adhitya, Kanav Talwar, Siddharth Choppara, Archit Manas[/i]
How many words with $n$ digits can be formed from the alphabet $\{0, 1, 2, 3, 4\}$, if neighboring digits must differ by exactly one?
[i]Proposed by Germany, FR.[/i]
Take $k\in \mathbb{Z}_{\ge 1}$ and the sets $A_1,A_2,\dots, A_k$ consisting of $x_1,x_2,\dots ,x_k$ positive integers, respectively. For any two sets $A$ and $B$, define $A+B=\{a+b~|~a\in A,~b\in B\}$.
Find the least and greatest number of elements the set $A_1+A_2+\dots +A_k$ may have.
[i] (Andrei Bâra)[/i]
On a flat plane in Camelot, King Arthur builds a labyrinth $\mathfrak{L}$ consisting of $n$ walls, each of which is an infinite straight line. No two walls are parallel, and no three walls have a common point. Merlin then paints one side of each wall entirely red and the other side entirely blue.
At the intersection of two walls there are four corners: two diagonally opposite corners where a red side and a blue side meet, one corner where two red sides meet, and one corner where two blue sides meet. At each such intersection, there is a two-way door connecting the two diagonally opposite corners at which sides of different colours meet.
After Merlin paints the walls, Morgana then places some knights in the labyrinth. The knights can walk through doors, but cannot walk through walls.
Let $k(\mathfrak{L})$ be the largest number $k$ such that, no matter how Merlin paints the labyrinth $\mathfrak{L},$ Morgana can always place at least $k$ knights such that no two of them can ever meet. For each $n,$ what are all possible values for $k(\mathfrak{L}),$ where $\mathfrak{L}$ is a labyrinth with $n$ walls?
Show that $ \frac{1}{2^2} +\frac{1}{3^2} +...+\frac{1}{n^2} <\frac{2}{3}$ for all $n \ge 2 $.
Let $n$ to be a positive integer. Given a set $\{ a_1, a_2, \ldots, a_n \} $ of integers, where $a_i \in \{ 0, 1, 2, 3, \ldots, 2^n -1 \},$ $\forall i$, we associate to each of its subsets the sum of its elements; particularly, the empty subset has sum of its elements equal to $0$. If all of these sums have different remainders when divided by $2^n$, we say that $\{ a_1, a_2, \ldots, a_n \} $ is [i]$n$-complete[/i].
For each $n$, find the number of [i]$n$-complete[/i] sets.
Let $ 0<a_k<1$ for $ k=1,2,... .$ Give a necessary and sufficient condition for the existence, for every $ 0<x<1$, of a permutation $ \pi_x$ of the positive integers such that \[ x= \sum_{k=1}^{\infty} \frac{a_{\pi_x}(k)}{2^k}.\]
[i]P. Erdos[/i]