Talk:P-adic Norm not Complete on Rational Numbers

This proof begins by requiring an integer $a$ where $1 \le a \lt p$, and then later requires $a \ne 1$ and $a \ne p - 1$, so $1 \lt a \lt p - 1$, which preludes $p$ being $2$ or $3$. The constraints on $a$ seem to be necessary for the proof, so the proof doesn't seem to hold for $p = 2$ or $3$. --Leigh.Samphier (talk) 03:34, 19 August 2018 (EDT)


 * If you can see your way towards fixing this up, feel free. --prime mover (talk) 06:22, 19 August 2018 (EDT)