AP中素数乘积的显界

IF 2.2 2区数学 Q1 MATHEMATICS, APPLIED

Mathematics of Computation Pub Date : 2023-04-21 DOI:10.1090/mcom/3853

Ramachandran Balasubramanian, Olivier Ramaré, Priyamvad Srivastav

引用次数: 0

摘要

对于所有q≥2 q\ge 2，对于所有可逆残数类a a模q q，存在一个自然数与a a模q q全等，并且是恰好三个素数的乘积，它们都小于(10 15 q) 5/2 (10^{15}q)^{5/2}。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Explicit bounds for products of primes in AP

For all q ≥ 2 q\ge 2 and for all invertible residue classes a a modulo q q , there exists a natural number that is congruent to a a modulo q q and that is the product of exactly three primes, all of which are below ( 10 15 q ) 5 / 2 (10^{15}q)^{5/2} .

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Mathematics of Computation 数学-应用数学

CiteScore

3.90

自引率

5.00%

发文量

审稿时长

7.0 months

期刊介绍： All articles submitted to this journal are peer-reviewed. The AMS has a single blind peer-review process in which the reviewers know who the authors of the manuscript are, but the authors do not have access to the information on who the peer reviewers are. This journal is devoted to research articles of the highest quality in computational mathematics. Areas covered include numerical analysis, computational discrete mathematics, including number theory, algebra and combinatorics, and related fields such as stochastic numerical methods. Articles must be of significant computational interest and contain original and substantial mathematical analysis or development of computational methodology.