Olympiad problems

1961 Putnam, A6

Prove that $p(x)=1+x+x^2 +\ldots+x^n$ is reducible over $\mathbb{F}_{2}$ in case $n+1$ is composite. If $n+1$ is prime, is $p(x)$ irreducible over $\mathbb{F}_{2}$ ?

2025 Romania National Olympiad, 4

Tags: number theory , prime numbers , algebra , polynomial , finite fields

Let $p$ be an odd prime number, and $k$ be an odd number not divisible by $p$. Consider a field $K$ be a field with $kp+1$ elements, and $A = \{x_1,x_2, \dots, x_t\}$ be the set of elements of $K^*$, whose order is not $k$ in the multiplicative group $(K^*,\cdot)$. Prove that the polynomial $P(X)=(X+x_1)(X+x_2)\dots(X+x_t)$ has at least $p$ coefficients equal to $1$.

2024 Miklos Schweitzer, 9

Tags: number theory , finite fields

Let $q > 1$ be a power of $2$. Let $f: \mathbb{F}_{q^2} \to \mathbb{F}_{q^2}$ be an affine map over $\mathbb{F}_2$. Prove that the equation \[ f(x) = x^{q+1} \] has at most $2q - 1$ solutions.

2024 Romania National Olympiad, 4

Tags: finite fields , abstract algebra

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

1993 Miklós Schweitzer, 3

Tags: abstract algebra , finite fields

Let K be the field formed by the addition of a root of the polynomial $x^4 - 2x^2 - 1$ to the rational field. Prove that there are no exceptional units in the ring of integers of K. (A unit $\varepsilon$ is called exceptional if $1-\varepsilon$ is also a unit.)

2023 Romania National Olympiad, 2

Tags: polynomial , field , finite fields , superior algebra

Let $p$ be a prime number, $n$ a natural number which is not divisible by $p$, and $\mathbb{K}$ is a finite field, with $char(K) = p, |K| = p^n, 1_{\mathbb{K}}$ unity element and $\widehat{0} = 0_{\mathbb{K}}.$ For every $m \in \mathbb{N}^{*}$ we note $ \widehat{m} = \underbrace{1_{\mathbb{K}} + 1_{\mathbb{K}} + \ldots + 1_{\mathbb{K}}}_{m \text{ times}} $ and define the polynomial \[ f_m = \sum_{k = 0}^{m} (-1)^{m - k} \widehat{\binom{m}{k}} X^{p^k} \in \mathbb{K}[X]. \] a) Show that roots of $f_1$ are $ \left\{ \widehat{k} | k \in \{0,1,2, \ldots , p - 1 \} \right\}$. b) Let $m \in \mathbb{N}^{*}.$ Determine the set of roots from $\mathbb{K}$ of polynomial $f_{m}.$

2018 District Olympiad, 4

Tags: finite fields , superior algebra

Let $n$ and $q$ be two natural numbers, $n\ge 2$, $q\ge 2$ and $q\not\equiv 1 (\text{mod}\ 4)$ and let $K$ be a finite field which has exactly $q$ elements. Show that for any element $a$ from $K$, there exist $x$ and $y$ in $K$ such that $a = x^{2^n} + y^{2^n}$. (Every finite field is commutative).

1968 Putnam, B5

Tags: Putnam , matrix , finite fields

Let $S$ be the set of $2\times2$-matrices over $\mathbb{F}_{p}$ with trace $1$ and determinant $0$. Determine $|S|$.