{"schema":"vela.problem-packet.v0.1","problem":985,"statement":"Is it true that, for every prime $p$, there is a prime $q<p$ which is a primitive root modulo $p$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A002233","name":"a(1) = 1; for n > 1, a(n) = least positive prime primitive root of n-th prime.","terms":"1,2,2,3,2,2,3,2,5,2,3,2,7,3,5,2,2,2,2,7,5,3,2,3,5,2,5,2,11,3,3,2,3,2,2,7,5,2,5,2,2,2,19,5,2,3,2,3,2,7,3,7,7,11,3,5,2,43,","url":"https://oeis.org/A002233"},{"id":"A103309","name":"Smallest prime primitive root of n that is less than n, or 0 if none exists.","terms":"0,0,0,2,3,2,5,3,0,2,3,2,0,2,3,0,0,3,5,2,0,0,7,5,0,2,7,2,0,2,0,3,0,0,3,0,0,2,3,0,0,7,0,3,0,0,5,5,0,3,3,0,0,2,5,0,0,0,3,2,","url":"https://oeis.org/A103309"},{"id":"A219429","name":"Highest prime primitive root (less than p) for the n-th prime p. (or 0 if none exists).","terms":"0,2,3,5,7,11,11,13,19,19,17,19,29,29,43,41,47,59,61,67,59,59,79,83,83,89,101,103,103,107,109,127,131,109,139,109,151,149","url":"https://oeis.org/A219429"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}