Square-full primitive roots

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some conditional bounds.Comment: 9 page

Second moment of Dirichlet LL-functions, character sums over subgroups and upper bounds on relative class numbers

We prove an asymptotic formula for the mean-square average of $L$- functions associated to subgroups of characters of sufficiently large size. Our proof relies on the study of certain character sums ${\cal A}(p,d)$ recently introduced by E. Elma. We obtain an asymptotic formula for ${\cal A}(p,d)$ which holds true for any divisor $d$ of $p-1$ removing previous restrictions on the size of $d$. This anwers a question raised in Elma's paper. Our proof relies both on estimates on the frequency of large character sums and techniques from the theory of uniform distribution. As an application we deduce the following bound $h_{p,d}^- \leq 2\left (\frac{(1+o(1))p}{24}\right )^{m/4}$ on the relative class numbers of the imaginary number fields of conductor $p\equiv 1\mod d$ and degree $m=(p-1)/d$