arXiv · 2412.00010
Hybrid bounds for prime divisors
Abstract
Let $x$ and $n$ be positive integers. We prove a non-trivial lower bound for $x$, dependant only on $\omega_n$, the number of distinct prime factors of $x^n-1$. By considering the divisibility of $\varphi \mid x^n-1$ for $\varphi \mid n$, we obtain a further refinement. This bound has applications for existence problems relating to primitive elements in finite fields.
Explore related subjects
Keep this discovery
Gustav Kjærbye Bagger. 2024-11-13. Hybrid bounds for prime divisors. https://arxiv.org/abs/2412.00010
Cite the original work for its findings. Save a collection to share your selection of sources.