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

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:648672db289c2c697116a28765d95be33d62b7c06bdb63b48c6a9d3c29eb205a
Metadata: sha256:a3515c7d7deaba5246922de3d42e1277dbc23854f8f752aac18b5faf93e05d64
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:395534b177ca67df5e2e8e72e7a51d1c9a2921bbe8d226302fcd534876a1db8d

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207