To mod $p=23,$ there are three sequences of two or more consecutive primitive roots. Namely $10,11$ and $14,15$ and $19,20,21.$ My question is whether there is a bound on the length of such sequences of consecutive primitive roots, or on the other hand is it the case that for any given $n$ there is a prime $p$ having a sequence of at least $n$ consecutive primitive roots.
Any reference about this is appreciated, as well as more examples of longer such sequences.
Edit: A search revealed a paper which purports that there are arbitrarily long sequences of consecutive primitive roots for sufficiently large primes $p.$ The techniques of the paper are over my head, though. So I'd appreciate a simpler approach.