2000 character limit reached
On short products of primes in arithmetic progressions
Published 17 May 2017 in math.NT | (1705.06087v1)
Abstract: We give several families of reasonably small integers $k, \ell \ge 1$ and real positive $\alpha, \beta \le 1$, such that the products $p_1\ldots p_k s$, where $p_1, \ldots, p_k \le m\alpha$ are primes and $s \le m\beta$ is a product of at most $\ell$ primes, represent all reduced residue classes modulo $m$. This is a relaxed version of the still open question of P. Erdos, A. M. Odlyzko and A. Sarkozy (1987), that corresponds to $k = \ell =1$ (that is, to products of two primes). In particular, we improve recent results of A. Walker (2016).
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.