Explicit bounds for products of primes in 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

{"title":"Explicit bounds for products of primes in AP","authors":"Ramachandran Balasubramanian, Olivier Ramaré, Priyamvad Srivastav","doi":"10.1090/mcom/3853","DOIUrl":null,"url":null,"abstract":"For all <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"q greater-than-or-equal-to 2\"> <mml:semantics> <mml:mrow> <mml:mi>q</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">q\\ge 2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and for all invertible residue classes <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"a\"> <mml:semantics> <mml:mi>a</mml:mi> <mml:annotation encoding=\"application/x-tex\">a</mml:annotation> </mml:semantics> </mml:math> </inline-formula> modulo <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"q\"> <mml:semantics> <mml:mi>q</mml:mi> <mml:annotation encoding=\"application/x-tex\">q</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, there exists a natural number that is congruent to <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"a\"> <mml:semantics> <mml:mi>a</mml:mi> <mml:annotation encoding=\"application/x-tex\">a</mml:annotation> </mml:semantics> </mml:math> </inline-formula> modulo <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"q\"> <mml:semantics> <mml:mi>q</mml:mi> <mml:annotation encoding=\"application/x-tex\">q</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and that is the product of exactly three primes, all of which are below <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"left-parenthesis 10 Superscript 15 Baseline q right-parenthesis Superscript 5 slash 2\"> <mml:semantics> <mml:mrow> <mml:mo stretchy=\"false\">(</mml:mo> <mml:msup> <mml:mn>10</mml:mn> <mml:mrow class=\"MJX-TeXAtom-ORD\"> <mml:mn>15</mml:mn> </mml:mrow> </mml:msup> <mml:mi>q</mml:mi> <mml:msup> <mml:mo stretchy=\"false\">)</mml:mo> <mml:mrow class=\"MJX-TeXAtom-ORD\"> <mml:mn>5</mml:mn> <mml:mrow class=\"MJX-TeXAtom-ORD\"> <mml:mo>/</mml:mo> </mml:mrow> <mml:mn>2</mml:mn> </mml:mrow> </mml:msup> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">(10^{15}q)^{5/2}</mml:annotation> </mml:semantics> </mml:math> </inline-formula>.","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":"45 1","pages":"0"},"PeriodicalIF":2.2000,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/mcom/3853","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

Abstract

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} .

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

AP中素数乘积的显界

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

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

求助全文

约1分钟内获得全文去求助

来源期刊

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.

期刊最新文献

Error bounds for Gauss–Jacobi quadrature of analytic functions on an ellipse Müntz Legendre polynomials: Approximation properties and applications A random active set method for strictly convex quadratic problem with simple bounds Fourier optimization and Montgomery’s pair correlation conjecture Virtual element methods for Biot–Kirchhoff poroelasticity