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 divisors-multiples
Search options not deleted
user 333969
For questions on divisors and multiples, mainly but not exclusively of integers, and related and derived notions such as sums of divisors, perfect numbers and so on.
14
votes
2
answers
922
views
How many divisors of $n$ are below $n^{1/3}$?
I am trying to bound a function that includes $\sum\limits_{\substack{d < n^{1/3} \\ d \mid n}} 1$.
Is there an upper bound known for this sum, either in general or in terms of $\sum\limits_{\substack …
- 263