Problem

Source: Olimphíada 2023 - Problem 4/Level 2

Tags: complete residue system, polynomial, algebra



We say that a prime $p$ is $\textit{philé}$ if there is a polynomial $P$ of non-negative integer coefficients smaller than $p$ and with degree $3$, that is, $P(x) = ax^3 + bx^2 + cx + d$ where $a, b, c, d < p$, such that $$\{P(n) | 1 \leq n \leq p\}$$is a complete residue system modulo $p$. Find all $\textit{philé}$ primes. Note: A set $A$ is a complete residue system modulo $p$ if for every integer $k$, with $0 \leq k \leq p - 1$, there exists an element $a \in A$ such that $$p | a-k.$$