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

1995 Brazil National Olympiad, 5

Show that no one $n$-th root of a rational (for $n$ a positive integer) can be a root of the polynomial $x^5 - x^4 - 4x^3 + 4x^2 + 2$.

2010 Iran MO (3rd Round), 4

a) prove that every discrete subgroup of $(\mathbb R^2,+)$ is in one of these forms: i-$\{0\}$. ii-$\{mv|m\in \mathbb Z\}$ for a vector $v$ in $\mathbb R^2$. iii-$\{mv+nw|m,n\in \mathbb Z\}$ for tho linearly independent vectors $v$ and $w$ in $\mathbb R^2$.(lattice $L$) b) prove that every finite group of symmetries that fixes the origin and the lattice $L$ is in one of these forms: $\mathcal C_i$ or $\mathcal D_i$ that $i=1,2,3,4,6$ ($\mathcal C_i$ is the cyclic group of order $i$ and $\mathcal D_i$ is the dyhedral group of order $i$).(20 points)

2009 National Olympiad First Round, 32

There are $ n$ sets having $ 4$ elements each. The difference set of any two of the sets is equal to one of the $ n$ sets. $ n$ can be at most ? (A difference set of $A$ and $B$ is $ (A\setminus B)\cup(B\setminus A) $) $\textbf{(A)}\ 3 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ \text{None}$

2017 IMAR Test, 2

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$

2025 Romania National Olympiad, 1

We say a ring $(A,+,\cdot)$ has property $(P)$ if : \[ \begin{cases} \text{the set } A \text{ has at least } 4 \text{ elements} \\ \text{the element } 1+1 \text{ is invertible}\\ x+x^4=x^2+x^3 \text{ holds for all } x \in A \end{cases} \] a) Prove that if a ring $(A,+,\cdot)$ has property $(P)$, and $a,b \in A$ are distinct elements, such that $a$ and $a+b$ are units, then $1+ab$ is also a unit, but $b$ is not a unit. b) Provide an example of a ring with property $(P)$.

2024 Romania National Olympiad, 4

Let $\mathbb{L}$ be a finite field with $q$ elements. Prove that: a) If $q \equiv 3 \pmod 4$ and $n \ge 2$ is a positive integer divisible by $q-1,$ then $x^n=(x^2+1)^n$ for all $x \in \mathbb{L}^{\times}.$ b) If there exists a positive integer $n \ge 2$ such that $x^n=(x^2+1)^n$ for all $x \in \mathbb{L}^{\times},$ then $q \equiv 3 \pmod 4$ and $q-1$ divides $n.$

2004 VJIMC, Problem 1

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

2008 Bosnia And Herzegovina - Regional Olympiad, 3

Prove that equation $ p^{4}\plus{}q^{4}\equal{}r^{4}$ does not have solution in set of prime numbers.

2024 India National Olympiad, 5

Let points $A_1$, $A_2$ and $A_3$ lie on the circle $\Gamma$ in a counter-clockwise order, and let $P$ be a point in the same plane. For $i \in \{1,2,3\}$, let $\tau_i$ denote the counter-clockwise rotation of the plane centred at $A_i$, where the angle of rotation is equial to the angle at vertex $A_i$ in $\triangle A_1A_2A_3$. Further, define $P_i$ to be the point $\tau_{i+2}(\tau_{i}(\tau_{i+1}(P)))$, where the indices are taken modulo $3$ (i.e., $\tau_4 = \tau_1$ and $\tau_5 = \tau_2$). Prove that the radius of the circumcircle of $\triangle P_1P_2P_3$ is at most the radius of $\Gamma$. [i]Proposed by Anant Mudgal[/i]

2006 Petru Moroșan-Trident, 1

Let be a natural number $ n\ge 4, $ and a group $ G $ for which the applications $ \iota ,\eta : G\longrightarrow G $ defined by $ \iota (g) =g^n ,\eta (g) =g^{2n} $ are endomorphisms. Prove that $ G $ is commutative if $ \iota $ is injective or surjective. [i]Gh. Andrei[/i]

2021 CCA Math Bonanza, L3.3

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]

2012 IMC, 3

Given an integer $n>1$, let $S_n$ be the group of permutations of the numbers $1,\;2,\;3,\;\ldots,\;n$. Two players, A and B, play the following game. Taking turns, they select elements (one element at a time) from the group $S_n$. It is forbidden to select an element that has already been selected. The game ends when the selected elements generate the whole group $S_n$. The player who made the last move loses the game. The first move is made by A. Which player has a winning strategy? [i]Proposed by Fedor Petrov, St. Petersburg State University.[/i]

2011 Pre - Vietnam Mathematical Olympiad, 1

Determine all values of $n$ satisfied the following condition: there's exist a cyclic $(a_1,a_2,a_3,...,a_n)$ of $(1,2,3,...,n)$ such that $\left\{ {{a_1},{a_1}{a_2},{a_1}{a_2}{a_3},...,{a_1}{a_2}...{a_n}} \right\}$ is a complete residue systems modulo $n$.

2016 Romania National Olympiad, 2

Let $A$ be a ring and let $D$ be the set of its non-invertible elements. If $a^2=0$ for any $a \in D,$ prove that: [b]a)[/b] $axa=0$ for all $a \in D$ and $x \in A$; [b]b)[/b] if $D$ is a finite set with at least two elements, then there is $a \in D,$ $a \neq 0,$ such that $ab=ba=0,$ for every $b \in D.$ [i]Ioan Băetu[/i]