This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 183

2006 Romania National Olympiad, 3

Let $\displaystyle G$ be a finite group of $\displaystyle n$ elements $\displaystyle ( n \geq 2 )$ and $\displaystyle p$ be the smallest prime factor of $\displaystyle n$. If $\displaystyle G$ has only a subgroup $\displaystyle H$ with $\displaystyle p$ elements, then prove that $\displaystyle H$ is in the center of $\displaystyle G$. [i]Note.[/i] The center of $\displaystyle G$ is the set $\displaystyle Z(G) = \left\{ a \in G \left| ax=xa, \, \forall x \in G \right. \right\}$.

2007 Romania National Olympiad, 3

Let $n\geq 1$ be an integer. Find all rings $(A,+,\cdot)$ such that all $x\in A\setminus\{0\}$ satisfy $x^{2^{n}+1}=1$.

1952 Miklós Schweitzer, 4

Let $ K$ be a finite field of $ p$ elements, where $ p$ is a prime. For every polynomial $ f(x)\equal{}\sum_{i\equal{}0}^na_ix^i$ ($ \in K[x]$) put $ \overline{f(x)}\equal{}\sum_{i\equal{}0}^n a_ix^{p^i}$. Prove that for any pair of polynomials $ f(x),g(x)\in K[x]$, $ \overline{f(x)}|\overline{g(x)}$ if and only if $ f(x)|g(x)$.

1983 Miklós Schweitzer, 8

Prove that any identity that holds for every finite $ n$-distributive lattice also holds for the lattice of all convex subsets of the $ (n\minus{}1)$-dimensional Euclidean space. (For convex subsets, the lattice operations are the set-theoretic intersection and the convex hull of the set-theoretic union. We call a lattice $ n$-$ \textit{distributive}$ if \[ x \wedge (\bigvee_{i\equal{}0}^n y_i)\equal{}\bigvee_{j\equal{}0}^n(x \wedge (\bigvee_{0\leq i \leq n, \;i \not\equal{} j\ }y_i))\] holds for all elements of the lattice.) [i]A. Huhn[/i]

1970 Miklós Schweitzer, 2

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]

2008 IMS, 5

Prove that there does not exist a ring with exactly 5 regular elements. ($ a$ is called a regular element if $ ax \equal{} 0$ or $ xa \equal{} 0$ implies $ x \equal{} 0$.) A ring is not necessarily commutative, does not necessarily contain unity element, or is not necessarily finite.

2012 Romania National Olympiad, 4

[color=darkred] Let $m$ and $n$ be two nonzero natural numbers. Determine the minimum number of distinct complex roots of the polynomial $\prod_{k=1}^m\, (f+k)$ , when $f$ covers the set of $n^{\text{th}}$ - degree polynomials with complex coefficients. [/color]

1985 Iran MO (2nd round), 6

In The ring $\mathbf R$, we have $\forall x \in \mathbf R : x^2=x$. Prove that in this ring [b]i)[/b] Every element is equals to its additive inverse. [b]ii)[/b] This ring has commutative property.

2007 IMS, 6

Let $R$ be a commutative ring with 1. Prove that $R[x]$ has infinitely many maximal ideals.

1979 Miklós Schweitzer, 2

Let $ \Gamma$ be a variety of monoids such that not all monoids of $ \Gamma$ are groups. Prove that if $ A \in \Gamma$ and $ B$ is a submonoid of $ A$, there exist monoids $ S \in \Gamma$ and $ C$ and epimorphisms $ \varphi : S \rightarrow A, \;\varphi_1 : S \rightarrow C$ such that $ ((e)\varphi_1^{\minus{}1})\varphi\equal{}B$ ($ e$ is the identity element of $ C$). [i]L. Marki[/i]

2018 Brazil Undergrad MO, 7

Unless of isomorphisms, how many simple four-vertex graphs are there?

2014 IMS, 3

Let $R$ be a commutative ring with $1$ such that the number of elements of $R$ is equal to $p^3$ where $p$ is a prime number. Prove that if the number of elements of $\text{zd}(R)$ be in the form of $p^n$ ($n \in \mathbb{N^*}$) where $\text{zd}(R) = \{a \in R \mid \exists 0 \neq b \in R, ab = 0\}$, then $R$ has exactly one maximal ideal.

1982 Miklós Schweitzer, 2

Consider the lattice of all algebraically closed subfields of the complex field $ \mathbb{C}$ whose transcendency degree (over $ \mathbb{Q}$) is finite. Prove that this lattice is not modular. [i]L. Babai[/i]

2001 District Olympiad, 2

Let $K$ commutative field with $8$ elements. Prove that $(\exists)a\in K$ such that $a^3=a+1$. [i]Mircea Becheanu[/i]

2003 District Olympiad, 1

Let $(G,\cdot)$ be a finite group with the identity element, $e$. The smallest positive integer $n$ with the property that $x^{n}= e$, for all $x \in G$, is called the [i]exponent[/i] of $G$. (a) For all primes $p \geq 3$, prove that the multiplicative group $\mathcal G_{p}$ of the matrices of the form $\begin{pmatrix}\hat 1 & \hat a & \hat b \\ \hat 0 & \hat 1 & \hat c \\ \hat 0 & \hat 0 & \hat 1 \end{pmatrix}$, with $\hat a, \hat b, \hat c \in \mathbb Z \slash p \mathbb Z$, is not commutative and has [i]exponent[/i] $p$. (b) Prove that if $\left( G, \circ \right)$ and $\left( H, \bullet \right)$ are finite groups of [i]exponents[/i] $m$ and $n$, respectively, then the group $\left( G \times H, \odot \right)$ with the operation given by $(g,h) \odot \left( g^\prime, h^\prime \right) = \left( g \circ g^\prime, h \bullet h^\prime \right)$, for all $\left( g,h \right), \, \left( g^\prime, h^\prime \right) \in G \times H$, has the [i]exponent[/i] equal to $\textrm{lcm}(m,n)$. (c) Prove that any $n \geq 3$ is the [i]exponent[/i] of a finite, non-commutative group. [i]Ion Savu[/i]

2010 IMC, 3

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\}.$

2014 Contests, 3

Let $R$ be a commutative ring with $1$ such that the number of elements of $R$ is equal to $p^3$ where $p$ is a prime number. Prove that if the number of elements of $\text{zd}(R)$ be in the form of $p^n$ ($n \in \mathbb{N^*}$) where $\text{zd}(R) = \{a \in R \mid \exists 0 \neq b \in R, ab = 0\}$, then $R$ has exactly one maximal ideal.

2008 Gheorghe Vranceanu, 2

Prove that the only morphisms from a finite symmetric group to the multiplicative group of rational numbers are the identity and the signature.

2003 IMC, 2

Let $a_1, a_2,...,a_{51}$ be non-zero elements of a field of characteristic $p$. We simultaneously replace each element with the sum of the 50 remaining ones. In this way we get a sequence $b_1, ... , b_{51}$. If this new sequence is a permutation of the original one, find all possible values of $p$.

2014 Miklós Schweitzer, 6

Let $\rho:G\to GL(V)$ be a representation of a finite $p$-group $G$ over a field of characteristic $p$. Prove that if the restriction of the linear map $\sum_{g\in G} \rho(g)$ to a finite dimensional subspace $W$ of $V$ is injective, then the subspace spanned by the subspaces $\rho(g)W$ $(g\in G)$ is the direct sum of these subspaces.

1985 Miklós Schweitzer, 6

Determine all finite groups $G$ that have an automorphism $f$ such that $H\not\subseteq f(H)$ for all proper subgroups $H$ of $G$. [B. Kovacs]

2015 District Olympiad, 4

Let $ m $ be a non-negative ineger, $ n\ge 2 $ be a natural number, $ A $ be a ring which has exactly $ n $ elements, and an element $ a $ of $ A $ such that $ 1-a^k $ is invertible, for all $ k\in\{ m+1,m+2,...,m+n-1\} . $ Prove that $ a $ is nilpotent.

2020 Candian MO, 5#

If A,B are invertible and the set {A<sup>k</sup> - B<sup>k</sup> | k is a natural number} is finite , then there exists a natural number m such that A<sup>m</sup> = B<sup>m</sup>.

2010 Romania National Olympiad, 3

Let $G$ be a finite group of order $n$. Define the set \[H=\{x:x\in G\text{ and }x^2=e\},\] where $e$ is the neutral element of $G$. Let $p=|H|$ be the cardinality of $H$. Prove that a) $|H\cap xH|\ge 2p-n$, for any $x\in G$, where $xH=\{xh:h\in H\}$. b) If $p>\frac{3n}{4}$, then $G$ is commutative. c) If $\frac{n}{2}<p\le\frac{3n}{4}$, then $G$ is non-commutative. [i]Marian Andronache[/i]

2006 Pre-Preparation Course Examination, 3

a) If $K$ is a finite extension of the field $F$ and $K=F(\alpha,\beta)$ show that $[K: F]\leq [F(\alpha): F][F(\beta): F]$ b) If $gcd([F(\alpha): F],[F(\beta): F])=1$ then does the above inequality always become equality? c) By giving an example show that if $gcd([F(\alpha): F],[F(\beta): F])\neq 1$ then equality might happen.