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
0
answers
174
views
Is the sequence $\{\Omega(n)\alpha\}$ uniformly distributed in $[0,1)$?
For a positive integer $n$, let $\Omega(n)$ be the number of primes dividing $n$, counted with multiplicities (eg $\Omega(5)=1$, $\Omega(8)=\Omega(12)=3$).
For a real number $x$, let $\{x\}\in[0,1)$ …
11
votes
2
answers
800
views
Density of the "multiplicative odd numbers"
I am interested in the set $A$ of all positive integer numbers such that when factored into primes, the sum of the exponents is odd (I think of $A$ as the multiplicative odd numbers).
I want to know …
8
votes
0
answers
317
views
Does every multiplicative function have a logarithmic average?
Is it true that for every completely multiplicative function $f:\mathbb N\to\mathbb C$
with $|f(n)|=1$ for all $n$, the logarithmic average
$$\lim_{N\to\infty}\frac1{\log N}\sum_{n=1}^N\frac1nf …
2
votes
1
answer
387
views
Extension of a formula for the quadratic Gauss sums
I am interested in the sums
$$g(a,k)=\sum_{n=0}^{p-1}e^{2\pi i a n^k/p}$$
where $p\equiv1\mod k$ is a prime and $a$ is coprime with $p$.
When $k=2$, it is a classical fact that $g(a,2)=\chi(a)g(1,2)$ …
13
votes
1
answer
931
views
Is the set of multiplicatively even numbers thick?
A positive integer is multiplicatively even (odd) if, when decomposed into primes, the sum of the exponents is even (odd).
A subset of the integers is thick if it contains arbitrarily long intervals $ …
1
vote
0
answers
164
views
Are the Beatty primes asymptotically (Gowers) uniform?
A result of Green and Tao (initially conditional on two conjectures which were eventually settled by them and Ziegler) states that for any $s\in\mathbb N$,
$$\lim_{w\to\infty}\limsup_{N\to\infty}\sup_ …
10
votes
2
answers
1k
views
Bounding exponential sum with square roots
It is well known that for each $m\in\mathbb{N}$
$$\lim_{N\to\infty}\frac1N\sum_{n=1}^Ne^{2\pi i\sqrt{nm}}=0$$
My question is whether there is some uniformity in the variable $m$.
More precisely, is it …
1
vote
Accepted
On an attempt to create interesting variants of Firoozbakht's conjecture, evoking combinatio...
Yes, (2) holds for all large enough $n$.
According to Wikipedia (see also this question) $\frac{p_n}n=\log n+\log\log n-1+\frac{\log\log n}{\log n}(1+o(1))$, so
$$\frac{n+p_{n+1}}{n+1}=\log(n+1)+\log\ …
19
votes
Accepted
Prime plus square equals prime
Tao and Ziegler extended the Green-Tao theorem to the polynomial setting. As a very special case we get that any subset of the primes with positive relative density contains a difference which is a sq …