Constructing a base $b$ repunit that is $a$ $\pmod p$ Suppose I want to construct a number of the form ($b^n-1$)/($b-1$) $=$ $a$ $\pmod p$ with $n$ and $p$ prime. What are the limitations on the base $b$ $>$ $1$ and prime $n$? 
For example, if ($b^n-1$)/($b-1$) $=$ $4$ $\pmod 5$, what are possible choices for $b$ and (prime) $n$ in modular form?
I was able to find that $b$ nor prime $n$ $≠$ $2, 3, 5, 7$ or $11$. As an example that there exists such a number with $b > 1$ and $n$ prime: ($6^{19}-1$)/$5$ $=$ $4$ $\pmod 5$.

$(b^n-1) = (b-1)(b^{n-1} + b^{n-2} + ... + b^2 + b + 1)$
So (assuming $b \neq 1$!) it might be easier to directly consider 
$$(b^{n-1} + b^{n-2} + ... + b^2 + b + 1) = a \mod p$$
If $p | b$, the above is true only if $a = 1$; and in that case it is true for all $n$, prime or not. So let's assume that $p$ is not a factor of $b$. 
In the example you gave with $b=6, p=5$, we get that $b = 1 \mod p$, so your equation becomes $n = a \mod p$. 
We only care about the modulo result for $b$; i.e, if it works for some $b$, it will also work for $(b+p)$, and similarly for $n$ (assuming it's still a prime!).
So, e.g., $(11^{19}-1)/10 = 4 \mod 5$ as well - what matters is that $b = 1 \mod 5$; then every $n$ (prime or not) satisfying $n = 4 \mod 5$ also works (e.g., $(31^{24}-1)/30 = 4 \mod 5$)
What else can be said? Let's say $0 < b < p$. Then $b^{p-1}=1 \mod p$; and the terms in your sum begin repeating every $p-1$ powers. So given $b$ and $p$, let $$S_k = \sum_{i=0}^{k-1}b^i \mod p$$
(with $S_0 = 0$, the 'empty sum'). Suppose $n = d(p-1) + m$, where $0 <= m < p-1$ (so $m = n \mod (p-1)$). Then 
$$(b^{n-1} + b^{n-2} + ... + b^2 + b + 1) = S_n = d \cdot S_{p-1} + S_m \mod p$$
For $p = 5$, there are the following possibilities (in each case, $S_{p-1} = S_4$)
$$b=1 \rightarrow S_n = n $$
$$b=2 \rightarrow S_1=1, S_2= 3, S_3=2, S_4=0 $$
$$b=3 \rightarrow S_1=1, S_2= 4, S_3=3, S_4=0 $$
$$b=4 \rightarrow S_1=1, S_2= 0, S_3=1, S_4=0 $$
From this we see that for $p=5, a = 4$, the only solutions are:
$(b=1, n=4 \mod 5)$ and $(b=3, n=2 \mod 4)$. Note than when $b$ is such that $S_{p-1} = 0$, 
$$S_n = d \cdot S_{p-1} + S_m = S_m = S_{n \mod p-1}$$
so we just look for those $b$ with some $S_m = a$. Of course, the only prime $n = 2 \mod 4$ is 2! So for example $(13^2 -1)/12 = 4 \mod 5$.
So we can also find the conditions for other values of $a$ from the above; for example for $a = 3$, we have: $$(b=1, n=3 \mod 5)$$ $$(b=2, n= 2 \mod 4)$$ $$(b=3 , n = 3 \mod 4)$$ and no solutions for $b = 4$.
For larger values of prime $p$, you can use the same approach. Some observations:
If $b = 1 \mod p$, then you can always look for primes of the form $n = a \mod p$.
If $b \neq 1 \mod p$, then $S_{p-1} = 0$ (proof omitted); in which case you always get:
$$S_n = d \cdot S_{p-1} + S_m = S_m$$
so you need only look for those $b$ such that $S_m = a \mod p$, where $n = m \mod p-1$.
