MathDB
every quadratic non-residue modulo n is a primitive root modulo n.

Source: RMM Shortlist 2016 N1

July 4, 2019
number theoryprimitive rootQuadratic Residues

Problem Statement

Determine all integers n≥3n \ge 3 whose decimal expansion has less than 2020 digits, such that every quadratic non-residue modulo nn is a primitive root modulo nn.
An integer aa is a quadratic non-residue modulo nn, if there is no integer bb such that a−b2a - b^2 is divisible by nn. An integer aa is a primitive root modulo nn, if for every integer bb relatively prime to n there is a positive integer kk such that ak−ba^k - b is divisible by nn.
Back to ProblemsView on AoPS