2000 character limit reached
A Generalization of the Grunwald-Wang Theorem for $n^{th}$ Powers
Published 6 Aug 2024 in math.NT | (2408.03301v1)
Abstract: Let $n$ be a natural number greater than $2$ and $q$ be the smallest prime dividing $n$. We show that a finite subset $A$ of rationals, of cardinality at most $q$, contains a $n{th}$ power in $\mathbb{Q}_{p}$ for almost every prime $p$ if and only if $A$ contains a perfect $n{th}$ power, barring some exceptions when $n$ is even. This generalizes the Grunwald-Wang theorem for $n{th}$ powers, from one rational number to finite subsets of rational numbers. We also show that the upper bound $q$ in this generalization is optimal for every $n$.
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.