Book Description
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.
Author : Heine Halberstam
Publisher : Courier Corporation
Page : 386 pages
File Size : 17,2 MB
Release : 2013-09-26
Category : Mathematics
ISBN : 0486320804
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.
Author : Alina Carmen Cojocaru
Publisher : Cambridge University Press
Page : 250 pages
File Size : 11,44 MB
Release : 2005-12-08
Category : Mathematics
ISBN : 9780521848169
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.
Author : G. R. H. Greaves
Publisher : Cambridge University Press
Page : 360 pages
File Size : 38,16 MB
Release : 1997-01-30
Category : Mathematics
ISBN : 0521589576
State-of-the-art analytic number theory proceedings.
Author : Glyn Harman
Publisher : Princeton University Press
Page : 380 pages
File Size : 37,45 MB
Release : 2012-11-26
Category : Mathematics
ISBN : 1400845939
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.
Author : C. Hooley
Publisher :
Page : 122 pages
File Size : 33,92 MB
Release : 1976
Category : Cribles (Mathématiques)
ISBN :
Author : George Greaves
Publisher : Springer Science & Business Media
Page : 312 pages
File Size : 36,39 MB
Release : 2013-03-09
Category : Mathematics
ISBN : 366204658X
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.
Author : E. Kowalski
Publisher : Cambridge University Press
Page : 316 pages
File Size : 34,84 MB
Release : 2008-05-22
Category : Mathematics
ISBN : 9780521888516
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.
Author : John B. Friedlander
Publisher : American Mathematical Soc.
Page : 554 pages
File Size : 12,11 MB
Release : 2010-06-22
Category : Mathematics
ISBN : 0821849700
This is a true masterpiece that will prove to be indispensable to the serious researcher for many years to come. --Enrico Bombieri, Institute for Advanced Study This is a truly comprehensive account of sieves and their applications, by two of the world's greatest authorities. Beginners will find a thorough introduction to the subject, with plenty of helpful motivation. The more practised reader will appreciate the authors' insights into some of the more mysterious parts of the theory, as well as the wealth of new examples. --Roger Heath-Brown, University of Oxford, Fellow of Royal Society This is a comprehensive and up-to-date treatment of sieve methods. The theory of the sieve is developed thoroughly with complete and accessible proofs of the basic theorems. Included is a wide range of applications, both to traditional questions such as those concerning primes, and to areas previously unexplored by sieve methods, such as elliptic curves, points on cubic surfaces and quantum ergodicity. New proofs are given also of some of the central theorems of analytic number theory; these proofs emphasize and take advantage of the applicability of sieve ideas. The book contains numerous comments which provide the reader with insight into the workings of the subject, both as to what the sieve can do and what it cannot do. The authors reveal recent developements by which the parity barrier can be breached, exposing golden nuggets of the subject, previously inaccessible. The variety in the topics covered and in the levels of difficulty encountered makes this a work of value to novices and experts alike, both as an educational tool and a basic reference.
Author : Arjen K. Lenstra
Publisher : Springer
Page : 138 pages
File Size : 10,70 MB
Release : 2006-11-15
Category : Mathematics
ISBN : 3540478922
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.
Author : Hans Riesel
Publisher : Springer Science & Business Media
Page : 481 pages
File Size : 36,52 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461202515
In the modern age of almost universal computer usage, practically every individual in a technologically developed society has routine access to the most up-to-date cryptographic technology that exists, the so-called RSA public-key cryptosystem. A major component of this system is the factorization of large numbers into their primes. Thus an ancient number-theory concept now plays a crucial role in communication among millions of people who may have little or no knowledge of even elementary mathematics. The independent structure of each chapter of the book makes it highly readable for a wide variety of mathematicians, students of applied number theory, and others interested in both study and research in number theory and cryptography.