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 |
This tag is used if a reference is needed in a paper or textbook on a specific result.
4
votes
Best known bounds for $\left|\sum_{n<x}\mu(nk)\right|$ (Reference request)
As Ofir says this shouldn't be a problem to prove directly using Perron. But let me describe another way to get the same result: we shall use the well-known result of Davenport that for any $A>0$ one …
4
votes
Accepted
Best known bounds for $\left|\sum_{n<x}\mu(nk)\right|$ (Reference request)
We use the bound given by my previous answer: $$\sum_{n<x}\mu(kn)\ll_A \frac{kx}{(\log (kx))^A}.$$ Now we improve this bound by using that the sum $$\sum_{d \in \mathbb N\atop d\mid n, d\mid k}\mu(d)$ …
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 …
5
votes
Accepted
Explicit bounds on number of squarefree numbers coprime to a certain number
I am assuming that explicit refers to the error term? In this case you can write $$Q_A(x)=\sum_{d\mid A}\mu(d)\sum_{k\leq \sqrt x \atop \gcd(A,k)=1}\mu(k)\left[\frac{x}{dk^2}\right],$$ where $[t]$ den …
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 …