Skip to content

Erdős problem 985

Start work

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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:648672db289c2c697116a28765d95be33d62b7c06bdb63b48c6a9d3c29eb205a
Metadata
sha256:a3515c7d7deaba5246922de3d42e1277dbc23854f8f752aac18b5faf93e05d64
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:395534b177ca67df5e2e8e72e7a51d1c9a2921bbe8d226302fcd534876a1db8d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON