请输入您要查询的百科知识:

 

词条 Agrawal's conjecture
释义

  1. Ramifications

  2. Truth or falsehood

  3. Distributed computing

  4. Notes

  5. External links

In number theory, Agrawal's conjecture, due to Manindra Agrawal in 2002,[1] forms the basis for the cyclotomic AKS test. Agrawal's conjecture states formally:

Let and be two coprime positive integers. If

then either is prime or

Ramifications

If Agrawal's conjecture were true, it would decrease the runtime complexity of the AKS primality test from to .

Truth or falsehood

The conjecture was formulated by Rajat Bhattacharjee and Prashant Pandey in their 2001 thesis.[2] It has been computationally verified for and ,[3] and for .[4]

However, a heuristic argument by Carl Pomerance and Hendrik W. Lenstra suggests there are infinitely many counterexamples.[5] In particular, the heuristic shows that such counterexamples have asymptotic density greater than for any .

Assuming Agrawal's conjecture is false by the above argument, Roman B. Popovych conjectures a modified version may still be true:

Let and be two coprime positive integers. If

and

then either is prime or .[6]

Distributed computing

Both Agrawal's conjecture and Popovych's conjecture are being tested by distributed computing project Primaboinca, which was started in 2010 based on BOINC. As of June 2017, the project found no counterexample for .

Notes

1. ^{{cite journal |first=Manindra |last=Agrawal |first2=Neeraj |last2=Kayal |first3=Nitin |last3=Saxena |url=http://www.cse.iitk.ac.in/users/manindra/algebra/primality_v6.pdf |title=PRIMES is in P |journal=Annals of Mathematics |volume=160 |year=2004 |issue=2 |pages=781–793 |doi=10.4007/annals.2004.160.781 |jstor=3597229 }}
2. ^{{cite journal|author=Rajat Bhattacharjee, Prashant Pandey|date=April 2001|url=https://cs.stanford.edu/people/rajatb/primality.ps.gz |title=Primality Testing|journal=Technical report|publisher=IIT Kanpur}}
3. ^{{cite journal|author=Neeraj Kayal, Nitin Saxena|year=2002|title=Towards a deterministic polynomial-time Primality Test|journal=Technical report|publisher=IIT Kanpur|url=http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=26D074BAD51A77850596AC6713BBC741?doi=10.1.1.16.9281&rep=rep1&type=pdf}}
4. ^{{cite web|url=https://www.cse.iitk.ac.in/users/nitin/talks/Dec2014-3Paris.pdf|title=Primality & Prime Number Generation|last=Saxena|first=Nitin|date=Dec 2014|publisher=UPMC Paris|accessdate=24 April 2018}}
5. ^{{cite web|last=Lenstra|first=H. W.|first2=Carl|last2=Pomerance|date=2003|title=Remarks on Agrawal’s conjecture.|url=http://www.aimath.org/WWN/primesinp/primesinp.pdf|publisher=American Institute of Mathematics|accessdate=16 October 2013}}
6. ^{{citation|url=https://eprint.iacr.org/2009/008.pdf |title=A note on Agrawal conjecture |first=Roman |last=Popovych|date=30 December 2008|accessdate=21 April 2018}}

External links

  • Primaboinca project
{{DEFAULTSORT:Agrawal's Conjecture}}

1 : Conjectures about prime numbers

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/12 8:00:13