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 32332
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.
6
votes
Accepted
Sum of divisor function over arithmetic progression
In the context of the "divisor problem for arithmetical progressions",
there is the following article by Fouvry, Iwaniec and Katz, on "The divisor function over arithmetic progressions": http://matwbn …
- 12.1k
4
votes
Accepted
Finding primes using Euler's sum of divisors recurrence relation
Perhaps a summary of the comments is useful. Using Euler's formula for $\sigma(n)$ to test $n$ for primality
certainly is not efficient. The values $\sigma(n-1),\sigma(n-2),\sigma(n-5),\cdots $ are ha …
- 12.1k