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: 339

2021 Alibaba Global Math Competition, 16

Let $G$ be a finite group, and let $H_1, H_2 \subset G$ be two subgroups. Suppose that for any representation of $G$ on a finite-dimensional complex vector space $V$, one has that \[\text{dim} V^{H_1}=\text{dim} V^{H_2},\] where $V^{H_i}$ is the subspace of $H_i$-invariant vectors in $V$ ($i=1,2$). Prove that \[Z(G) \cap H_1=Z(G) \cap H_2.\] Here $Z(G)$ denotes the center of $G$.

2008 Romania National Olympiad, 4

Let $ \mathcal G$ be the set of all finite groups with at least two elements. a) Prove that if $ G\in \mathcal G$, then the number of morphisms $ f: G\to G$ is at most $ \sqrt [p]{n^n}$, where $ p$ is the largest prime divisor of $ n$, and $ n$ is the number of elements in $ G$. b) Find all the groups in $ \mathcal G$ for which the inequality at point a) is an equality.

2004 Silk Road, 4

Natural $n \geq 2$ is given. Group of people calls $n-compact$, if for any men from group, we can found $n$ people (without he), each two of there are familiar. Find maximum $N$ such that for any $n-compact$ group, consisting $N$ people contains subgroup from $n+1$ people, each of two of there are familiar.

2010 Canada National Olympiad, 4

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.

2014 USA Team Selection Test, 3

For a prime $p$, a subset $S$ of residues modulo $p$ is called a [i]sum-free multiplicative subgroup[/i] of $\mathbb F_p$ if $\bullet$ there is a nonzero residue $\alpha$ modulo $p$ such that $S = \left\{ 1, \alpha^1, \alpha^2, \dots \right\}$ (all considered mod $p$), and $\bullet$ there are no $a,b,c \in S$ (not necessarily distinct) such that $a+b \equiv c \pmod p$. Prove that for every integer $N$, there is a prime $p$ and a sum-free multiplicative subgroup $S$ of $\mathbb F_p$ such that $\left\lvert S \right\rvert \ge N$. [i]Proposed by Noga Alon and Jean Bourgain[/i]

2014 Romania National Olympiad, 4

Let be a finite group $ G $ that has an element $ a\neq 1 $ for which exists a prime number $ p $ such that $ x^{1+p}=a^{-1}xa, $ for all $ x\in G. $ [b]a)[/b] Prove that the order of $ G $ is a power of $ p. $ [b]b)[/b] Show that $ H:=\{x\in G|\text{ord} (x)=p\}\le G $ and $ \text{ord}^2(H)>\text{ord}(G). $

2007 IMS, 1

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.

1985 Traian Lălescu, 2.3

Let $ 0\neq\varrho\in\text{Hom}\left( \mathbb{Z}_4,\mathbb{Z}_2\right) ,$ $ \text{id}\neq\iota\in\text{Aut}\left( \mathbb{Z}_4\right) ,$ $ G:=\left\{ (x,y)\in\mathbb{Z}_4^2\big|x-y\in\ker\varrho\right\} , $ and $ \rho_1,\rho_2, $ the canonic projections of $ G $ into $ \mathbb{Z}_4. $ Prove that there exists an unique $ \nu\in\text{Hom}\left( \mathbb{Z}_4,G\right) $ such that $ \rho_1\circ\nu=\text{id} $ and $ \rho_2\circ\nu =\iota . $ Determine numerically this morphism.

1985 Iran MO (2nd round), 4

Let $G$ be a group and let $a$ be a constant member of it. Prove that \[G_a = \{x | \exists n \in \mathbb Z , x=a^n\}\] Is a subgroup of $G.$

2014 South africa National Olympiad, 1

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

2021 Science ON grade XII, 2

Consider an odd prime $p$. A comutative ring $(A,+, \cdot)$ has the property that $ab=0$ implies $a^p=0$ or $b^p=0$. Moreover, $\underbrace{1+1+\cdots +1}_{p \textnormal{ times}} =0$. Take $x,y\in A$ such that there exist $m,n\geq 1$, $m\neq n$ with $x+y=x^my=x^ny$, and also $y$ is not invertible. \\ \\ $\textbf{(a)}$ Prove that $(a+b)^p=a^p+b^p$ and $(a+b)^{p^2}=a^{p^2}+b^{p^2}$ for all $a,b\in A$.\\ $\textbf{(b)}$ Prove that $x$ and $y$ are nilpotent.\\ $\textbf{(c)}$ If $y$ is invertible, does the conclusion that $x$ is nilpotent stand true? \\ \\ [i] (Bogdan Blaga)[/i]

2006 Romania National Olympiad, 1

Let $\displaystyle \mathcal K$ be a finite field. Prove that the following statements are equivalent: (a) $\displaystyle 1+1=0$; (b) for all $\displaystyle f \in \mathcal K \left[ X \right]$ with $\displaystyle \textrm{deg} \, f \geq 1$, $\displaystyle f \left( X^2 \right)$ is reducible.

2017 China Team Selection Test, 2

Find the least positive number m such that for any polynimial f(x) with real coefficients, there is a polynimial g(x) with real coefficients (degree not greater than m) such that there exist 2017 distinct number $a_1,a_2,...,a_{2017}$ such that $g(a_i)=f(a_{i+1})$ for i=1,2,...,2017 where indices taken modulo 2017.

2018 Brazil National Olympiad, 3

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.

1997 Turkey Team Selection Test, 2

Show that for each prime $p \geq 7$, there exist a positive integer $n$ and integers $x_{i}$, $y_{i}$ $(i = 1, . . . , n)$, not divisible by $p$, such that $x_{i}^{2}+ y_{i}^{2}\equiv x_{i+1}^{2}\pmod{p}$ where $x_{n+1} = x_{1}$

1953 Miklós Schweitzer, 8

[b]8.[/b] Does there exist a Euclidean ring which is properly contained in the field $V$ of real numbers, and whose quotient field is $V$? [b](A.21)[/b]

2011 Northern Summer Camp Of Mathematics, 4

Find all positive integers $n$ such that $7^n+147$ is a perfect square.

2009 Miklós Schweitzer, 7

Let $ H$ be an arbitrary subgroup of the diffeomorphism group $ \mathsf{Diff}^\infty(M)$ of a differentiable manifold $ M$. We say that an $ \mathcal C^\infty$-vector field $ X$ is [i]weakly tangent[/i] to the group $ H$, if there exists a positive integer $ k$ and a $ \mathcal C^\infty$-differentiable map $ \varphi \mathrel{: } \mathord{]} \minus{} \varepsilon,\varepsilon\mathord{[}^k\times M\to M$ such that (i) for fixed $ t_1,\dots,t_k$ the map \[ \varphi_{t_1,\dots,t_k} : x\in M\mapsto \varphi(t_1,\dots,t_k,x)\] is a diffeomorphism of $ M$, and $ \varphi_{t_1,\dots,t_k}\in H$; (ii) $ \varphi_{t_1,\dots,t_k}\in H \equal{} \mathsf{Id}$ whenever $ t_j \equal{} 0$ for some $ 1\leq j\leq k$; (iii) for any $ \mathcal C^\infty$-function $ f: M\to \mathbb R$ \[ X f \equal{} \left.\frac {\partial^k(f\circ\varphi_{t_1,\dots,t_k})}{\partial t_1\dots\partial t_k}\right|_{(t_1,\dots,t_k) \equal{} (0,\dots,0)}.\] Prove, that the commutators of $ \mathcal C^\infty$-vector fields that are weakly tangent to $ H\subset \textsf{Diff}^\infty(M)$ are also weakly tangent to $ H$.

2006 Iran MO (3rd Round), 1

$n$ is a natural number. $d$ is the least natural number that for each $a$ that $gcd(a,n)=1$ we know $a^{d}\equiv1\pmod{n}$. Prove that there exist a natural number that $\mbox{ord}_{n}b=d$

2010 Iran MO (3rd Round), 7

[b]interesting function[/b] $S$ is a set with $n$ elements and $P(S)$ is the set of all subsets of $S$ and $f : P(S) \rightarrow \mathbb N$ is a function with these properties: for every subset $A$ of $S$ we have $f(A)=f(S-A)$. for every two subsets of $S$ like $A$ and $B$ we have $max(f(A),f(B))\ge f(A\cup B)$ prove that number of natural numbers like $x$ such that there exists $A\subseteq S$ and $f(A)=x$ is less than $n$. time allowed for this question was 1 hours and 30 minutes.

1986 Traian Lălescu, 2.4

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

2007 Putnam, 5

Suppose that a finite group has exactly $ n$ elements of order $ p,$ where $ p$ is a prime. Prove that either $ n\equal{}0$ or $ p$ divides $ n\plus{}1.$

2006 IMS, 3

$G$ is a group that order of each element of it Commutator group is finite. Prove that subset of all elemets of $G$ which have finite order is a subgroup og $G$.

2010 IMC, 4

Let $a,b$ be two integers and suppose that $n$ is a positive integer for which the set $\mathbb{Z} \backslash \{ax^n + by^n \mid x,y \in \mathbb{Z}\}$ is finite. Prove that $n=1$.

2014 IMS, 10

Let $V$ be a $n-$dimensional vector space over a field $F$ with a basis $\{e_1,e_2, \cdots ,e_n\}$.Prove that for any $m-$dimensional linear subspace $W$ of $V$, the number of elements of the set $W \cap P$ is less than or equal to $2^m$ where $P=\{\lambda_1e_1 + \lambda_2e_2 + \cdots + \lambda_ne_n : \lambda_i=0,1\}$.