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
7
votes
Raising positive integer to $c\in\mathbb{R}-\mathbb{N}$ rarely gives an integer!
To expand on a comment of Lucia, when $c$ is irrational, we can show that there are at most $O((\log N)^2)$ values of $n\leq N$ such that $N^c$ is rational, let alone an integer.
Let $\mathcal{A}$ be …
6
votes
Iwaniec & Kowalski partial sums of multiplicative functions
For your second question, I think you're correct in noting that they are incorrectly applying their result. I'm sure some sort of result for the sum of squares characteristic function holds, but it do …
5
votes
Accepted
Upper bound of number of prime factors
To reiterate Stanley Yao Xiao's comment, one should not expect that $p-1$ has any more or less prime factors than a typical integer of size $p$. For an arbitrary integer $n$, the bound
$$
\omega(n) \l …
4
votes
0
answers
82
views
Gap results for squares times cubes
In studying the distribution of squarefree numbers in short intervals, Filaseta and Trifonov used some ingenious techniques to obtain various upper bounds for the size of the set
$$
S(X) = \left\{u\in …
11
votes
2
answers
737
views
Improving the error term in a classic sieving problem
I'm new to asking questions on MathOverflow, so forgive me if this question is not the kind of thing to be asked here.
Let $q$ be a positive integer and let $N$ be an integer with $1 \leq N \leq q$. T …
1
vote
0
answers
84
views
Sum of fractional parts over coprime residues
Let $q$ be a positive integer and $\theta$ a real number with $0 \leq \theta < 1$. Consider the two sums
$$
S_\theta^\pm(q)=\sum_{\substack{r=1\\ (r,q)=1}}^{q-1} \left\{\theta\pm\frac{r}{q} \right\},
…
11
votes
Density of fake zeros of Zeta
To add to GH from MO's answer, Chapter 10 of Iwaniec and Kowalski's "Analytic Number Theory" is another good reference. A few of the classical papers are
Ingham's "On the Estimation of $N(\sigma,T)$, …
7
votes
Accepted
On the nearest integer to $\zeta(1-1/B),B \ge 2$
We can make the error mentioned by Wojowu in his comment explicit by using some results on the Laurent coefficients of the zeta function. There are a few results on this, but I'll just use Theorem 2 o …
1
vote
0
answers
63
views
Optimal exponents in upper bound for 4-dimensional exponential sum
A classical result of Fouvry and Iwaniec states that if $\alpha_1,\ldots, \alpha_4$ are nonzero, $M_1,\ldots, M_4 \geq 1$, $X > 0$, and $|\varphi_{m_1,m_2}|,|\psi_{m_3,m_4}|\leq 1$ are complex numbers …
13
votes
About an asymptotic behavior in number theory
See this paper of Naslund, specifically Proposition 3. That result, along with the prime number theorem, shows that
$$
\frac{1}{\pi(N)} \sum_{p\leq N} \left\{ \frac{N}{p} \right\} \sim 1-\gamma,
$$
wh …
9
votes
1
answer
344
views
Large values of $\zeta(1/2+it)$ from sums of short moments
In a now classical paper, Iwaniec proved the following theorem.
Theorem. Let $T \geq 2$, $T^{1/2} < T_0 \leq T$ and $T \leq t_1 < t_2 < \cdots < t_R \leq 2T$, $t_{r+1} - t_r \geq T_0$. Then
$$
\tag{1} …
10
votes
Accepted
Large values of $\zeta(1/2+it)$ from sums of short moments
I wrestled with this question for an annoyingly long time. Now understanding things much better, I'm a bit embarrassed that this took me so long to figure out (such is the process of learning though). …
6
votes
Approximation of partial sum over prime omega function
By partial summation, one has
$$
S(N) = N\sum_{n=1}^N \omega(n) - \int_{1}^N \bigg(\sum_{n\leq t} \omega(n)\bigg) dt.
$$
Using Mertens' theorem with the classical error term in the prime number theore …
6
votes
1
answer
253
views
Question about Größencharaktere in imaginary quadratic number fields
Presumably, one could ask this question for a Größencharakter in an arbitrary number field, but I'll restrict my attention to the case I'm interested in. Let $K$ be an imaginary quadratic field with r …
4
votes
1
answer
221
views
Characters on ray class groups
Let $K$ be an algebraic number field, $\mathcal{O}_K$ its ring of integers, $\mathfrak{m}$ an integral ideal of $\mathcal{O}_K$. Let $J$ be the set of all fractional ideals, $P$ the set of principal f …