A problem of R. K. Guy (Q1344607): Difference between revisions

The author gives an elementary proof of the following theorem: Let \(q \geq 3\) be an odd integer, \(\chi\) be a real primitive character modulo \(q\) such that \(\chi(-1) = -1\). Then \(\sum^{(q - 1)/2}_{n = 1} \chi(n) > 0\). This result implies that, for a prime \(p \equiv 3 \bmod 4\), \[ \left| \left\{ 1 \leq n \leq {p-1\over 2};\;\left( {n\over p}\right) = 1\right\} \right| > \left | \left\{ {p+1\over 2} \leq n \leq p,\;\left( {n\over p}\right) = 1\right\}\right |. \]