pith. sign in

arxiv: 1311.2527 · v1 · pith:QFQW3E23new · submitted 2013-11-11 · 🧮 math.NT

On shifted primes with large prime factors and their products

classification 🧮 math.NT
keywords primefactorfactorslowerbelowboundscountedcounting
0
0 comments X
read the original 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 c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set of positive integers n up to x with exactly k prime factors, counted with or without multiplicity, such that the largest prime factor of gcd(p-1 : p | n) exceeds n^{1/2k}.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.