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 471408
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.
0
votes
0
answers
130
views
How to estimate sums over arithmetic progressions?
For $x>1$
$$
N(x)=\sum_{0<n<x \\n \equiv 1 \pmod 4\\ n\text{ squarefree}} 1
$$
How to estimate $N(x)$'s order? (Like $N(x) \sim Ax$)
Furthermore, for $n=p_1p_2\cdots p_v$, define $\alpha (n)=v$ ,the …
- 1