Product of primes in arithmetic progressions
Résumé
We prove that, for all $q \ge 2$ and for all invertible residue classes $a$ modulo $q$, there exists a natural number $n \le (650q)^9$ that is congruent to $a$ modulo $q$ and that is the product of exactly three primes, all of which are below $(650q)^3$. The proof is further supplemented with a self-contained proof of the special case of the Kneser Theorem we use.
Domaines
Théorie des nombres [math.NT]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...