Sieves in Number Theory

Sieves in Number Theory

Author: George Greaves

Publisher: Springer Science & Business Media

Published: 2013-03-09

Total Pages: 312

ISBN-13: 366204658X

DOWNLOAD EBOOK

This book surveys the current state of the "small" sieve methods developed by Brun, Selberg and later workers. The book is suitable for university graduates making their first acquaintance with the subject, leading them towards the frontiers of modern research and unsolved problems in the subject area.


Sieve Methods

Sieve Methods

Author: Heine Halberstam

Publisher: Courier Corporation

Published: 2013-09-26

Total Pages: 386

ISBN-13: 0486320804

DOWNLOAD EBOOK

This text by a noted pair of experts is regarded as the definitive work on sieve methods. It formulates the general sieve problem, explores the theoretical background, and illustrates significant applications. 1974 edition.


An Introduction to Sieve Methods and Their Applications

An Introduction to Sieve Methods and Their Applications

Author: Alina Carmen Cojocaru

Publisher: Cambridge University Press

Published: 2005-12-08

Total Pages: 250

ISBN-13: 9780521848169

DOWNLOAD EBOOK

Rather than focus on the technical details which can obscure the beauty of sieve theory, the authors focus on examples and applications, developing the theory in parallel.


Prime-detecting Sieves

Prime-detecting Sieves

Author: Glyn Harman

Publisher: Princeton University Press

Published: 2007-08-05

Total Pages: 378

ISBN-13: 069112437X

DOWNLOAD EBOOK

This book seeks to describe the rapid development in recent decades of sieve methods able to detect prime numbers. The subject began with Eratosthenes in antiquity, took on new shape with Legendre's form of the sieve, was substantially reworked by Ivan M. Vinogradov and Yuri V. Linnik, but came into its own with Robert C. Vaughan and important contributions from others, notably Roger Heath-Brown and Henryk Iwaniec. Prime-Detecting Sieves breaks new ground by bringing together several different types of problems that have been tackled with modern sieve methods and by discussing the ideas common to each, in particular the use of Type I and Type II information. No other book has undertaken such a systematic treatment of prime-detecting sieves. Among the many topics Glyn Harman covers are primes in short intervals, the greatest prime factor of the sequence of shifted primes, Goldbach numbers in short intervals, the distribution of Gaussian primes, and the recent work of John Friedlander and Iwaniec on primes that are a sum of a square and a fourth power, and Heath-Brown's work on primes represented as a cube plus twice a cube. This book contains much that is accessible to beginning graduate students, yet also provides insights that will benefit established researchers.


Topics in the Theory of Numbers

Topics in the Theory of Numbers

Author: Janos Suranyi

Publisher: Springer Science & Business Media

Published: 2003-01-14

Total Pages: 322

ISBN-13: 9780387953205

DOWNLOAD EBOOK

Number theory, the branch of mathematics that studies the properties of the integers, is a repository of interesting and quite varied problems, sometimes impossibly difficult ones. In this book, the authors have gathered together a collection of problems from various topics in number theory that they find beautiful, intriguing, and from a certain point of view instructive.


The Large Sieve and its Applications

The Large Sieve and its Applications

Author: E. Kowalski

Publisher: Cambridge University Press

Published: 2008-05-22

Total Pages: 316

ISBN-13: 9780521888516

DOWNLOAD EBOOK

Among the modern methods used to study prime numbers, the 'sieve' has been one of the most efficient. Originally conceived by Linnik in 1941, the 'large sieve' has developed extensively since the 1960s, with a recent realization that the underlying principles were capable of applications going well beyond prime number theory. This book develops a general form of sieve inequality, and describes its varied applications, including the study of families of zeta functions of algebraic curves over finite fields; arithmetic properties of characteristic polynomials of random unimodular matrices; homological properties of random 3-manifolds; and the average number of primes dividing the denominators of rational points on elliptic curves. Also covered in detail are the tools of harmonic analysis used to implement the forms of the large sieve inequality, including the Riemann Hypothesis over finite fields, and Property (T) or Property (tau) for discrete groups.


Advanced Number Theory with Applications

Advanced Number Theory with Applications

Author: Richard A. Mollin

Publisher: CRC Press

Published: 2009-08-26

Total Pages: 440

ISBN-13: 1420083295

DOWNLOAD EBOOK

Exploring one of the most dynamic areas of mathematics, Advanced Number Theory with Applications covers a wide range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory. Written by a recognized leader in algebra and number theory, the book includes a page reference for every citing in the bibliography and mo


The Development of the Number Field Sieve

The Development of the Number Field Sieve

Author: Arjen K. Lenstra

Publisher: Springer

Published: 2006-11-15

Total Pages: 138

ISBN-13: 3540478922

DOWNLOAD EBOOK

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.


Not Always Buried Deep

Not Always Buried Deep

Author: Paul Pollack

Publisher: American Mathematical Soc.

Published: 2009-10-14

Total Pages: 322

ISBN-13: 0821848801

DOWNLOAD EBOOK

Number theory is one of the few areas of mathematics where problems of substantial interest can be fully described to someone with minimal mathematical background. Solving such problems sometimes requires difficult and deep methods. But this is not a universal phenomenon; many engaging problems can be successfully attacked with little more than one's mathematical bare hands. In this case one says that the problem can be solved in an elementary way. Such elementary methods and the problems to which they apply are the subject of this book. Not Always Buried Deep is designed to be read and enjoyed by those who wish to explore elementary methods in modern number theory. The heart of the book is a thorough introduction to elementary prime number theory, including Dirichlet's theorem on primes in arithmetic progressions, the Brun sieve, and the Erdos-Selberg proof of the prime number theorem. Rather than trying to present a comprehensive treatise, Pollack focuses on topics that are particularly attractive and accessible. Other topics covered include Gauss's theory of cyclotomy and its applications to rational reciprocity laws, Hilbert's solution to Waring's problem, and modern work on perfect numbers. The nature of the material means that little is required in terms of prerequisites: The reader is expected to have prior familiarity with number theory at the level of an undergraduate course and a first course in modern algebra (covering groups, rings, and fields). The exposition is complemented by over 200 exercises and 400 references.


Opera de Cribro

Opera de Cribro

Author: John B. Friedlander

Publisher: American Mathematical Soc.

Published: 2010-01-01

Total Pages: 554

ISBN-13: 0821869698

DOWNLOAD EBOOK