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.
4
votes
1
answer
235
views
Conditional convergence of Artin $L$-functions
Let $k$ be a number field and $V$ a non-trivial irreducible Artin representation over $k$. Consider the associated Artin $L$-function with corresponding Euler product decomposition $L(V,s)= \prod_v L_ …
13
votes
Accepted
Can you use the delta method for number fields?
Yes. See the paper:
Browning, T. D.; Vishe, P. Cubic hypersurfaces and a version of the circle method for number fields, Duke Math. J. 163 (2014), no. 10, 1825–1883, doi:10.1215/00127094-2738530, arX …
13
votes
4
answers
2k
views
Proving Mertens' theorem using the prime number theorem
Mertens' Theorem states that
$$\sum_{p \leq x}\frac{1}{p} = \log \log x + M + O(1/\log x).$$
This is weaker than the prime number theorem; in fact according to the Wikipedia page, the prime number the …
4
votes
Accepted
Hardy-Littlewood circle method for non-diagonal quadratic forms
The "best" way to deal with quadratic forms using the circle method is via Heath-Brown's delta symbol method.
You can read about this in detail in the paper:
Heath-Brown - A New Form of the Circle Met …
10
votes
Accepted
Is there a Chebotarev‘s theorem for non-Galois extension over Q?
Actually the usual Chebotarev density theorem in the Galois case can also be applied to the non-Galois case.
For example, consider a non-Galois cubic extension $K=\mathbb{Q}[x]/(f)$. I claim that the …
6
votes
Density of $d$ for which a generalized Pell equation has a solution
(Upgrading comments to answer.)
Counting the number of $D$ for which the equation has a rational solution is a fairly classical problem. This is asymptotic to $c_nD/(\log D)^{1/2}$ for some $c_n > 0$. …
13
votes
2
answers
581
views
Sum of Fibonacci sequence evaluated at a Dirichlet character
Let $F_n$ be the Fibonacci sequence and $\chi$ a non-principal primitive Dirichlet character. Does there exist $n$ such that $\chi(F_n) \neq 0,1$?
One way to prove this would be to obtain non-trivial …
12
votes
1
answer
521
views
Equidistribution of $\{\alpha p\}$ for $p$ in an arithmetic progression
Let $\alpha$ be irrational. A famous theorem of Vinogradov says that $\{ \alpha p\}$ is equidistributed in $[0,1]$ as $p$ runs over all primes.
Let $a,q$ be natural numbers with $\gcd(a,q) = 1$. Then …
2
votes
Conditions under which $\lim_{s\to1^+}\sum_{n=1}^{\infty}\frac{a_n}{n^s}=\sum_{n=1}^{\infty}...
In D. J. Newman's paper
A simple analytic proof of the prime number theorem
published in The American Mathematical Monthly
87 (1980) 693-696, Newman proved a result of this type which may also be …
1
vote
Accepted
Existence of analytic continuation of Dirichlet series corresponding to the indicator sequen...
Serre deals with problems of this type in the paper:
Serre -Divisibilité de certaines fonctions arithmétiques
The fact you want should follow from the results in Sections 1 and 2.
Alternatively, th …
1
vote
Accepted
Logarithms of $L$-functions of irreducible characters of Galois group
Yes this is the fact that for a non-trivial irreducible Artin character, the associated Artin L-function is holomorphic and non-zero on $\rm{re}\, s \geq 1$.
For the trivial character, one just obtai …
8
votes
Accepted
A sum of divisor functions
The first problem is completely solved in the paper:
Tim Browning - The divisor problem for binary cubic forms.
J. Théorie Nombres Bordeaux 23 (2011), 579-602.
The method is to change the order of …
8
votes
2
answers
385
views
Squareful values of polynomials
Recall that an integer $n$ is called squareful if for every prime $p$ with $p \mid n$, we also have $p^2 \mid n$.
Any squareful number can be written uniquely as $n= x^2 y^3$ where $y$ is squarefree. …
5
votes
Accepted
Density of "simultaneous squares"
This should be asymptotic to an expression of the form
$$\frac{cX^2}{\log X}$$
as $X \to \infty$, for some $c > 0$ (this should be interpreted as $(X/\sqrt{\log X}\,)^2$). Proving an upper bound of th …
5
votes
Accepted
Density of numbers whose prime factors belong to given arithmetic progressions
This result has been generalised a fair bit. The main generalisation is that you can replace congruence conditions by so-called "Frobenian conditions", namely conditions of the type which arise in the …