<--- Back to Details
First PageDocument Content
Prime numbers / Inequalities / Integer sequences / Riemann hypothesis / Extremal graph theory / Turán–Kubilius inequality / Primes in arithmetic progression / Turán graph / Erdős–Turán inequality / Mathematics / Number theory / Analytic number theory
Date: 2006-11-05 15:16:15
Prime numbers
Inequalities
Integer sequences
Riemann hypothesis
Extremal graph theory
Turán–Kubilius inequality
Primes in arithmetic progression
Turán graph
Erdős–Turán inequality
Mathematics
Number theory
Analytic number theory

Add to Reading List

Source URL: www.renyi.hu

Download Document from Source Website

File Size: 975,83 KB

Share Document on Facebook

Similar Documents

PRIME RECIPROCALS AND PRIMES IN ARITHMETIC PROGRESSION DANIEL LITT Abstract. This paper is an expository account of some (very elementary) arguments on sums of prime reciprocals; though the statements in Propositions 5 a

DocID: 1nBX3 - View Document

3. INFINITELY MANY PRIMES; COMPLEX ANALYSIS Dirichlet proved that there are infinitely many primes in every arithmetic progression a (mod q) with (a, q) = 1. Our next objective is to prove Dirichlet’s theorem, develop

DocID: 1lf32 - View Document

Prime number / Number / Primes in arithmetic progression / Mathematics / Number theory / Integer sequences

NeMeSiS News 2008 Newsletter of the National Mathematics Summer School Yow! Welcome to the 10th edition of NeMeSiS News!

DocID: 13zFM - View Document

János Pintz / Prime number / Ben J. Green / Srinivasa Ramanujan / Twin prime / Primes in arithmetic progression / Manjul Bhargava / Prime gap / Analytic number theory / Mathematics / Number theory / Number theorists

JAMES MAYNARD TO RECEIVE 2014 SASTRA RAMANUJAN PRIZE The 2014 SASTRA Ramanujan Prize will be awarded to Dr. James Maynard of Oxford University, England, and the University of Montreal, Canada. The SASTRA Ramanujan Prize

DocID: R3PX - View Document

Prime number

A BOUND FOR PROGRESSIONS OF LENGTH k IN THE PRIMES BEN GREEN AND TERENCE TAO Abstract. From our paper in [1], we extract a quantitative upper bound for the size of the first arithmetic progression of primes of length k;

DocID: GJrk - View Document