We call a natural number 3-partite if the set of its divisors can be partitioned into 3 subsets each with the same sum. Show that there exist infinitely many 3-partite numbers.

Let be a group and two coprime natural numbers $ m,n. $ Show that if the applications $ G\ni x\mapsto x^{m+1},x^{n+1} $ are surjective endomorphisms, then the group is commutative.

Determine the last two digits of the product of the squares of all positive odd integers less than $2014$.

Determine all positive integers $n$ for which there exists an integer $m$ such that $2^{n}-1$ divides $m^{2}+9$.

Let $n$ be a positive integer and $G$ be a finite group of order $n.$ A function $f:G \to G$ has the $(P)$ property if $f(xyz)=f(x)f(y)f(z)~\forall~x,y,z \in G.$ $\textbf{(a)}$ If $n$ is odd, prove that every function having the $(P)$ property is an endomorphism. $\textbf{(b)}$ If $n$ is even, is the conclusion from $\textbf{(a)}$ still true?

[b]7.[/b] Find the finite groups having only one proper maximal subgroup. [b](A.12)[/b]

Show that there is an unique group $ G $ (up to isomorphism) of order $ 1986 $ which has the property that there is at most one subgroup of it having order $ n, $ for every natural number $ n. $

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.

a) Find two sets $X,Y$ such that $X\cap Y =\emptyset$, $X\cup Y = \mathbb Q^{\star}_{+}$ and $Y = \{a\cdot b \mid a,b \in X \}$. b) Find two sets $U,V$ such that $U\cap V =\emptyset$, $U\cup V = \mathbb R$ and $V = \{x+y \mid x,y \in U \}$.

Let $ G$ and $ H$ be countable Abelian $ p$-groups ($ p$ an arbitrary prime). Suppose that for every positive integer $ n$, \[ p^nG \not\equal{} p^{n\plus{}1}G .\] Prove that $ H$ is a homomorphic image of $ G$. [i]M. Makkai[/i]

Each vertex of a finite graph can be coloured either black or white. Initially all vertices are black. We are allowed to pick a vertex $P$ and change the colour of $P$ and all of its neighbours. Is it possible to change the colour of every vertex from black to white by a sequence of operations of this type? Note: A finite graph consists of a finite set of vertices and a finite set of edges between vertices. If there is an edge between vertex $A$ and vertex $B,$ then $A$ and $B$ are neighbours of each other.

Denote by $S_n$ the group of permutations of the sequence $(1,2,\dots,n).$ Suppose that $G$ is a subgroup of $S_n,$ such that for every $\pi\in G\setminus\{e\}$ there exists a unique $k\in \{1,2,\dots,n\}$ for which $\pi(k)=k.$ (Here $e$ is the unit element of the group $S_n.$) Show that this $k$ is the same for all $\pi \in G\setminus \{e\}.$

We define a relation between subsets of $\mathbb R ^n$. $A \sim B\Longleftrightarrow$ we can partition $A,B$ in sets $A_1,\dots,A_n$ and $B_1,\dots,B_n$(i.e $\displaystyle A=\bigcup_{i=1} ^n A_i,\ B=\bigcup_{i=1} ^n B_i, A_i\cap A_j=\emptyset,\ B_i\cap B_j=\emptyset$) and $A_i\simeq B_i$. Say the the following sets have the relation $\sim$ or not ? a) Natural numbers and composite numbers. b) Rational numbers and rational numbers with finite digits in base 10. c) $\{x\in\mathbb Q|x<\sqrt 2\}$ and $\{x\in\mathbb Q|x<\sqrt 3\}$ d) $A=\{(x,y)\in\mathbb R^2|x^2+y^2<1\}$ and $A\setminus \{(0,0)\}$

Prove that existence of a constant $c$ with the following property: for every composite integer $n$, there exists a group whose order is divisible by $n$ and is less than $n^c$, and that contains no element of order $n$. [P. P. Palfy]

Let $n \geq 4$ be an even natural number and $G$ be a subgroup of $GL_2(\mathbb{C})$ with $|G| = n.$ Prove that there exists $H \leq G$ such that $\{ I_2 \} \neq H$ and $H \neq G$ such that $XYX^{-1} \in H, \: \forall X \in G$ and $\forall Y \in H$

In the questions below: $G$ is a finite group; $H \leq G$ a subgroup of $G; |G : H |$ the index of $H$ in $G; |X |$ the number of elements of $X \subseteq G; Z (G)$ the center of $G; G'$ the commutator subgroup of $G; N_{G}(H )$ the normalizer of $H$ in $G; C_{G}(H )$ the centralizer of $H$ in $G$; and $S_{n}$ the $n$-th symmetric group. Let $H \leq G$ and $a, b \in G.$ Prove that $|aH \cap Hb|$ is either zero or a divisor of $|H |.$

Suppose there exists a group with exactly $n$ subgroups of index 2. Prove that there exists a finite abelian group $G$ that has exactly $n$ subgroups of index 2.

For a finite group $G$ we denote by $n(G)$ the number of elements of the group and by $s(G)$ the number of subgroups of it. Decide whether the following statements are true or false. a) For every $a>0$ the is a finite group $G$ with $\frac{n(G)}{s(G)}<a.$ b) For every $a>0$ the is a finite group $G$ with $\frac{n(G)}{s(G)}>a.$

Let $x_1,\ldots,x_n$ be a sequence with each term equal to $0$ or $1$. Form a triangle as follows: its first row is $x_1,\ldots,x_n$ and if a row if $a_1, a_2, \ldots, a_m$, then the next row is $a_1 + a_2, a_2 + a_3, \ldots, a_{m-1} + a_m$ where the addition is performed modulo $2$ (so $1+1=0$). For example, starting from $1$, $0$, $1$, $0$, the second row is $1$, $1$, $1$, the third one is $0$, $0$ and the fourth one is $0$. A sequence is called good it is the same as the sequence formed by taking the last element of each row, starting from the last row (so in the above example, the sequence is $1010$ and the corresponding sequence from last terms is $0010$ and they are not equal in this case). How many possibilities are there for the sequence formed by taking the first element of each row, starting from the last row, which arise from a good sequence?

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)

A sequence of numbers $a_1, a_2 , \dots a_m$ is a [i]geometric sequence modulo n of length m[/i] for $n,m \in \mathbb{Z}^+$ if for every index $i$, $a_i \in \{ 0, 1, 2, \dots , m-1\}$ and there exists an integer $k$ such that $n | a_{j+1} - ka_{j}$ for $1 \leq j \leq m-1$. How many geometric sequences modulo $14$ of length $14$ are there?

Let be a natural number $ n\ge 2, $ a group $ G $ and two elements of it $ e_1,e_2 $ such that $ e_2e_1x=xe_2e_1, $ for any element $ x $ of $ G. $ Prove that $ \left( e_1xe_2 \right)^n =e_1x^ne_2, $ for any element $ x $ of $ G, $ if and only if $ e_2e_1=\left( e_2e_1\right)^n. $ [i]Ion Bursuc[/i]

Let A be a symmetric matrix such that the sum of elements of any row is zero. Show that all elements in the main diagonal of cofator matrix of A are equal.

Let $G$ be a group and $n \ge 2$ be an integer. Let $H_1, H_2$ be $2$ subgroups of $G$ that satisfy $$[G: H_1] = [G: H_2] = n \text{ and } [G: (H_1 \cap H_2)] = n(n-1).$$ Prove that $H_1, H_2$ are conjugate in $G.$ Official definitions: $[G:H]$ denotes the index of the subgroup of $H,$ i.e. the number of distinct left cosets $xH$ of $H$ in $G.$ The subgroups $H_1, H_2$ are conjugate if there exists $g \in G$ such that $g^{-1} H_1 g = H_2.$

Let $G$ be a group and $H$ a proper subgroup. If there exist three group homomorphisms $f,g,h:G\rightarrow G$ such that $f(xy)=g(x)h(y)$ for all $x,y\in G\setminus H$, prove that: [list=a] [*] $g=h$. [*] If $G$ is noncommutative and $H=Z(G)$, then $f=g=h$.