Prove that if $ n \geq 2 $ and $ I_ {1}, I_ {2}, \ldots, I_ {n} $ are idealized in a unit-element commutative ring such that any nonempty $ H \subseteq \{ 1,2, \dots, n \} $ then if $ \sum_ {h \in H} I_ {h} $ Is ideal $$ I_ {2} I_ {3} I_ {4} \dots I_ {n} + I_ {1} I_ {3} I_ {4} \dots I_ {n} + \dots + I_ {1} I_ {2} \dots I_ {n-1} $$also Is ideal.

Let $R$ be an associative non-commutative ring and let $n>2$ be a fixed natural number. Assume that $x^n=x$ for all $x\in R$. Prove that $xy^{n-1}=y^{n-1}x$ holds for all $x,y\in R$.

Let $ G$ be a group such that $ G'$ is abelian and each normal and abelian subgroup of $ G$ is finite. Prove that $ G$ is finite.

The alphabet in its natural order $\text{ABCDEFGHIJKLMNOPQRSTUVWXYZ}$ is $T_0$. We apply a permutation to $T_0$ to get $T_1$ which is $\text{JQOWIPANTZRCVMYEGSHUFDKBLX}$. If we apply the same permutation to $T_1$, we get $T_2$ which is $\text{ZGYKTEJMUXSODVLIAHNFPWRQCB}$. We continually apply this permutation to each $T_m$ to get $T_{m+1}$. Find the smallest positive integer $n$ so that $T_n=T_0$.

Let $m$ and $n$ be positive integers and $p$ be a prime number. Find the greatest positive integer $s$ (as a function of $m,n$ and $p$) such that from a random set of $mnp$ positive integers we can choose $snp$ numbers, such that they can be partitioned into $s$ sets of $np$ numbers, such that the sum of the numbers in every group gives the same remainder when divided by $p$.

If $d\in \mathbb{Q}$, is there always an $\omega \in \mathbb{C}$ such that $\omega ^n=1$ for some $n\in \mathbb{N}$ and $\mathbb{Q}(\sqrt{d})\subseteq \mathbb{Q}(\omega)$?

For every $k\leq n$ define $r_k$ the residue of $2^n$ modulo $k$. Prove that $\sum r_i> \frac{n*log_2(\frac{n}{3})}{2}-n$, for any $n\geq 2$

Compute the smallest positive integer that gives a remainder of $1$ when divided by $11$, a remainder of $2$ when divided by $21$, and a remainder of $5$ when divided by $51$. [i]2021 CCA Math Bonanza Lightning Round #3.3[/i]

Let $a_0 = 2$, $a_1 = 5$, and $a_2 = 8$, and for $n>2$ define $a_n$ recursively to be the remainder when $4(a_{n-1} + a_{n-2} + a_{n-3})$ is divided by $11$. Find $a_{2018}\cdot a_{2020}\cdot a_{2022}$.

There are $n$ boxes ${B_1},{B_2},\ldots,{B_n}$ from left to right, and there are $n$ balls in these boxes. If there is at least $1$ ball in ${B_1}$, we can move one to ${B_2}$. If there is at least $1$ ball in ${B_n}$, we can move one to ${B_{n - 1}}$. If there are at least $2$ balls in ${B_k}$, $2 \leq k \leq n - 1$ we can move one to ${B_{k - 1}}$, and one to ${B_{k + 1}}$. Prove that, for any arrangement of the $n$ balls, we can achieve that each box has one ball in it.

$ G$ is a group. Prove that the following are equivalent: 1. All subgroups of $ G$ are normal. 2. For all $ a,b\in G$ there is an integer $ m$ such that $ (ab)^m\equal{}ba$.

Let $k$, $n$ be fixed positive integers. In a circular table, there are placed pins numbered successively with the numbers $1, 2 \dots, n$, with $1$ and $n$ neighbors. It is known that pin $1$ is golden and the others are white. Arnaldo and Bernaldo play a game, in which a ring is placed initially on one of the pins and at each step it changes position. The game begins with Bernaldo choosing a starting pin for the ring, and the first step consists of the following: Arnaldo chooses a positive integer $d$ any and Bernaldo moves the ring $d$ pins clockwise or counterclockwise (positions are considered modulo $n$, i.e., pins $x$, $y$ equal if and only if $n$ divides $x-y$). After that, the ring changes its position according to one of the following rules, to be chosen at every step by Arnaldo: [b]Rule 1:[/b] Arnaldo chooses a positive integer $d$ and Bernaldo moves the ring $d$ pins clockwise or counterclockwise. [b]Rule 2:[/b] Arnaldo chooses a direction (clockwise or counterclockwise), and Bernaldo moves the ring in the chosen direction in $d$ or $kd$ pins, where $d$ is the size of the last displacement performed. Arnaldo wins if, after a finite number of steps, the ring is moved to the golden pin. Determine, as a function of $k$, the values of $n$ for which Arnaldo has a strategy that guarantees his victory, no matter how Bernaldo plays.

Find the maximal possible finite number of roots of the equation $|x-a_1|+\dots+|x-a_{50}|=|x-b_1|+\dots+|x-b_{50}|$, where $a_1,\,a_2,\,\dots,a_{50},\,b_1,\dots,\,b_{50}$ are distinct reals.

Let $n,p \geq 2$ be two integers and $A$ an $n\times n$ matrix with real elements such that $A^{p+1} = A$. a) Prove that $\textrm{rank} \left( A \right) + \textrm{rank} \left( I_n - A^p \right) = n$. b) Prove that if $p$ is prime then \[ \textrm{rank} \left( I_n - A \right) = \textrm{rank} \left( I_n - A^2 \right) = \ldots = \textrm{rank} \left( I_n - A^{p-1} \right) . \]

We say that the rank of a group $ G$ is at most $ r$ if every subgroup of $ G$ can be generated by at most $ r$ elements. Prove that here exists an integer $ s$ such that for every finite group $ G$ of rank $ 2$ the commutator series of $ G$ has length less than $ s$. [i]J. Erdos[/i]

Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$. Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have \[ n\mid a_i \minus{} b_i \minus{} c_i \] [i]Proposed by Ricky Liu & Zuming Feng, USA[/i]

Let $(A,+,\cdot)$ be a ring with unity, having the following property: for all $x\in A$ either $x^2=1$ or $x^n=0$ for some $n\in\mathbb N$. Show that $A$ is a commutative ring.

Let $ K $ be the group of Klein. Prove that: [b]a)[/b] There is an unique division ring (up to isomorphism), $ D, $ such that $ (D,+)\cong K. $ [b]b)[/b] There are no division rings $ A $ such that $ (A\setminus\{ 0\} ,+)\cong K. $

A group $ G $ of order at least $ 4 $ has the property that there exists a natural number $ n\not\in\{ 1,|G| \} $ such that $ G $ admits exactly $ \binom{|G|-1}{n-1} $ subgroups of order $ n. $ Show that $ G $ is commutative. [i]Marius Tărnăuceanu[/i]

suppose that $p$ is a prime number. find that smallest $n$ such that there exists a non-abelian group $G$ with $|G|=p^n$. SL is an acronym for Special Lesson. this year our special lesson was Groups and Symmetries. the exam time was 5 hours.

Are the groups $(\mathbb Q,+)$ and $(\mathbb Q^+,\cdot)$ isomorphic?

Let $(G, \cdot )$ be a group and $e$ an identity element. Prove that if all elements $x$ of $G$ satisfy $x\cdot x = e$ then $(G, \cdot)$ is abelian (that is, commutative).

Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$. Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have \[ n\mid a_i \minus{} b_i \minus{} c_i \] [i]Proposed by Ricky Liu & Zuming Feng, USA[/i]

Let $A$ be a subgroup of the symmetric group $S_n$, and $G$ be a normal subgroup of $A$. Show that if $G$ is transitive, then $|A\colon G|\le 5^{n-1}$ (translated by Miklós Maróti)

Let $A$ be Abelian group of order $p^4$, where $p$ is a prime number, and which has a subgroup $N$ with order $p$ such that $A/N\approx\mathbb{Z}/p^3\mathbb{Z}$. Find all $A$ expect isomorphic.