Главная
Study mode:
on
1
The Selberg sieve Lecture 1
2
Introduction
3
Heuristics about the number of twin primes
4
Naive heuristics
5
Hardy - Little Wood
6
Probability
7
Goal of the next lectures: Bounds of the forms
8
Simple Sieve: Sieve of Eratosthenes
9
Extension Bateman - Horn Conjecture
10
Goal: detect primes in sequences
11
Example: n prime
12
Simple upper bound sieve
13
Twin primes
14
By Chinese remainder theorem wd is multiplicative
Description:
Explore the foundations of the Selberg sieve in this comprehensive lecture from the Workshop on Additive Combinatorics. Delve into heuristics about twin primes, including naive approaches and the Hardy-Littlewood method. Examine probability concepts and learn about the goals for upcoming lectures. Investigate the simple Sieve of Eratosthenes and its extension to the Bateman-Horn Conjecture. Discover techniques for detecting primes in sequences and analyze examples. Study simple upper bound sieves and their application to twin primes. Conclude with an exploration of the Chinese remainder theorem and its implications for multiplicative functions in sieve theory.

The Selberg Sieve - Lecture 1

International Centre for Theoretical Sciences
Add to list
0:00 / 0:00