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 |
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
1
vote
2
answers
129
views
Bounds of zeta function near $\Re(s)=1$
Richert proved in
https://link.springer.com/article/10.1007/BF01399533
that $$ \zeta(s) =O\left( |\Im(s)|^{100(1-\Re(s))^{3/2}} (\log |\Im(s)|)^{2/3}\right)$$ uniformly in the region $\Re(s)\in [1/2,1 …
1
vote
1
answer
180
views
Conjectured error term when counting square-free integers
It is well know that the density of positive square-free integers up to $x$ is asymptotically $x/\zeta(2)$. The error term
$$ E(x)=\sum_{1\leq n \leq x } \mu(n)^2 -\frac{x}{\zeta(2)}
$$ can easily p …
3
votes
2
answers
440
views
Least number coprime to a given integer
For a positive integer $n$ let $$f(n):=\min\{m\in \mathbb N: m>1, \gcd(m,n)=1\} .$$
Equivalently, $f(n) $ is the smallest prime not dividing $n$.
Is there any upper bound literature for this? It is no …
3
votes
0
answers
74
views
shifted convolution in arithmetic progressions
Let $r(n)$ be the number of ways of writing $n$ as the sum of two integer squares. Asymptotics for the shifted convolution problem $$ \sum_{n\in \mathbb N\cap[1,x]}r(n) r(n+1)$$ are quite classical; a …
0
votes
1
answer
209
views
number of representations by sums of three squares (with coefficients)
There are formulas for counting the number of representations of a positive integer $N$ as a sum of three integer squares. What is a reference for
$$
\#\{(x,y,z)\in \mathbf{N}^3: 5^4 x^2+y^2+z^2=N\}
? …
2
votes
0
answers
117
views
polynomials with no repeated factors
Assume that $F(x_1,\ldots, x_n)$ is a polynomial with integer coefficients that is "square-free" over $\mathbb Q$, i.e. it does not have repeated polynomial factors whose coefficients are in $\mathbb …
10
votes
2
answers
926
views
$\psi(x)-x$ on average
This is a reference question:
Let $\psi(x)$ be the psi-Chebyshev function. Is there any unconditional result in the literature that proves that there exists $0<a<2$ such that
$$
\int_2^x (\psi(y)-y)^2 …
2
votes
1
answer
96
views
A sum related to the first moment of quadratic $L$-functions at $s=1$
Let $(\frac{m}{n})$ be the Jacobi quadratic symbol defined for positive squarefree odd integers $n,m$. Does the following sum go to infinity?
$$
\sum_{1\leq n \leq (\log x)^{100} } \mu^2(2n) \sum_{(\l …
2
votes
1
answer
137
views
Weak Siegel–Walfisz property
Let $f:\mathbb N \to \mathbb C$ be an arithmetic function. There are various ways to define what the Siegel–Walfisz (S–W) property is for $f(n)$. One simple way is that
there exists some function $g …
2
votes
Average value of the prime omega function $\Omega$ on predecessors of prime powers
One can prove that in fact the function mpe has bounded average which clearly improves $\log \log$. If a positive integer n has $mpe(n)=m$ then there exists a prime power p^m that divides n hence the …
2
votes
0
answers
158
views
Quadratic patterns in summands of Goldbach's conjecture
Let $n $ be even and define
$$ Q(n)=\sum_{\substack{ p,q \ \textrm{ primes} \\p+q=n }}\left(\frac{p}{q} \right),$$ where $\left(\frac{p}{q} \right)$ is the quadratic Legendre symbol.
Has this sum been …
8
votes
0
answers
224
views
The *actual* size of the first quadratic non-residue
Let $p$ be an odd prime and define $n(p)$ be the smallest positive quadratic non-residue modulo $p$. By Ankeny and later effective work of Lamzouri, Li, and Soundararajan we know that under GRH one ha …
3
votes
1
answer
214
views
Perfect equidistribution for the Legendre symbol
Let $p $ be an odd prime. Assume that we have the following perfect pattern:
all the primes below $p$ are successively quadratic residues and quadratic non-residues. What can we say about $p$? Is it p …
4
votes
0
answers
209
views
No perfect patterns in the primes
The primes are equidistributed in the residue classes $1(\!\!\!\mod{4})$ and $3(\!\!\!\mod 4)$. We also know (for example, by Rubinstein-Sarnak) that the patterns cannot be eventually alternating, i.e …
12
votes
2
answers
431
views
Asymptotic for the average of $|d(n)-\log n|$?
Let $d(n)$ be the number of positive integers that divide $n$. It is well known that $d(n)$ is on average $\log n$. However, it is also well known that for most $n$ the number $d(n)$ is rather close t …