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 |
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.
15
votes
4
answers
2k
views
On the vanishing of the generalized von Mangoldt function $\Lambda_k(n)$ when $n$ has more t...
It is a well-known fact that the generalized von Mangoldt function, defined by
$$\displaystyle \Lambda_k(n) = \sum_{d | n} \mu(d) \left(\log \frac{n}{d}\right)^k$$
vanishes whenever $n$ has more tha …
14
votes
0
answers
437
views
Is every prime $q$ of the form $x^2 + py^2$ for some prime $p<q$?
For every odd prime $q \geq 3$, does there exist a prime $p < q$ and integers $x,y$ such that
$$\displaystyle x^2 + py^2 = q?$$
One can easily show that all primes $q \not \equiv -1 \pmod{3}$ can be w …
12
votes
2
answers
614
views
Are there any notion of 'almost primes' known to have small gaps?
A notorious question with prime numbers is estimating the gaps between consecutive primes. That is, if $(p_n)_{n \geq 1}$ is the canonical enumeration of the primes, then set $g_n = p_{n+1} - p_n$. It …
10
votes
1
answer
683
views
Averaging $2^{\omega(n)}$ over a region
Let $R(X)$ be the region defined by
$$\displaystyle R(X) = \{(a,b,c) \in \mathbb{R}^3 \colon |b| \leq a \leq c, \, a,c \geq 1, \, a(4ac-b^2) \leq X\}.$$
I want to know how to estimate the sum
$$\di …
8
votes
0
answers
173
views
Equidistribution of roots of quadratic congruences
Let $f(x) \in \mathbb{Z}[x]$ be an irreducible quadratic polynomial, and let $0 \leq \alpha \leq \beta \leq 1$ be real numbers. Put
$$\displaystyle S_f(\alpha, \beta; d) = |\{v \in \{1, \cdots, d\} : …
8
votes
2
answers
969
views
Density of integers with many divisors
By Dirchlet's hyperbola method, one can prove that the average number of divisors of integers $1 \leq n \leq X$ is $\log X$. This question concerns the number of integers $n \leq X$ such that the numb …
7
votes
2
answers
616
views
Density of integers with many prime factors
For a positive integer $n$ put $\omega(n)$ for the number of distinct prime divisors of $n$. It is a well-known theorem of Erdős and Kac that the probability distribution for the quantity
$\displayst …
7
votes
1
answer
383
views
Averaging Chebotarev's density theorem over families of number fields
The Chebotarev density theorem is one of the most celebrated and important results in number theory. We state the following version: for a number field $K$, Galois over $\mathbb{Q}$ with Galois group …
6
votes
0
answers
192
views
Mahler's theorem in the primes
Let $F(x,y)$ be an irreducible binary form with integer coefficients and degree $d \geq 3$. Denote by $A_F$ the area of the region
$$\displaystyle \{(x,y) \in \mathbb{R}^2 : |F(x,y)| \leq 1\}.$$
It …
6
votes
2
answers
2k
views
Does this multiplicative function have a name? If so, what is known about it?
It is well-known that the Euler $\phi$-function is multiplicative: that is, for co-prime positive integers $m,n$ we have $\phi(mn) = \phi(m)\phi(n)$. Thus it is defined by its values on prime powers. …
6
votes
0
answers
104
views
Cubic, abelian analogue of a result of Mertens-Siegel
For a number field $K/\mathbb{Q}$, put $h_K, R_K$ respectively for the class number (of the ring of integers $\mathcal{O}_K$ of $K$) and the regulator of $K$ respectively. Moreover, put $\zeta_K(s)$ f …
6
votes
0
answers
196
views
Quadratic fields with moderately large fundamental units
Let $d > 1$ be a fundamental discriminant, and let $K_d = \mathbb{Q}(\sqrt{d})$. Denote by $\varepsilon_d$ the fundamental unit of $\mathcal{O}_{K_d}$, namely the smallest algebraic integer $\varepsil …
6
votes
1
answer
283
views
Pólya–Vinogradov inequality for Eisenstein integers
The Pólya–Vinogradov inequality asserts that a non-principal Dirichlet character $\chi$ with modulus equal to $q$ satisfies
$$\displaystyle \left \lvert \sum_{N < n < N+M} \chi(n) \right \rvert = O \l …
6
votes
1
answer
612
views
Sum of the divisor function over integers with restricted prime factors
Let $a,q$ be co-prime integers and let $P(a,q)$ denote the set of primes congruent to $a$ modulo $q$. Is it known whether one can give an asymptotic formula for the expression
$$\displaystyle \sum_{\ …
6
votes
1
answer
215
views
A number similar to Landau's Totient constant
The real number given by the absolutely convergent series
$$\displaystyle A = \sum_{k=1}^\infty \frac{|\mu(k)|}{k \phi(k)}$$
is known as Landau's Totient Constant. It can be explicitly evaluated to be …