Erdős problem 985 · problems.science

Is it true that, for every prime $p$ , there is a prime $q \leq p$ which is a primitive root modulo $p$ ?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/985.lean

Formal Conjectures

FormalConjectures/ErdosProblems/985.leanErdos985.erdos_9851 lineExact file

1sorry ↔ ∀ (p : ℕ), Nat.Prime p → p ≠ 2 → ∃ q, Nat.Prime q ∧ q < p ∧ orderOf ↑q = p - 1

OpenStatement only, no proof