arXiv subjects
Publications and source records attributed to Crystel Bujold.
Let $f:\mathbb{Z}\to\mathbb{C}$ be a multiplicative function. Assume there exist integers $a>1$ and $d>1$ such that $(a,d)=1$ and let $\mathcal{P}_{a,d}=\{a+kd:k\in\mathbb{Z}\}$. Under mild extra conditions on $d$ and $f(a)$, we prove that $f(n)=n\chi(n)$ for all $n$ outside an explicit exceptional set depending on $d$, and some Dirichlet character $\chi$.
In this note, we revisit a result of Benli's and Pollack's on the number of small prime $k^{th}$ power residues. The proof is based on their idea of using reciprocity laws, but the argument is simplified and we prove a slightly stronger bound.
In this paper, we prove a lower bound for $\underset{χ\neq χ_0}{\max}\bigg|\sum_{n\leq x} χ(n)\bigg|$, when $x= \frac{q}{(\log q)^B}$. This improves on a result of Granville and Soundararajan for large character sums when the range of summation is wide. When $B$ goes to zero, our lower bound recovers the expected maximal value of character sums for most characters.