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 | |
Results tagged with arithmetic-functions
Search options not deleted
user 50610
An arithmetic function is one whose domain is the positive integers and whose range is a subset of the complex numbers. There are a number of important number-theoretic examples.
2
votes
1
answer
275
views
sum over primes involving divisor function (variation of the Titchmarsh divisor problem)
This question was also asked on MSE.
Does there exist an asymptotic estimate for the following sum over primes
$$
\sum_{p\leq x} \frac{\tau(p-1)}{p}\;,
$$
where $\tau(n)=\sum_{d|n}1$ is the divisor fu …
- 215