Product of an integer free of small prime factors and prime in arithmetic progression (Q1984548)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Product of an integer free of small prime factors and prime in arithmetic progression |
scientific article |
Statements
Product of an integer free of small prime factors and prime in arithmetic progression (English)
0 references
16 September 2021
0 references
For positive integers \(a\) and \(k\) with \(\gcd(a,k)=1\), let \(\mathcal{N}_k(a;x,y,z)\) be the number of solutions to the congruence \(uv\equiv a\pmod{k}\) satisfying the conditions \(2\leq u\leq x\), \(2\leq v\leq y\), and the smallest prime factor of \(u\) is not less than \(z\). In this paper, the author obtains an unconditional approximation for \(\mathcal{N}_k(a;x,y,x^\beta)\) for any \(\beta\in(0,1/2]\), and two conditional approximations under the Generalised Riemann Hypothesis.
0 references
arithmetic progressions
0 references
primes
0 references
sieve methods
0 references
exponential sums
0 references