2000 character limit reached
On monogenity of certain pure number fields defined by $x^{p^r}-m$
Published 3 Feb 2021 in math.NT | (2102.01967v1)
Abstract: Let $K = \mathbb{Q} (\alpha) $ be a pure number field generated by a complex root $\alpha$ a monic irreducible polynomial $ F(x) = x{pr} -m$, with $ m \neq 1 $ is a square free rational integer, $p$ is a rational prime integer, and $r$ is a positive integer. In this paper, we study the monogenity of $K$. We prove that if {{$\nu_p(mp-m)=1$}}, then $K$ is monogenic. But if $r\ge p$ and {$\nu_p(m{p}-m)> p$}, then $K$ is not monogenic. Some illustrating examples are given.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.