Skip to main content
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
Search options questions only not deleted user 12176

On the blending of real/complex analysis with number theory. The study involves distribution of prime numbers and other problems and helps giving asymptotic estimates to these.

8 votes
2 answers
747 views

The smallest volume possible for a lattice with integer distances?

Let $\Lambda \subset\mathbb{R}^n$ be a lattice satisfying $\|x-y\|_2^2 \in \mathbb{Z}$ for all $x,y\in\Lambda$. How small can $\text{vol}(\Lambda)=\det(\Lambda)$ be? For example, in dimension $2$, the …
Eric Naslund's user avatar
  • 11.4k
14 votes
2 answers
3k views

Zeta Function: Zero Density Theorems.

I was reading about some of the zero density Theorems for my Analytic Number Theory Topics course. While looking over some more complicated results and proofs a few simple questions came up: First, …
Eric Naslund's user avatar
  • 11.4k
7 votes
3 answers
1k views

Asymptotic Formula for a Mertens Style Sum

Hello, I am wondering if there is a simple asymptotic formula for $$\sum_{p\leq x}\frac{\left(\log p\right)^{k}}{p},$$ where $k\geq0$ is some integer. If $k$ is $0,$ by using the Prime Number Theor …
Eric Naslund's user avatar
  • 11.4k
24 votes
1 answer
690 views

Gaussian primes in small boxes

The best unconditional result bounding prime gaps is due to Baker, Harman and Pintz, and states that for any sufficiently large $n$, the interval $$[n,n+Cn^{0.525}]$$ contains a prime, for some consta …
Eric Naslund's user avatar
  • 11.4k
8 votes
3 answers
2k views

Evaluating the integral $\int_0^\infty \frac{\psi(x)-x}{x^2}dx.$

Let $\psi(x)=\sum_{n\leq x} \Lambda(n)$ be the weighted prime counting function. I am trying to evaluate the integral $$\kappa:=\int_{1}^{\infty}\frac{\psi(x)-x}{x^{2}}dx$$ in several different ways. …
Eric Naslund's user avatar
  • 11.4k
15 votes
2 answers
1k views

Evaluating the integral $\int_{1}^{\infty}\frac{\{u\}}{u^{2}}\left(\log u\right)^{k}du.$

I am trying to find a formula for the following integral for non-negative integer $k$: $$\int_1^{\infty}\frac{\{u\}}{u^{2}}\left(\log u\right)^{k}du.$$ My first thought was to use the formula $$\ze …
Eric Naslund's user avatar
  • 11.4k
20 votes
1 answer
1k views

Quantitative lower bounds related to Zhang's theorem on bounded gaps

Let $\mathcal{H}=\left\{ h_{i}\right\} _{i=1}^{k}$ be an admissible set, and define $$\pi_{\mathcal{H}}(x)=\left|\left\{ n\leq x\ :\ \exists\ i,j\leq k,\ i\neq j\ \text{such that both }n+h_{i},\ n+h_ …
Eric Naslund's user avatar
  • 11.4k
10 votes
1 answer
1k views

Can the Brun-Titchmarsh theorem be improved when the modulus is smooth?

For $q,a$ relatively prime, let $\pi(x,q,a)$ denote the number of primes less than $x$ which are congruent to $a$ modulo $q$. The Brun-Titchmarsh theorem states that $$\pi(x,q,a)\leq \frac{(2+o(1))x}{ …
Eric Naslund's user avatar
  • 11.4k
9 votes
1 answer
395 views

The difference between consecutive primes in arithmetic progressions

Let $\pi(x)=\sum_{p\leq x}$ denote the prime counting function. A well known result of Baker, Harman, and Pintz on prime gaps states that for $x\geq y\geq x^{0.525}$ we have that $$\pi(x+y)-\pi(x)\gg …
Eric Naslund's user avatar
  • 11.4k
11 votes
1 answer
1k views

The Bombieri Vinogradov Theorem restricted to moduli divisible by $k$

The Bombieri-Vinogradov Theorem states that given $A>0$, there exists $B>0$ such that for $Q=\sqrt{x}\left(\log x\right)^{-B},$ we have $$\sum_{q\leq Q}\max_{y\leq x}\max_{\begin{array}{c} a\text{ mo …
Eric Naslund's user avatar
  • 11.4k
7 votes
1 answer
1k views

The Correlation of the Möbius Function and Dirichlet Characters

Let $\chi$ be a Dirichlet character, and define $\phi_\chi (n)$ so that it satisfies $$\sum_{n=1}^\infty \phi_\chi (n)n^{-s}=\frac{\zeta(s-1)}{L(s,\chi)}.$$ In other words $$\phi_{\chi}(n)=\sum_{d| …
Eric Naslund's user avatar
  • 11.4k
54 votes
4 answers
3k views

When has the Borel-Cantelli heuristic been wrong?

The Borel-Cantelli lemma is very frequently used to give a heuristic for whether or not certain statements in number theory are true. For example, it gives some evidence that there are finitely many …
Eric Naslund's user avatar
  • 11.4k