Abstract

We estimate from below the lower density of the set of prime numbers $p$ such that $p-1$ has a prime factor of size at least $p^c$, where $1/4 \le c \leq 1/2$. We also establish upper and lower bounds on the counting function of the set of positive integers $n\le x$ with exactly $k$ prime factors, counted with or without multiplicity, such that the largest prime factor of ${\text{\rm gcd}}(p-1: p\mid n)$ exceeds $n^{1/2k}$.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.