Found problems: 5802
For all real numbers $x$, we denote by $\lfloor x \rfloor$ the largest integer that does not exceed $x$. Find all functions $f$ that are defined on the set of all real numbers, take real values, and satisfy the equality
\[f(x + y) = (-1)^{\lfloor y \rfloor} f(x) + (-1)^{\lfloor x \rfloor} f(y)\]
for all real numbers $x$ and $y$.
[i]Navneel Singhal, India[/i]
Let $ f(x) \equal{} x^2 \plus{} 2007x \plus{} 1$. Prove that for every positive integer $ n$, the equation $ \underbrace{f(f(\ldots(f}_{n\ {\rm times}}(x))\ldots)) \equal{} 0$ has at least one real solution.
Cards numbered from 1 to $2^n$ are distributed among $k$ children, $1\leq k\leq 2^n$, so that each child gets at least one card. Prove that the number of ways to do that is divisible by $2^{k-1}$ but not by $2^k$.
[i] M. Ivanov [/i]
Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties:
[list=disc]
[*]every term in the sequence is less than or equal to $2^{2023}$, and
[*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\]
[/list]
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[ 2, \; 2^2, \; 2^{2^2}, \; 2^{2^{2^2}}, \ldots (\mbox{mod} \; n) \] is eventually constant.
[The tower of exponents is defined by $a_1 = 2, \; a_{i+1} = 2^{a_i}$. Also $a_i \; (\mbox{mod} \; n)$ means the remainder which results from dividing $a_i$ by $n$.]
For all natural $n$, an $n$-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second row, and so on, up to $n$ squares in the $n^{th}$ row, such that all the left-most squares in each row are aligned vertically.
Let $f(n)$ denote the minimum number of square tiles requires to tile the $n$-staircase, where the side lengths of the square tiles can be any natural number. e.g. $f(2)=3$ and $f(4)=7$.
(a) Find all $n$ such that $f(n)=n$.
(b) Find all $n$ such that $f(n) = n+1$.
For a nonnegative integer $n$ define $\operatorname{rad}(n)=1$ if $n=0$ or $n=1$, and $\operatorname{rad}(n)=p_1p_2\cdots p_k$ where $p_1<p_2<\cdots <p_k$ are all prime factors of $n$. Find all polynomials $f(x)$ with nonnegative integer coefficients such that $\operatorname{rad}(f(n))$ divides $\operatorname{rad}(f(n^{\operatorname{rad}(n)}))$ for every nonnegative integer $n$.
Suppose that $n$ people each know exactly one piece of information, and all $n$ pieces are different. Every time person $A$ phones person $B$, $A$ tells $B$ everything that $A$ knows, while $B$ tells $A$ nothing. What is the minimum number of phone calls between pairs of people needed for everyone to know everything? Prove your answer is a minimum.
Find the smallest positive constant $c$ satisfying: For any simple graph $G=G(V,E)$, if $|E|\geq c|V|$, then $G$ contains $2$ cycles with no common vertex, and one of them contains a chord.
Note: The cycle of graph $G(V,E)$ is a set of distinct vertices ${v_1,v_2...,v_n}\subseteq V$, $v_iv_{i+1}\in E$ for all $1\leq i\leq n$ $(n\geq 3, v_{n+1}=v_1)$; a cycle containing a chord is the cycle ${v_1,v_2...,v_n}$, such that there exist $i,j, 1< i-j< n-1$, satisfying $v_iv_j\in E$.
There are $n \geq 1$ notebooks, numbered from $1$ to $n$, stacked in a pile. Zahar repeats the following operation: he randomly chooses a notebook whose number $k$ does not correspond to its location in this stack, counting from top to bottom, and returns it to the $k$th position, counting from the top, without changing the location of the other notebooks. If there is no such notebook, he stops.
Is it guaranteed that Zahar will arrange all the notebooks in ascending order of numbers in a finite number of operations?
[i]Proposed by Zahar Naumets[/i]
Prove that there is a unique $1000$-digit number $N$ in base $2022$ with the following properties:
[list=1]
[*] All of the digits of $N$ (in base $2022$) are $1$’s or $2$’s, and [/*]
[*] $N$ is a multiple of the base-$10$ number $2^{1000}$. [/*]
[/list]
(Note that you must prove both that such a number exists and that there is not more than one such number. You do not have to write down the number! In fact, please don’t!)
Determine all natural numbers $n$ such that for each natural number $a$ relatively prime with $n$ and $a \le 1 + \left\lfloor \sqrt{n} \right\rfloor$ there exists some integer $x$ with $a \equiv x^2 \mod n$.
Remark: "Natural numbers" is the set of positive integers.
Let $ \left( x_n\right)_{n\ge 1} $ be a sequence of integers defined recursively as $ x_{n+2}=5x_{n+1}-x_n. $
Prove that $ \left( x_n\right)_{n\ge 1} $ has a subsequence whose terms are multiples of $ 22 $ if $ \left( x_n\right)_{n\ge 1} $ has a term that is multiple of $ 22. $
We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof.
Prove that $F_{n-1}F_{n}F_{n+1}L_{n-1}L_{n}L_{n+1}(n \geq 2)$ is not a perfect square.
Real numbers $ a_{1}$, $ a_{2}$, $ \ldots$, $ a_{n}$ are given. For each $ i$, $ (1 \leq i \leq n )$, define
\[ d_{i} \equal{} \max \{ a_{j}\mid 1 \leq j \leq i \} \minus{} \min \{ a_{j}\mid i \leq j \leq n \}
\]
and let $ d \equal{} \max \{d_{i}\mid 1 \leq i \leq n \}$.
(a) Prove that, for any real numbers $ x_{1}\leq x_{2}\leq \cdots \leq x_{n}$,
\[ \max \{ |x_{i} \minus{} a_{i}| \mid 1 \leq i \leq n \}\geq \frac {d}{2}. \quad \quad (*)
\]
(b) Show that there are real numbers $ x_{1}\leq x_{2}\leq \cdots \leq x_{n}$ such that the equality holds in (*).
[i]Author: Michael Albert, New Zealand[/i]
Let $a_1,a_2,\dots$ be a sequence of integers satisfying $a_1=2$ and:
$$a_n=\begin{cases}a_{n-1}+1, & \text{ if }n\ne a_k \text{ for some }k=1,2,\dots,n-1; \\ a_{n-1}+2, & \text{ if } n=a_k \text{ for some }k=1,2,\dots,n-1. \end{cases}$$
Find the value of $a_{2022!}$.
Find all functions $f$ from the reals to the reals such that \[ \left(f(x)+f(z)\right)\left(f(y)+f(t)\right)=f(xy-zt)+f(xt+yz) \] for all real $x,y,z,t$.
Let $ G$ be a simple graph with $ 2 \cdot n$ vertices and $ n^{2}+1$ edges. Show that this graph $ G$ contains a $ K_{4}-\text{one edge}$, that is, two triangles with a common edge.
Define a [b]ring[/b] in the plane to be the set of points at a distance of at least $r$ and at most $R$ from a specific point $O$, where $r<R$ are positive real numbers. Rings are determined by the three parameters $(O, R, r)$. The area of a ring is labeled $S$. A point in the plane for which both its coordinates are integers is called an integer point.
[b]a)[/b] For each positive integer $n$, show that there exists a ring not containing any integer point, for which $S>3n$ and $R<2^{2^n}$.
[b]b)[/b] Show that each ring satisfying $100\cdot R<S^2$ contains an integer point.
Prove the inequality:
\[\sum_{i < j}{\frac {a_{i}a_{j}}{a_{i} \plus{} a_{j}}}\leq \frac {n}{2(a_{1} \plus{} a_{2} \plus{}\cdots \plus{} a_{n})}\cdot \sum_{i < j}{a_{i}a_{j}}\]
for positive reals $ a_{1},a_{2},\ldots,a_{n}$.
[i]Proposed by Dusan Dukic, Serbia[/i]
Let $a_1,...,a_n$ be $n$ real numbers. If for each odd positive integer $k\leqslant n$ we have $a_1^k+a_2^k+\ldots+a_n^k=0$, then for each odd positive integer $k$ we have $a_1^k+a_2^k+\ldots+a_n^k=0$.
[i]Proposed by M. Didin[/i]
Prove that if $ p$ is a prime number, then $ 7p+3^{p}-4$ is not a perfect square.
Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as
\begin{align*}
(x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z)
\end{align*}
with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.
Let $a_1,a_2,a_3,\ldots,a_{250}$ be real numbers such that $a_1=2$ and
$$a_{n+1}=a_n+\frac{1}{a_n^2}$$
for every $n=1,2, \ldots, 249$. Let $x$ be the greatest integer which is less than
$$\frac{1}{a_1}+\frac{1}{a_2}+\ldots+\frac{1}{a_{250}}$$
How many digits does $x$ have?
[i]Proposed by Miroslav Marinov, Bulgaria[/i]
for any positive integer $n$ greater than $1$, show that
\[2^n<\binom{2n}{n}<\frac{2^n}{\prod\limits_{i=0}^{n-1} \left(1-\frac{i}{n}\right)}\]