Found problems: 5802
Let $ G$ be finite group and $ \mathcal{K}$ a conjugacy class of $ G$ that generates $ G$. Prove that the following two statements are equivalent:
(1) There exists a positive integer $ m$ such that every element of $ G$ can be written as a product of $ m$ (not necessarily distinct) elements of $ \mathcal{K}$.
(2) $ G$ is equal to its own commutator subgroup.
[i]J. Denes[/i]
Let $n$ and $k$ be positive integers with $k<n$. Let $P(x)$ be a polynomial of degree $n$ with real coefficients, nonzero constant term, and no repeated roots. Suppose that for any real numbers $a_0,\,a_1,\,\ldots,\,a_k$ such that the polynomial $a_kx^k+\cdots+a_1x+a_0$ divides $P(x)$, the product $a_0a_1\cdots a_k$ is zero. Prove that $P(x)$ has a nonreal root.
We have $ n \geq 2$ lamps $ L_{1}, . . . ,L_{n}$ in a row, each of them being either on or off. Every second we simultaneously modify the state of each lamp as follows: if the lamp $ L_{i}$ and its neighbours (only one neighbour for $ i \equal{} 1$ or $ i \equal{} n$, two neighbours for other $ i$) are in the same state, then $ L_{i}$ is switched off; – otherwise, $ L_{i}$ is switched on.
Initially all the lamps are off except the leftmost one which is on.
$ (a)$ Prove that there are infinitely many integers $ n$ for which all the lamps will eventually be off.
$ (b)$ Prove that there are infinitely many integers $ n$ for which the lamps will never be all off.
Prove that $2^{2^{n}}+2^{2^{{n-1}}}+1$ has at least $n$ distinct prime divisors.
For 3 real numbers $a,b,c$ let $s_n=a^{n}+b^{n}+c^{n}$.
It is known that $s_1=2$, $s_2=6$ and $s_3=14$.
Prove that for all natural numbers $n>1$, we have $|s^2_n-s_{n-1}s_{n+1}|=8$
Prove that for each $n \ge 3$ there exist $n$ distinct positive divisors $d_1,d_2, ...,d_n$ of $n!$ such that $n! = d_1 +d_2 +...+d_n$.
Let $2\mathbb{Z} + 1$ denote the set of odd integers. Find all functions $f:\mathbb{Z} \mapsto 2\mathbb{Z} + 1$ satisfying \[ f(x + f(x) + y) + f(x - f(x) - y) = f(x+y) + f(x-y) \] for every $x, y \in \mathbb{Z}$.
Given a positive integer $n$, find the proportion of the subsets of $\{1,2, \ldots, 2n\}$ such that their smallest element is odd.
Let k be a positive integer. Find the number of non-negative integers n less than or equal to $10^k$ satisfying the following conditions:
(i) n is divisible by 3;
(ii) Each decimal digit of n is one of the digits 2,0,1 or 7.
Alexander and Louise are a pair of burglars. Every morning, Louise steals one third of Alexander's money, but feels remorse later in the afternoon and gives him half of all the money she has. If Louise has no money at the beginning and starts stealing on the first day, what is the least positive integer amount of money Alexander must have so that at the end of the 2012th day they both have an integer amount of money?
Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that $f(0)\neq 0$ and for all $x,y\in\mathbb{R}$,
\[ f(x+y)^2 = 2f(x)f(y) + \max \left\{ f(x^2+y^2), f(x^2)+f(y^2) \right\}. \]
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]
There is a box with 2020 stones. Ana and Beto alternately play removing stones from the box and starting with Ana. Each player in turn must remove a positive number of stones that is capicua. Whoever leaves the box empty wins. Determine which of the two has a strategy winner and explain what that strategy is.
$Note: $ A positive integer is capicua if it can be read equally from right to right. left and left to right. For example, 3, 22, 484 and 2002 are capicuas.
Determine all functions $f : \mathbb{R}^2 \to\mathbb {R}$ for which \[f(A)+f(B)+f(C)+f(D)=0,\]whenever $A,B,C,D$ are the vertices of a square with side-length one.
[i]Ilir Snopce[/i]
Let $\mathbb{N}$ denote the set of natural numbers. Define a function $T:\mathbb{N}\rightarrow\mathbb{N}$ by $T(2k)=k$ and $T(2k+1)=2k+2$. We write $T^2(n)=T(T(n))$ and in general $T^k(n)=T^{k-1}(T(n))$ for any $k>1$.
(i) Show that for each $n\in\mathbb{N}$, there exists $k$ such that $T^k(n)=1$.
(ii) For $k\in\mathbb{N}$, let $c_k$ denote the number of elements in the set $\{n: T^k(n)=1\}$. Prove that $c_{k+2}=c_{k+1}+c_k$, for $k\ge 1$.
Show that there are infinitely many positive integer numbers $n$ such that $n^2+1$ has two positive divisors whose difference is $n$.
Determine all composite integers $n>1$ that satisfy the following property: if $d_1$, $d_2$, $\ldots$, $d_k$ are all the positive divisors of $n$ with $1 = d_1 < d_2 < \cdots < d_k = n$, then $d_i$ divides $d_{i+1} + d_{i+2}$ for every $1 \leq i \leq k - 2$.
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]
For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$
We define a sequence $a_n$ so that $a_0=1$ and
\[a_{n+1} = \begin{cases} \displaystyle \frac{a_n}2 & \textrm { if } a_n \equiv 0 \pmod 2, \\ a_n + d & \textrm{ otherwise. } \end{cases} \]
for all postive integers $n$.
Find all positive integers $d$ such that there is some positive integer $i$ for which $a_i=1$.
For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$
Let $({{x}_{n}}),({{y}_{n}})$ be two positive sequences defined by ${{x}_{1}}=1,{{y}_{1}}=\sqrt{3}$ and
\[ \begin{cases} {{x}_{n+1}}{{y}_{n+1}}-{{x}_{n}}=0 \\ x_{n+1}^{2}+{{y}_{n}}=2 \end{cases} \] for all $n=1,2,3,\ldots$.
Prove that they are converges and find their limits.
Let $S_n$ denote the set of all permutations of the numbers $1,2,\dots,n.$ For $\pi\in S_n,$ let $\sigma(\pi)=1$ if $\pi$ is an even permutation and $\sigma(\pi)=-1$ if $\pi$ is an odd permutation. Also, let $v(\pi)$ denote the number of fixed points of $\pi.$ Show that
\[ \sum_{\pi\in S_n}\frac{\sigma(\pi)}{v(\pi)+1}=(-1)^{n+1}\frac{n}{n+1}. \]
Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$
An $n\times n$ chessboard is given, where $n$ is an even positive integer. On every line, the unit squares are to be permuted, subject to the condition that the resulting table has to be symmetric with respect to its main diagonal (the diagonal from the top-left corner to the bottom-right corner). We say that a board is [i]alternative[/i] if it has at least one pair of complementary lines (two lines are complementary if the unit squares on them which lie on the same column have distinct colours). Otherwise, we call the board [i]nonalternative[/i]. For what values of $n$ do we always get from the $n\times n$ chessboard an alternative board?\\ \\
[i](Alexandru Petrescu and Andra Elena Mircea)[/i]