Results 1 
3 of
3
Primality testing with Gaussian periods
, 2003
"... The problem of quickly determining whether a given large integer is prime or composite has been of interest for centuries, if not longer. The past 30 years has seen a great deal of progress, leading up to the recent deterministic, polynomialtime algorithm of Agrawal, Kayal, and Saxena [2]. This new ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
(Show Context)
The problem of quickly determining whether a given large integer is prime or composite has been of interest for centuries, if not longer. The past 30 years has seen a great deal of progress, leading up to the recent deterministic, polynomialtime algorithm of Agrawal, Kayal, and Saxena [2]. This new “AKS test ” for the primality of n involves verifying the
On the greatest prime factor of p− 1 with effective constants
 A VARIANT OF THE BOMBIERIVINOGRADOV THEOREM WITH EXPLICIT CONSTANTS AND APPLICATIONS 27
"... ..."
(Show Context)
A VARIANT OF THE BOMBIERIVINOGRADOV THEOREM WITH EXPLICIT CONSTANTS AND APPLICATIONS
"... ABSTRACT. We give an effective version with explicit constants of a mean value theorem of Vaughan related to the values of ψ(y, χ), the twisted summatory function associated to the von Mangoldt function Λ and a Dirichlet character χ. As a consequence of this result we prove an effective variant of t ..."
Abstract
 Add to MetaCart
ABSTRACT. We give an effective version with explicit constants of a mean value theorem of Vaughan related to the values of ψ(y, χ), the twisted summatory function associated to the von Mangoldt function Λ and a Dirichlet character χ. As a consequence of this result we prove an effective variant of the BombieriVinogradov theorem with explicit constants. This effective variant has the potential to provide explicit results in many problems. We give examples of such results in several number theoretical problems related to shifted primes. For integers a and q ≥ 1, let 1.