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
18
votes
3
answers
2k
views
A question on the prime divisors of p-1
For each positive integer n we may define the convergent sum $$ s(n)=\sum_{p}\frac{(n,p-1)}{p^2} $$
where the summation is over primes p and $(a,b)$ denotes the greatest common divisor of a,b.
It is …
15
votes
2
answers
1k
views
Correlations of $\phi(n)/n$
We know that the average of $\phi(n)/n$ is approximated by a constant. Here $\phi $ is the Euler quotient function. One can furthermore show asymptotics with a secondary main term, at least
for the sm …
14
votes
3
answers
1k
views
On the number of consecutive divisors of an integer
Define for $n \in \mathbb{N}$ the function $$\tau_1(n):=\sum_{\substack{d|n, \\ d+1|n}}1,$$ i.e. the number of consecutive divisors of an integer. The average of $\tau_1(n)$ is $1$ since $$\sum_{n\leq …
14
votes
4
answers
3k
views
Jacobi's theorem on sums of two squares (reference request)
One of Jacobi's theorems states that the number of representations of a positive integer $n$ as a sum of two squares of integers equals
$$4(d_1(n)-d_3(n)),$$
where the function $d_i$ counts the number …
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 …
12
votes
Accepted
On the natural density of almost perfect numbers
The natural density is $0$. This is due to the function $\sigma(n)/n$ possessing a continuous distribution, i.e. there exists a continuous function $\Phi:\mathbb{R}\to \mathbb{R}$ such that for all $a …
11
votes
2
answers
2k
views
Is there an explicit expression for the imaginary part of some non-trivial zero of zeta,
Is there an explicit expression for the imaginary part of some non-trivial zero of zeta, in terms of well-known constants, such as say $\gamma$ or $\pi$ say ?
10
votes
2
answers
1k
views
What are the current trends in class field theory?
Being far from an expert in the subject I was wondering if people can hint towards a modern exposition of the developments in the last 10 years ? Or if not then suggest some sub-subjects in CFT that a …
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 …
9
votes
1
answer
472
views
Error term in Davenport's sum $\sum_{n \leq x } \mu(n) \exp(2 \pi i \alpha n ) $
Reference request:
Davenport proved that for every fixed $N>1 $ one has $$ \sup_{\alpha \in \mathbb R } \left | \sum_{1\leq n \leq x } \mu(n) \exp(2 \pi i \alpha n )\right | = O_N\left( \frac{x}{(\log …
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 …
7
votes
Accepted
Siegel-Walfisz for the Möbius function
The Siegel-Walfisz principle for a function $f(n)$ states that for all $A>0$ fixed then whenever $a$ modulo $q$ is a residue class with $a$ and $q$ coprime then one has $$\sum_{\substack{n\leq x \\ n …
7
votes
2
answers
424
views
Divisor sums over values of binary forms of primes
Let $\tau$ be the divisor function, that is
$$
\tau(n)=\sharp\{d \in \mathbb{N}, d|n\}.
$$
I was wondering if anyone has ever proved an asymptotic estimate
for the sum
$$S(x):=\sum_{p,q\leq x}\tau(p …
6
votes
1
answer
381
views
Least prime in Artin's primitive root conjecture
Let $a$ be an integer which is neither a square nor $-1$. Artin's conjecture states that there are infinitely many primes $p$ for which $a$ is a primitive root modulo $p$. My question is whether there …
6
votes
0
answers
504
views
$x^2+1$ attaining almost prime values
Iwaniec, using the linear sieve, proved that $n^2+1$ can be a product of at most two primes infinitely often and furthermore a lower bound of the correct order of magnitude for the number of such inte …