Erdős problem 985Is it true that, for every prime pp, there is a prime q≤pq \leq p which is a primitive root modulo pp?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 9853 retained source recordsCanvaspublic previewSource#985→ResultNone→Checks0