Prime numbers: emergence and victories of bilinear forms decomposition (Q2448485)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6290998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Prime numbers: emergence and victories of bilinear forms decomposition |
scientific article; zbMATH DE number 6290998 |
Statements
Prime numbers: emergence and victories of bilinear forms decomposition (English)
0 references
30 April 2014
0 references
Summary: This note covers the historical evolution of the main results about prime numbers and related problems. It has the purpose to provide the beginners with some mathematical background to understand where difficulties lie and where the field is open. It starts with the early observations made by Goldbach and the following results by Euler, Gauss and Dirichlet. The note explores some modern methods likes Kloosterman sums, sieve methods, combinatorial approaches, Euler products, density estimates, finishing with the method of bilinear forms.
0 references
prime number
0 references
bilinear form
0 references
Riemann zeta-function
0 references
sieve
0 references
divisor function
0 references
Möbius function
0 references
0.8705364
0 references
0.86914957
0 references
0.8668064
0 references
0.86160934
0 references
0.86160934
0 references
0.86104697
0 references