scispace - formally typeset
Open AccessBook

Introduction to Analytic and Probabilistic Number Theory

TLDR
In this article, the saddle-point method was used for arithmetic progressions, and the Euler gamma function and the Riemann zeta function were used to generate arithmetic functions.
Abstract
Elementary methods Some tools from real analysis Prime numbers Arithmetic functions Average orders Sieve methods Extremal orders The method of van der Corput Diophantine approximation Complex analysis methods The Euler gamma function Generating functions: Dirichlet series Summation formulae The Riemann zeta function The prime number theorem and the Riemann hypothesis The Selberg-Delange method Two arithmetic applications Tauberian theorems Primes in arithmetic progressions Probabilistic methods Densities Limiting distributions of arithmetic functions Normal order Distribution of additive functions and mean values of multiplicative functions Friable integers The saddle-point method Integers free of small factors Bibliography Index

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

On the normal concentration of divisors, 2

TL;DR: In this paper, the upper and lower bounds for the normal order of the Erd˝ os-Hooley Δ-function were improved for the case where n ∈ N ∗.
Book

Logarithmic Combinatorial Structures: A Probabilistic Approach

TL;DR: In this article, the authors explain the similarities in asymptotic behaviour as the result of two basic properties shared by the structures: the conditioning relation and the logarithmic condition.
Book ChapterDOI

Making NTRU as secure as worst-case problems over ideal lattices

TL;DR: This work shows how to modify NTRUEncrypt to make it provably secure in the standard model, under the assumed quantum hardness of standard worst-case lattice problems, restricted to a family of lattices related to some cyclotomic fields.
Book ChapterDOI

Faster Fully Homomorphic Encryption

TL;DR: Two improvements to Gentry’s fully homomorphic scheme based on ideal lattices are described: a more aggressive analysis of one of the hardness assumptions and a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree.
Journal ArticleDOI

A general limit theorem for recursive algorithms and combinatorial structures

TL;DR: A general transfer theorem is derived which allows us to establish a limit law on the basis of the recursive structure and the asymptotics of the first and second moments of the sequence, where the Zolotarev metric is used.