Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with nt.number-theory
Search options not deleted
user 140856
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
0
votes
0
answers
181
views
Prime counting function estimate sieve of Eratosthenes-Legendre
I'm trying to arrive at estimate 1.17 (page 21) of Koukoulopoulos lecture notes [https://dms.umontreal.ca/~koukoulo/documents/notes/sievemethods.pdf]
$$\#\{n \leq x : p|n \Rightarrow p > \sqrt{x}\} = …
15
votes
1
answer
1k
views
Why do Maynard-Tao weights succeed?
I'm attempting to understand why the Maynard-Tao weights are successful in proving bounded gaps between primes, but the GPY weights are not.
These two posts do an excellent job in giving an overview …
4
votes
Why do Maynard-Tao weights succeed?
TLDR: I have two questions thanks in advance:
Can we assume that the $w_{n}$ are smooth approximations and if so why? I've always struggled in knowing when it is permissible / how to find smooth app …