• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
2020/2021

Научно-исследовательский семинар "Распределение простых чисел"

Лучший по критерию «Полезность курса для расширения кругозора и разностороннего развития»
Лучший по критерию «Новизна полученных знаний»
Статус: Дисциплина общефакультетского пула
Когда читается: 1, 2 модуль
Язык: английский
Кредиты: 3
Контактные часы: 30

Course Syllabus

Abstract

The set of prime numbers and its properties, such as distribution of primes in short intervals and arithmetic progressions, plays crucial role in modern number theory, as prime numbers are «bulding blocks» of integers. Course «Distribution of prime numbers» will be devoted to various results about prime numbers, starting from the most classical, such as the Prime Number Theorem and its connection with the Riemann Hypothesis, and ending with more modern and technically difficult ones, such as Vinogradov’s three primes theorem and Heath–Brown’s result on infinitude of twin primes in the case of existence of Siegel zeros. We will also touch on the questions on primes in short intervals and polynomial sequences and learn basics of sieve methods and other methods of analytic number theory along the way.
Learning Objectives

Learning Objectives

  • The course is intended to present basic and modern results in theory of prime numbers to the students and to provide an experience of solving number-theoretic problems related to presented results.
Expected Learning Outcomes

Expected Learning Outcomes

  • At the end of the course, students will be able to find estimates and asymptotic formulas for different counting functions of prime numbers arising in various areas of analytic number theory and to apply simplest sieve methods.
Course Contents

Course Contents

  • Summation of arithmetical functions, Dirichlet series, Perron's formula
  • Riemann zeta function, Dirichlet L-functions, Prime Number Theorem, primes in arithmetic progressions, Riemann hypothesis, Siegel-Walfisz theorem, Siegel zeros.
  • Sieve methods: sieve of Eratosthenes, Brun's theorem, Vinogradov's formula for von Mangoldt function and estimate for linear exponential sum with primes.
  • Any large enough natural number is a sum of three primes. Numbers of the form n^2-1 and n^2+1 with few prime factors. Romanov's theorem.
  • Smooth numbers, primes in short intervals and Rankin's theorem on large gaps between primes. *Irregularities in distribution of primes. *Twin primes and Siegel zeros.
Assessment Elements

Assessment Elements

  • non-blocking доклад
  • non-blocking домашнее задание
Interim Assessment

Interim Assessment

  • Interim assessment (2 module)
    0.7 * доклад + 0.3 * домашнее задание
Bibliography

Bibliography

Recommended Core Bibliography

  • Granville, A. (2014). What is the best approach to counting primes? Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsarx&AN=edsarx.1406.3754

Recommended Additional Bibliography

  • Heath-Brown, D. R. (2002). Lectures on sieves. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsarx&AN=edsarx.math%2f0209360