بلیان

چه کسانی این کتاب را می‌خوانند

دانشجوعلاقه‌مند یادگیری
کتابخوان حرفه‌ایلذت مطالعه
نویسندهالهام‌گیری

Towards a deterministic polynomial-time Primality Test

Kayal N., Saxena N.

قیمت نهایی

۴۹٬۰۰۰ تومان

نسخه اصلی و اورجینال

بلافاصله پس از خرید، فایل کتاب روی دستگاه شما آمادهٔ دانلود است.

تحویل فوری
پرداخت امن
ضمانت فایل
پشتیبانی

مشخصات کتاب

نویسنده
Kayal N., Saxena N.
ناشر
2002
سال انتشار
۲۰۰۲
فرمت
PS
زبان
انگلیسی
حجم فایل
۳۰۷٫۲ کیلوبایت

دربارهٔ کتاب

We examine a primality testing algorithm presented in Primality and Identity Testing via Chinese Remaindering: FOCS 1999 and the related conjecture in Prashant and Rajat: BTP-report 2001. We show that this test is stronger than some of the most popular tests: the Fermat test, the Solovay Strassen test and a strong form of the Fibonacci test. From this, we show the correctness of the algorithm based on a widely believed conjecture, the Extended Riemann Hypothesis. We also show that any n which is accepted by the algorithm must be an odd square-free number. Thus, it is arguably the simplest and yet the strongest test for primality.Based on our computations and results proved in this paper we feel that unlike other tests, this test is very promising as the related conjecture seems provable.

کتاب‌های مشابه

Towards a polynomial-time primality test

Towards a polynomial-time primality test

۴۹٬۰۰۰ تومان

A polynomial-time primality test

A polynomial-time primality test

۴۹٬۰۰۰ تومان

A polynomial-time primality test

A polynomial-time primality test

۴۹٬۰۰۰ تومان

A polynomial-time primality test

A polynomial-time primality test

۴۹٬۰۰۰ تومان

Numerical primality test for bivariate polynomials

Numerical primality test for bivariate polynomials

۴۹٬۰۰۰ تومان

Numerical primality test for bivariate polynomials

Numerical primality test for bivariate polynomials

۴۹٬۰۰۰ تومان

Primality testing

Primality testing

۴۹٬۰۰۰ تومان

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

۴۹٬۰۰۰ تومان

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

۴۹٬۰۰۰ تومان

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

۴۹٬۰۰۰ تومان

Primality testing revisited

Primality testing revisited

۴۹٬۰۰۰ تومان

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

۴۹٬۰۰۰ تومان

قیمت نهایی

۴۹٬۰۰۰ تومان