Displaying similar documents to “Restriction theory of the Selberg sieve, with applications”

On rough and smooth neighbors.

William D. Banks, Florian Luca, Igor E. Shparlinski (2007)

Revista Matemática Complutense

Similarity:

We study the behavior of the arithmetic functions defined by F(n) = P+(n) / P-(n+1) and G(n) = P+(n+1) / P-(n) (n ≥ 1) where P+(k) and P-(k) denote the largest and the smallest prime factors, respectively, of the positive integer k.

Counting monic irreducible polynomials P in 𝔽 q [ X ] for which order of X ( mod P ) is odd

Christian Ballot (2007)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Hasse showed the existence and computed the Dirichlet density of the set of primes p for which the order of 2 ( mod p ) is odd; it is 7 / 24 . Here we mimic successfully Hasse’s method to compute the density δ q of monic irreducibles P in 𝔽 q [ X ] for which the order of X ( mod P ) is odd. But on the way, we are also led to a new and elementary proof of these densities. More observations are made, and averages are considered, in particular, an average of the δ p ’s as p varies through all rational primes.

Landau’s function for one million billions

Marc Deléglise, Jean-Louis Nicolas, Paul Zimmermann (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let 𝔖 n denote the symmetric group with n letters, and g ( n ) the maximal order of an element of 𝔖 n . If the standard factorization of M into primes is M = q 1 α 1 q 2 α 2 ... q k α k , we define ℓ ( M ) to be q 1 α 1 + q 2 α 2 + ... + q k α k ; one century ago, E. Landau proved that g ( n ) = max ℓ ( M ) ≤ n M and that, when n goes to infinity, log g ( n ) ∼ n log ( n ) . There exists a basic algorithm to compute g ( n ) for 1 ≤ n ≤ N ; its running time is 𝒪 N 3 / 2 / log N and the needed memory is 𝒪 ( N ) ; it allows computing g ( n ) up to, say, one million. We describe an algorithm to calculate g ( n ) for n up to 10 15 . The main idea is to use the...