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

2023 Romanian Master of Mathematics Shortlist, N1
Let $n$ be a positive integer. Let $S$ be a set of ordered pairs $(x, y)$ such that $1\leq x \leq n$ and $0 \leq y \leq n$ in each pair, and there are no pairs $(a, b)$ and $(c, d)$ of different elements in $S$ such that $a^2+b^2$ divides both $ac+bd$ and $ad - bc$. In terms of $n$, determine the size of the largest possible set $S$.
number theory gaussian integer divisibility gaussian modular arithmetic proof by contradiction

1997 Romania National Olympiad, 1
Let $\alpha \in \mathbb{C} \setminus \mathbb{Q}$ be such that the set $A= \{ a+b \alpha : a,b \in \mathbb{Z} \}$ is a ring with respect to the usual operations of $\mathbb{C}.$ If the ring $A$ has exactly four invertible elements, prove that $A= \mathbb{Z}[i].$
rings gaussian integer units superior algebra algebra